public void defaultFilter(final FaunusVertex vertex) { if (!this.doesFilter) return; vertex.removeEdges(Tokens.Action.KEEP, this.direction, this.labels); Iterator<Edge> itty; Edge edge; if (this.hasContainers.size() > 0) { itty = vertex.getEdges(this.direction).iterator(); while (itty.hasNext()) { edge = itty.next(); for (final HasContainer hasContainer : this.hasContainers) { if (!hasContainer.isLegal(edge)) itty.remove(); } } } if (this.limit != Long.MAX_VALUE) { itty = vertex.getEdges(this.direction).iterator(); long counter = 0; while (itty.hasNext()) { itty.next(); if (++counter > this.limit) itty.remove(); } } }
public Query has(final String key, final Object value) { this.hasContainers.add(new HasContainer(key, com.tinkerpop.blueprints.Compare.EQUAL, value)); return this; }
private boolean loadNext() { this.nextEdge = null; if (this.count > limit) return false; while (this.itty.hasNext()) { final Edge edge = this.itty.next(); boolean filter = false; for (final HasContainer hasContainer : hasContainers) { if (!hasContainer.isLegal(edge)) { filter = true; break; } } if (!filter) { if (++this.count <= limit) { this.nextEdge = edge; return true; } } } return false; } };
private boolean loadNext() { this.nextElement = null; if (this.count > limit) return false; while (this.itty.hasNext()) { final T element = this.itty.next(); boolean filter = false; for (final HasContainer hasContainer : hasContainers) { if (!hasContainer.isLegal(element)) { filter = true; break; } } if (!filter) { if (++this.count <= limit) { this.nextElement = element; return true; } } } return false; } };
public Query has(final String key, final Predicate predicate, final Object value) { this.hasContainers.add(new HasContainer(key, predicate, value)); return this; }
public Query hasNot(final String key) { this.hasContainers.add(new HasContainer(key, com.tinkerpop.blueprints.Compare.EQUAL, null)); return this; }
public Query hasNot(final String key, final Object value) { this.hasContainers.add(new HasContainer(key, com.tinkerpop.blueprints.Compare.NOT_EQUAL, value)); return this; }
public Query has(final String key) { this.hasContainers.add(new HasContainer(key, com.tinkerpop.blueprints.Compare.NOT_EQUAL, null)); return this; }
public <T extends Comparable<?>> Query interval(final String key, final T startValue, final T endValue) { this.hasContainers.add(new HasContainer(key, com.tinkerpop.blueprints.Compare.GREATER_THAN_EQUAL, startValue)); this.hasContainers.add(new HasContainer(key, com.tinkerpop.blueprints.Compare.LESS_THAN, endValue)); return this; }