Package com.tinkerpop.gremlin.structure.util

Examples of com.tinkerpop.gremlin.structure.util.HasContainer

38
39
40
41
42
43
44
45
46
47
48
        super.generateTraversers(traverserGenerator);
        if (PROFILING_ENABLED) TraversalMetrics.stop(this);
    }

    private Iterator<? extends Edge> edges() {
        final HasContainer indexedContainer = getIndexKey(Edge.class);
        final Stream<? extends Edge> edgeStream = (null == indexedContainer) ?
                TinkerHelper.getEdges((TinkerGraph)this.traversal.sideEffects().getGraph()).stream() :
                TinkerHelper.queryEdgeIndex((TinkerGraph)this.traversal.sideEffects().getGraph(), indexedContainer.key, indexedContainer.value).stream();

        // the copy to a new List is intentional as remove() operations will cause ConcurrentModificationException otherwise
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
        // the copy to a new List is intentional as remove() operations will cause ConcurrentModificationException otherwise
        return edgeStream.filter(e -> HasContainer.testAll(e, hasContainers)).collect(Collectors.<Edge>toList()).iterator();
    }

    private Iterator<? extends Vertex> vertices() {
        final HasContainer indexedContainer = getIndexKey(Vertex.class);
        final Stream<? extends Vertex> vertexStream = (null == indexedContainer) ?
                TinkerHelper.getVertices((TinkerGraph)this.traversal.sideEffects().getGraph()).stream() :
                TinkerHelper.queryVertexIndex((TinkerGraph)this.traversal.sideEffects().getGraph(), indexedContainer.key, indexedContainer.value).stream();

        // the copy to a new List is intentional as remove() operations will cause ConcurrentModificationException otherwise
View Full Code Here
47
48
49
50
51
52
53
54
55
            if (TraversalHelper.isLabeled(label)) {
                final Step identityStep = new IdentityStep(traversal);
                identityStep.setLabel(label);
                TraversalHelper.insertStep(identityStep, 0, traversal);
            }
            TraversalHelper.insertStep(new HasStep(traversal, new HasContainer(T.id, Compare.eq, element.id())), 0, traversal);
            TraversalHelper.insertStep(new TinkerGraphStep<>(traversal, element.getClass()), 0, traversal);
        }
    }
View Full Code Here
345
346
347
348
349
350
351
    public default <E2> GraphTraversal<S, Map<String, E2>> where(final Traversal constraint) {
        return this.addStep(new WhereStep<>(this, constraint));
    }

    public default <E2 extends Element> GraphTraversal<S, E2> has(final String key) {
        return this.addStep(new HasStep<>(this, new HasContainer(key, Contains.within)));
    }
View Full Code Here
357
358
359
360
361
362
363
    public default <E2 extends Element> GraphTraversal<S, E2> has(final T accessor, final Object value) {
        return this.has(accessor.getAccessor(), value);
    }

    public default <E2 extends Element> GraphTraversal<S, E2> has(final String key, final BiPredicate predicate, final Object value) {
        return this.addStep(new HasStep<>(this, new HasContainer(key, predicate, value)));
    }
View Full Code Here
361
362
363
364
365
366
367
    public default <E2 extends Element> GraphTraversal<S, E2> has(final String key, final BiPredicate predicate, final Object value) {
        return this.addStep(new HasStep<>(this, new HasContainer(key, predicate, value)));
    }

    public default <E2 extends Element> GraphTraversal<S, E2> has(final T accessor, final BiPredicate predicate, final Object value) {
        return this.addStep(new HasStep<>(this, new HasContainer(accessor.getAccessor(), predicate, value)));
    }
View Full Code Here
369
370
371
372
373
374
375
    public default <E2 extends Element> GraphTraversal<S, E2> has(final String label, final String key, final Object value) {
        return this.has(label, key, Compare.eq, value);
    }

    public default <E2 extends Element> GraphTraversal<S, E2> has(final String label, final String key, final BiPredicate predicate, final Object value) {
        return this.has(T.label, label).addStep(new HasStep<>(this, new HasContainer(key, predicate, value)));
    }
View Full Code Here
373
374
375
376
377
378
379
    public default <E2 extends Element> GraphTraversal<S, E2> has(final String label, final String key, final BiPredicate predicate, final Object value) {
        return this.has(T.label, label).addStep(new HasStep<>(this, new HasContainer(key, predicate, value)));
    }

    public default <E2 extends Element> GraphTraversal<S, E2> hasNot(final String key) {
        return this.addStep(new HasStep<>(this, new HasContainer(key, Contains.without)));
    }
View Full Code Here
378
379
380
381
382
383
384
385
        return this.addStep(new HasStep<>(this, new HasContainer(key, Contains.without)));
    }

    public default <E2 extends Element> GraphTraversal<S, E2> interval(final String key, final Comparable startValue, final Comparable endValue) {
        return this.addStep(new IntervalStep<>(this,
                new HasContainer(key, Compare.gte, startValue),
                new HasContainer(key, Compare.lt, endValue)));
    }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
        if (PROFILING_ENABLED) TraversalMetrics.stop(this);
    }

    private Iterator<? extends Edge> edges() {
        this.graph.tx().readWrite();
        final HasContainer hasContainer = this.getHasContainerForAutomaticIndex(Edge.class);
        final Stream<? extends Edge> edgeStream = (null == hasContainer) ?
                getAllEdges() :
                getEdgesUsingAutomaticIndex(hasContainer);
        return edgeStream.filter(edge -> HasContainer.testAll((Edge) edge, this.hasContainers)).iterator();
    }
View Full Code Here
TOP

Related Classes of com.tinkerpop.gremlin.structure.util.HasContainer

  • com.tinkerpop.gremlin.giraph.process.graph.strategy.GiraphElementStepStrategy
  • com.tinkerpop.gremlin.neo4j.process.graph.step.sideEffect.Neo4jGraphStep
  • com.tinkerpop.gremlin.process.graph.GraphTraversal
  • com.tinkerpop.gremlin.structure.Property
  • com.tinkerpop.gremlin.tinkergraph.process.graph.step.sideEffect.TinkerGraphStep
  • com.tinkerpop.gremlin.tinkergraph.process.graph.strategy.TinkerElementStepStrategy
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.