| /* |
| * Licensed to the Apache Software Foundation (ASF) under one |
| * or more contributor license agreements. See the NOTICE file |
| * distributed with this work for additional information |
| * regarding copyright ownership. The ASF licenses this file |
| * to you under the Apache License, Version 2.0 (the |
| * "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, |
| * software distributed under the License is distributed on an |
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| * KIND, either express or implied. See the License for the |
| * specific language governing permissions and limitations |
| * under the License. |
| */ |
| package org.apache.tinkerpop.gremlin.process.traversal.step.map; |
| |
| import org.apache.tinkerpop.gremlin.process.traversal.Order; |
| import org.apache.tinkerpop.gremlin.process.traversal.Traversal; |
| import org.apache.tinkerpop.gremlin.process.traversal.step.ComparatorHolder; |
| import org.apache.tinkerpop.gremlin.process.traversal.step.TraversalParent; |
| import org.apache.tinkerpop.gremlin.process.traversal.step.util.CollectingBarrierStep; |
| import org.apache.tinkerpop.gremlin.process.traversal.step.util.ComparatorTraverser; |
| import org.apache.tinkerpop.gremlin.process.traversal.step.util.TraversalComparator; |
| import org.apache.tinkerpop.gremlin.process.traversal.traverser.TraverserRequirement; |
| import org.apache.tinkerpop.gremlin.process.traversal.traverser.util.TraverserSet; |
| import org.apache.tinkerpop.gremlin.structure.util.StringFactory; |
| import org.apache.tinkerpop.gremlin.util.function.ChainedComparator; |
| |
| import java.util.ArrayList; |
| import java.util.Collections; |
| import java.util.Comparator; |
| import java.util.List; |
| import java.util.Set; |
| import java.util.stream.Collectors; |
| |
| /** |
| * @author Marko A. Rodriguez (http://markorodriguez.com) |
| */ |
| public final class OrderGlobalStep<S> extends CollectingBarrierStep<S> implements ComparatorHolder<S>, TraversalParent { |
| |
| private List<Comparator<S>> comparators = new ArrayList<>(); |
| private ChainedComparator chainedComparator = null; |
| |
| public OrderGlobalStep(final Traversal.Admin traversal) { |
| super(traversal); |
| } |
| |
| @Override |
| public void barrierConsumer(final TraverserSet<S> traverserSet) { |
| if (null == this.chainedComparator) |
| this.chainedComparator = new ChainedComparator<>(ComparatorTraverser.convertComparator((List) this.getComparators())); |
| if (this.chainedComparator.isShuffle()) |
| traverserSet.shuffle(); |
| else |
| traverserSet.sort(this.chainedComparator); |
| } |
| |
| @Override |
| public void addComparator(final Comparator<S> comparator) { |
| if (comparator instanceof TraversalComparator) |
| this.integrateChild(((TraversalComparator) comparator).getTraversal()); |
| this.comparators.add(comparator); |
| } |
| |
| @Override |
| public List<Comparator<S>> getComparators() { |
| return this.comparators.isEmpty() ? Collections.singletonList((Comparator) Order.incr) : Collections.unmodifiableList(this.comparators); |
| } |
| |
| @Override |
| public String toString() { |
| return StringFactory.stepString(this, this.comparators); |
| } |
| |
| @Override |
| public int hashCode() { |
| int result = super.hashCode(); |
| for (final Comparator<S> comparator : this.comparators) { |
| result ^= comparator.hashCode(); |
| } |
| return result; |
| } |
| |
| @Override |
| public Set<TraverserRequirement> getRequirements() { |
| return this.getSelfAndChildRequirements(TraverserRequirement.BULK, TraverserRequirement.OBJECT); |
| } |
| |
| @Override |
| public <S, E> List<Traversal.Admin<S, E>> getLocalChildren() { |
| return Collections.unmodifiableList(this.comparators.stream() |
| .filter(comparator -> comparator instanceof TraversalComparator) |
| .map(traversalComparator -> ((TraversalComparator<S, E>) traversalComparator).getTraversal()) |
| .collect(Collectors.toList())); |
| } |
| |
| @Override |
| public void addLocalChild(final Traversal.Admin<?, ?> localChildTraversal) { |
| this.addComparator(new TraversalComparator<>((Traversal.Admin) localChildTraversal, Order.incr)); |
| } |
| |
| @Override |
| public OrderGlobalStep<S> clone() { |
| final OrderGlobalStep<S> clone = (OrderGlobalStep<S>) super.clone(); |
| clone.comparators = new ArrayList<>(); |
| for (final Comparator<S> comparator : this.comparators) { |
| clone.addComparator(comparator instanceof TraversalComparator ? ((TraversalComparator) comparator).clone() : comparator); |
| } |
| clone.chainedComparator = null; |
| return clone; |
| } |
| } |