@Override public VertexQuery query() { return new DefaultVertexQuery(this); // TODO implement }
public VertexQueryBuilder direction(final Direction direction) { super.direction(direction); return this; }
public long count() { long count = 0; for (final Edge edge : this.edges()) { count++; } return count; }
@Override public long count() { if (hasContainers.isEmpty()) { // NO CONDITIONS: USE THE FAST COUNT long counter = ((OrientVertex) vertex).countEdges(direction, labels); if (limit != Integer.MAX_VALUE && counter > limit) return limit; return counter; } // ITERATE EDGES TO MATCH CONDITIONS return super.count(); } }
/** * (Blueprints Extension) Counts the total items found. This method is more efficient than executing the query and browse the * returning Iterable. * * @return */ @Override public long count() { if (hasContainers.isEmpty()) { // NO CONDITIONS: USE THE FAST COUNT long counter = ((OrientVertex) vertex).countEdges(direction, labels); if (limit != Integer.MAX_VALUE && counter > limit) return limit; return counter; } // ITERATE EDGES TO MATCH CONDITIONS return super.count(); } }
@Override public VertexQuery query() { return new DefaultVertexQuery(this); }
public VertexQuery query() { return new DefaultVertexQuery(this); }
@Override public VertexQuery query() { return new DefaultVertexQuery(this); // TODO implement }
@Override public VertexQuery query() { return new DefaultVertexQuery(this); // TODO implement }
@Override public VertexQuery query() { return new DefaultVertexQuery(this); // TODO implement }
public VertexQuery query() { return new DefaultVertexQuery(this); }
@Override public VertexQuery query() { return new DefaultVertexQuery(this); }
public VertexQuery query() { return new DefaultVertexQuery(this); }
public VertexQuery query() { return new DefaultVertexQuery(this); }
public VertexQuery query() { return new DefaultVertexQuery(this); }
/** * Not bothering to provide a SPARQL translation for vertex queries at * this time. I suspect that scan and filter works fine when starting from * an individual vertex. */ @Override public VertexQuery query() { if (log.isInfoEnabled()) log.info(""); return new DefaultVertexQuery(this); }
public VertexQuery query() { this.graph.autoStartTransaction(false); return new DefaultVertexQuery(this); }
@Override public VertexQuery query() { return new WrapperVertexQuery(new DefaultVertexQuery(this)) { @Override public Iterable<Edge> edges() { return new DerivedEdgeIterable(this.query.edges(), derivedGraph); } @Override public Iterable<Vertex> vertices() { return new DerivedVertexIterable(this.query.vertices(), derivedGraph); } }; }
@Override public VertexQuery query() { return new DefaultVertexQuery(getParent().getVertex(getId())); }
@Override public VertexQuery query() { return new DefaultVertexQuery(getParent().getVertex(getId())); }