public GraphQuery query() { return new WrappedGraphQuery(this.baseGraph.query()) { @Override public Iterable<Edge> edges() { return new WrappedEdgeIterable(this.query.edges()); } @Override public Iterable<Vertex> vertices() { return new WrappedVertexIterable(this.query.vertices()); } }; }
@Override public GraphQuery query() { return graph.query(); }
public GraphQuery query() { return new WrappedGraphQuery(this.baseGraph.query()) { @Override public Iterable<Edge> edges() { return new ReadOnlyEdgeIterable(this.query.edges()); } @Override public Iterable<Vertex> vertices() { return new ReadOnlyVertexIterable(this.query.vertices()); } }; }
public GraphQuery query() { final PartitionGraph partitionGraph = this; return new WrappedGraphQuery(this.baseGraph.query()) { @Override public Iterable<Edge> edges() { return new PartitionEdgeIterable(this.query.has(partitionKey, Contains.IN, readPartitions).edges(), partitionGraph); } @Override public Iterable<Vertex> vertices() { return new PartitionVertexIterable(this.query.has(partitionKey, Contains.IN, readPartitions).vertices(), partitionGraph); } }; } }
@Override public GraphQuery query() { final DerivedGraph g = this; return new WrappedGraphQuery(this.baseGraph.query()) { @Override public Iterable<Edge> edges() { return new DerivedEdgeIterable(this.query.edges(), g); } @Override public Iterable<Vertex> vertices() { return new DerivedVertexIterable(this.query.vertices(), g); } }; }
protected static Query uriQuery(Graph g, String uri) { return g.query().has(AgroEntity.PROP_URI, uri); }
public GraphQuery query() { final EventGraph eventGraph = this; return new WrappedGraphQuery(this.baseGraph.query()) { @Override public Iterable<Edge> edges() { return new EventEdgeIterable(this.query.edges(), eventGraph); } @Override public Iterable<Vertex> vertices() { return new EventVertexIterable(this.query.vertices(), eventGraph); } }; }
/** * Generate a query object that can be used to fine tune which edges/vertices are retrieved from the graph. * * @return a graph query object with methods for constraining which data is pulled from the underlying graph */ public FramedGraphQuery query() { return new FramedGraphQueryImpl(this, config.getConfiguredGraph().query()); } }
@Override public CloseableIterator<Term> termsByPredicatePosition(Predicate p, int position) throws AtomSetException { GraphQuery query = this.graph.query(); query.has("class", "atom"); query.has("predicate", predicateToString(p)); Set<Term> terms = new TreeSet<Term>(); Iterator<Term> it = new AtomToTermIterator(query.vertices().iterator(), position); while (it.hasNext()) { terms.add(it.next()); } return new CloseableIteratorAdapter<Term>(terms.iterator()); }
/** * Generate a query object that can be used to fine tune which edges/vertices are retrieved from the graph. * * @return a graph query object with methods for constraining which data is pulled from the underlying graph */ public FramedGraphQuery query() { return new FramedGraphQueryImpl(this, config.getConfiguredGraph().query()); } }
/** * Get a single element by key, value. * * @param graph The graph to get the element from * @param key The key of the element * @param value The value of the element * @param clazz The class element type, can be Vertex | Edge. * @return Found vertex that matches the specified criteria or null if not * found. * @throws IllegalStateException if multiple vertices found that matches the * specified criteria */ @SuppressWarnings("unchecked") public static <E extends Element> E getSingleElement(Graph graph, String key, Object value, Class<E> clazz) { Iterable<?> it = Vertex.class.isAssignableFrom(clazz) ? graph.query().has(key, value).vertices() : graph.query().has(key, value).edges(); Iterator<?> iter = it.iterator(); E e = null; if (iter.hasNext()) { e = (E) iter.next(); } return e; }
@Override public Set<Term> getTerms(Type type) { Set<Term> terms = new TreeSet<Term>(); GraphQuery query = this.graph.query(); query.has("class", "term"); query.has("type", type.toString()); for (Vertex v : query.vertices()) { terms.add(vertexToTerm(v)); } return terms; }
} else { final Graph graph = this.starts.next(); GraphQuery query = graph.query(); if (null != this.hasContainers) { for (final HasContainer hasContainer : this.hasContainers) {
((KeyIndexableGraph) graph).createKeyIndex("name", Vertex.class); GraphQuery result = graph.query().has(nodeId);
@Override public CloseableIterator<Atom> atomsByPredicate(Predicate p) throws AtomSetException { GraphQuery query = this.graph.query(); query.has("class", "atom"); query.has("predicate", predicateToString(p)); return new AtomIterator(query.vertices().iterator()); }
@Override public boolean contains(Atom atom) { GraphQuery query = this.graph.query(); query.has("class", "atom"); query.has("predicate", predicateToString(atom.getPredicate())); int i = 0; for (Term t : atom) { query.has("term" + i++, termToString(t)); } return query.vertices().iterator().hasNext(); }
private Vertex add(Term term) { Vertex v = null; GraphQuery query = this.graph.query(); query.has("class", "term"); query.has("value", term.getIdentifier().toString()); query.has("type", term.getType().toString()); Iterator<Vertex> it = query.vertices().iterator(); if (it.hasNext()) { v = it.next(); } else { v = this.graph.addVertex(null); v.setProperty("class", "term"); v.setProperty("value", term.getIdentifier().toString()); v.setProperty("type", term.getType().toString()); } return v; }
@Override public CloseableIterator<Atom> match(Atom atom) { GraphQuery query = this.graph.query(); query.has("class", "atom"); query.has("predicate", predicateToString(atom.getPredicate())); int i = -1; for (Term t : atom) { ++i; if (t.isConstant()) { query.has("term" + i, termToString(t)); } } return new AtomIterator(query.vertices().iterator()); }
private Vertex add(Predicate predicate) { Vertex v = null; GraphQuery query = this.graph.query(); query.has("class", "predicate"); query.has("value", predicate.getIdentifier()); query.has("arity", predicate.getArity()); Iterator<Vertex> it = query.vertices().iterator(); if (it.hasNext()) { v = it.next(); } else { v = graph.addVertex(null); v.setProperty("class", "predicate"); v.setProperty("value", predicate.getIdentifier()); v.setProperty("arity", predicate.getArity()); } return v; }