Interface | Description |
---|---|
AsyncSearchResult<T> | |
RSCombiner<T> |
Class | Description |
---|---|
AsyncSearchResultImpl<T> |
Default implementation of
AsyncSearchResult based on an underlying
HGSearchResult where each operation is submitted as a task to the
HGEnvironment.executor() . |
DefaultKeyBasedQuery<Key,Value> | |
DelayedSetLoadPredicate |
A predicate that check whether a handle is the member of a set
of handles.
|
DerefMapping<T> | |
FilteredRAResultSet<T> | |
FilteredResultSet<T> |
Filter a result set through a predicate.
|
HandleArrayResultSet |
Implements a
HGSearchResult comprising the atoms in a given HGHandle array. |
IndexBasedQuery<T> |
A simple query that operates on a single index.
|
IndexScanQuery<Key,Value> |
This queries simply scans all elements in a given index.
|
InMemoryIntersectionResult<T> | |
InMemoryIntersectionResult.Combiner<T> | |
IntersectionQuery<T> |
An
IntersectionQuery combines the results of two underlying
queries and produces a result set containing only elements that appear
in both of the input result sets. |
KeyBasedQuery<Key,Value> |
A
KeyBasedQuery is a HGQuery that produces
a result based on a single key value. |
LinkProjectionMapping | |
LinkTargetsResultSet |
This is the same as
HandleArrayResultSet , but it uses a loaded link atom instance
instead of a HGHandle[] . |
MappedResult<From,To> |
A
MappedResult is a HGSearchResult with an applied
transformation to each of its elements. |
PipedResult<Key,Value> |
A piped query result takes the output of a query, in the form of
a
HGSearchResult instance and uses it as input to a "pipe"
query. |
PipeQuery<Key,Value> |
A
PipeQuery pipes the output of one query as the
input of another. |
PredicateBasedFilter<T> |
A
HGQuery whose result is constructed by filtering the result set
of another HGQuery according to a HGQueryCondition . |
PredicateBasedRAFilter<T> |
A
HGQuery whose result is constructed by filtering the result set
of another HGQuery according to a HGQueryCondition . |
ProjectionAtomResultSet | |
RABasedPredicate |
Make a random access result set as a predicate.
|
ResultMapQuery |
A
HGQuery that transforms the result of an underlying query
by applying a provided mapping. |
SearchableBasedQuery<Key,Value> |
A simple query that operates on a single
HGSearchable entity, usually
a HGIndex . |
SortedIntersectionResult<T> |
Combines two ordered result sets into a (ordered) result representing their set theoretical intersection.
|
SortedIntersectionResult.Combiner<T> | |
SyncSearchResult<T> | |
TraversalBasedQuery | |
TraversalResult |
TraversalResult wraps a graph HGTraversal as
a query HGSearchResult . |
TypeConditionAggregate | |
UnionQuery<T> |
An
UnionQuery combines the results of two underlying
queries and produces a result set containing elements that appear
in either of the input result sets. |
UnionResult<T> |
Combines two result set into a result representing their set theoretic union.
|
UnionResultAsync<T> | |
ZigZagIntersectionResult<T> |
The
ZigZagIntersectionResult operates on two sorted, random access
result sets. |
ZigZagIntersectionResult.Combiner<T> |
Enum | Description |
---|---|
IndexBasedQuery.ScanType | |
TraversalBasedQuery.ReturnType |
Copyright © 2015. All rights reserved.