Package | Description |
---|---|
org.hypergraphdb |
Welcome to HyperGraphDB
|
org.hypergraphdb.algorithms | |
org.hypergraphdb.cache | |
org.hypergraphdb.query.impl | |
org.hypergraphdb.storage |
Modifier and Type | Interface and Description |
---|---|
interface |
HGRandomAccessResult<ValueType>
A
HGRandomAccessResult is a search result that is based on some
kind of cursor that allows immediate positioning on some result value, if it
exists. |
interface |
HGSearchResult<T>
Represents the result set of a
HyperGraph query. |
Modifier and Type | Class and Description |
---|---|
class |
DefaultALGenerator
A default implementation of the
HGALGenerator that should cover most
common cases. |
protected class |
DefaultALGenerator.AdjIterator |
protected class |
SimpleALGenerator.AdjIterator |
Modifier and Type | Class and Description |
---|---|
class |
LRUCache<Key,Value>
Implements a cache that keeps most recently used elements in memory while
discarding the least recently used ones.
|
Modifier and Type | Interface and Description |
---|---|
interface |
AsyncSearchResult<T> |
Modifier and Type | Class and Description |
---|---|
class |
AsyncSearchResultImpl<T>
Default implementation of
AsyncSearchResult based on an underlying
HGSearchResult where each operation is submitted as a task to the
HGEnvironment.executor() . |
class |
FilteredRAResultSet<T> |
class |
FilteredResultSet<T>
Filter a result set through a predicate.
|
class |
HandleArrayResultSet
Implements a
HGSearchResult comprising the atoms in a given HGHandle array. |
class |
InMemoryIntersectionResult<T> |
class |
LinkTargetsResultSet
This is the same as
HandleArrayResultSet , but it uses a loaded link atom instance
instead of a HGHandle[] . |
class |
MappedResult<From,To>
A
MappedResult is a HGSearchResult with an applied
transformation to each of its elements. |
class |
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. |
class |
ProjectionAtomResultSet |
class |
RABasedPredicate
Make a random access result set as a predicate.
|
class |
SortedIntersectionResult<T>
Combines two ordered result sets into a (ordered) result representing their set theoretical intersection.
|
class |
SyncSearchResult<T> |
class |
TraversalResult
TraversalResult wraps a graph HGTraversal as
a query HGSearchResult . |
class |
UnionResult<T>
Combines two result set into a result representing their set theoretic union.
|
class |
UnionResultAsync<T> |
class |
ZigZagIntersectionResult<T>
The
ZigZagIntersectionResult operates on two sorted, random access
result sets. |
Modifier and Type | Class and Description |
---|---|
class |
SearchResultWrapper<T>
Used to wrap a
HGRandomAccessResult in order to "disable" it. |
Copyright © 2015. All rights reserved.