public interface JanusGraphQuery<Q extends JanusGraphQuery<Q>>
Finding matching elements efficiently using this query mechanism requires that appropriate index structures have
been defined for the keys. See JanusGraphManagement
for more information
on how to define index structures in JanusGraph.
Modifier and Type | Method and Description |
---|---|
Iterable<JanusGraphEdge> |
edges()
Returns all edges that match the conditions.
|
Q |
has(String key) |
Q |
has(String key,
JanusGraphPredicate predicate,
Object condition)
The returned element must have a property for the given key that matches the condition according to the
specified relation
|
Q |
has(String key,
Object value) |
Q |
hasNot(String key) |
Q |
hasNot(String key,
Object value) |
<T extends Comparable<?>> |
interval(String key,
T startValue,
T endValue) |
Q |
limit(int max)
Limits the size of the returned result set
|
Q |
or(Collection<Q> subQueries) |
Q |
orderBy(String key,
org.apache.tinkerpop.gremlin.process.traversal.Order order)
Orders the element results of this query according
to their property for the given key in the given order (increasing/decreasing).
|
Iterable<JanusGraphVertexProperty> |
properties()
Returns all properties that match the conditions
|
Iterable<JanusGraphVertex> |
vertices()
Returns all vertices that match the conditions.
|
Q has(String key, JanusGraphPredicate predicate, Object condition)
key
- Key that identifies the propertypredicate
- Relation between property and conditioncondition
- Q or(Collection<Q> subQueries)
<T extends Comparable<?>> Q interval(String key, T startValue, T endValue)
Q limit(int max)
max
- The maximum number of results to returnQ orderBy(String key, org.apache.tinkerpop.gremlin.process.traversal.Order order)
key
- The key of the properties on which to orderorder
- the ordering directionIterable<JanusGraphVertex> vertices()
Iterable<JanusGraphEdge> edges()
Iterable<JanusGraphVertexProperty> properties()
Copyright © 2012–2023. All rights reserved.