Package com.tinkerpop.blueprints

Examples of com.tinkerpop.blueprints.VertexQuery.limit()

98
99
100
101
102
103
104
105
106
107
108
                    }
                }
                if (this.branchFactor == Integer.MAX_VALUE) {
                    if (this.highRange != Integer.MAX_VALUE) {
                        int temp = this.highRange - this.count;
                        query = temp > 0 ? query.limit(temp) : query;
                    }
                } else {
                    if (this.highRange == Integer.MAX_VALUE) {
                        query = query.limit(this.branchFactor);
                    } else {
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
                        int temp = this.highRange - this.count;
                        query = temp > 0 ? query.limit(temp) : query;
                    }
                } else {
                    if (this.highRange == Integer.MAX_VALUE) {
                        query = query.limit(this.branchFactor);
                    } else {
                        int temp = this.highRange - this.count;
                        query = query.limit(temp < this.branchFactor ? temp : this.branchFactor);
                    }
                }
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
                } else {
                    if (this.highRange == Integer.MAX_VALUE) {
                        query = query.limit(this.branchFactor);
                    } else {
                        int temp = this.highRange - this.count;
                        query = query.limit(temp < this.branchFactor ? temp : this.branchFactor);
                    }
                }
                this.currentIterator = this.elementClass.equals(Vertex.class) ?
                        (Iterator<E>) query.vertices().iterator() :
                        (Iterator<E>) query.edges().iterator();
View Full Code Here
527
528
529
530
531
532
533
534
535
536
537
            // rexstergraph that requires both ... meaning, i might do a vertex query with limit that exceeds my
            // buffer size for rexstergraph.
            final int limitTake = theRequestObject.has(Tokens._TAKE) ? theRequestObject.getInt(Tokens._TAKE) : Integer.MIN_VALUE;
            //final long limitSkip = theRequestObject.has(Tokens._SKIP) ? theRequestObject.getLong(Tokens._SKIP) : Long.MIN_VALUE;
            if (limitTake >= 0) {
                query = query.limit(limitTake);
            }

            if (returnType == ReturnType.VERTICES || returnType == ReturnType.VERTEX_IDS) {
                final Iterable<Vertex> vertexQueryResults = query.vertices();
                for (Vertex v : vertexQueryResults) {
View Full Code Here
86
87
88
89
90
91
92
93
    public VertexQuery build(final Vertex vertex) {
        VertexQuery query = vertex.query();
        for (final HasContainer hasContainer : this.hasContainers) {
            query = query.has(hasContainer.key, hasContainer.predicate, hasContainer.value);
        }
        return query.limit(this.limit).labels(this.labels).direction(this.direction);
    }
}
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.