You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tinkerpop.apache.org by "Marko A. Rodriguez (JIRA)" <ji...@apache.org> on 2016/03/17 14:20:33 UTC

[jira] [Closed] (TINKERPOP-1209) ComparatorHolder should returns a Pair.

     [ https://issues.apache.org/jira/browse/TINKERPOP-1209?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Marko A. Rodriguez closed TINKERPOP-1209.
-----------------------------------------
       Resolution: Fixed
    Fix Version/s: 3.2.0-incubating

> ComparatorHolder should returns a Pair<Traversal,Comparator>.
> -------------------------------------------------------------
>
>                 Key: TINKERPOP-1209
>                 URL: https://issues.apache.org/jira/browse/TINKERPOP-1209
>             Project: TinkerPop
>          Issue Type: Improvement
>          Components: process
>    Affects Versions: 3.1.1-incubating
>            Reporter: Marko A. Rodriguez
>            Assignee: Marko A. Rodriguez
>              Labels: breaking
>             Fix For: 3.2.0-incubating
>
>
> Right now {{ComparatorHolder}} has a method:
> {code}
> List<Comparator> getComparators()
> {code}
> This should really be:
> {code}
> List<Pair<Traversal<?,E>,Comparator<E>>> getComparators()
> {code}
> By doing this, we will be able to order during the {{Memory}}-reduction in Gremlin OLAP. We will be able to create values that look like this:
> {code}
> [[32, "marko"], v[1]]
> [[12, "stephen"], v[7]]
> [[67, "daniel"], v[8]]
> ...
> {code}
> Then there will be an {{OrderBiOperator}} that will have a {{List<Compartor>}} that, for the example above, is size 2. It will then be able to use the already computed traversal ends to sort the vertices.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)