| Interface | Description |
|---|---|
| CloneMe |
Expose the
clone method publicly so that it can be invoked
at an interface/abstract class level. |
| CloseMe | |
| CountMe | |
| HGSortedSet<E> |
A variation of the standard
SortedSet interface that offers a
HGRandomAccessResult of its elements in addition to an
Iterator. |
| Mapping<From,To> |
An interface specifying a single argument function.
|
| MemoryWarningSystem.Listener | |
| Ref<T> | |
| RefResolver<Key,Value> |
Defines a generic capability to resolve a reference of type
Key to an
object of type Value. |
| ValueSetter<T> |
A simple interface to be implemented by objects that set values in specific
dynamic contexts.
|
| Var<T> |
| Class | Description |
|---|---|
| AccessibleObjectCache |
Utility class to maintain runtime caches of Field, Method and Constructor for
use by
HGAtomType implementations. |
| ActionQueueThread |
This a simple queue that runs as a thread and executes passed
in action object (i.e.
|
| AggregateFuture<T> |
An
AggregateFuture encapsulates several Future
into a single one. |
| ArrayBasedIterator<T> |
Implements an
Iterator over the elements of a built-in Java array. |
| ArrayBasedSet<E> |
An implementation
SortedSet based on primitive arrays that grow
as needed without ever shrinking. |
| CallbackFuture<T> |
An
CallbackFuture offers the possibility to call back a registered
listener when it is completed. |
| CallContextRef<T> | |
| ChainResolver<Key,Value> | |
| CompletedFuture<V> |
Represents a
Future that's already completed. |
| CompositeMapping<From,To,Intermediate> | |
| Cons<E> | |
| Constant<T> | |
| DelegateMapResolver<Key,Value> |
A map-based resolver that will delegate to another resolved if the element is not
in the map.
|
| DummyReadWriteLock |
A read-write lock that doesn't lock at all.
|
| FilteredSortedSet<E> | |
| FilterIterator<T> |
A filtering iterator wraps a source iterator an filter out
some of its elements based on a predicate.
|
| HashCodeUtil |
Collected methods which allow easy implementation of
hashCode. |
| HGAtomResolver<T> | |
| HGClassLoaderDelegate | |
| HGDatabaseVersionFile |
Represents version information at a particular database instance.
|
| HGExecutorService |
A wrapper of an underlying executor service implementation that ensures
a transaction context is inherited from the calling thread when a task
is submitted.
|
| HGLock | Deprecated
This class hasn't been in use since the introduction of MVCC which is
now how concurrent access to RAM data structures is handled.
|
| HGLogger | |
| HGUtils |
The mandatory bag of static utility method class.
|
| KeyMapResolver<Key,Value> | |
| LinkedIdentityHashMap<K,V> | |
| LLRBTree<E> |
Implements a set of elements as a left-leaning red-black tree.
|
| MappedFuture<From,To> | |
| MapResolver<Key,Value> | |
| MemoryWarningSystem |
This memory warning system will call all registered listeners when we
exceed the percentage of available heap memory specified.
|
| Pair<F,S> |
The inexplicably missing class from the
java.util package. |
| PredefinedTypesConfig |
Utility to read and hold configuration of predefined HyperGraphDB types.
|
| RefCountedMap<K,V> |
A variation on a map where values are managed like resources: a put
increments a reference count on an existing key-value entry and a remove
actually delete the entry when the reference count goes to zero.
|
| SimpleStack<T> |
A simple, non thread-safe stack, missing from java.util.
|
| SimplyLinkedQueue<T> | |
| SoftHashMap<K,V> |
This is similar to the standard
WeakHashMap, but it
uses SoftReferences for the map's values instead
of WeakReferences for the maps keys. |
| StringBAInterconverter | |
| TargetSetIterator |
An iterator over the target set of a given link.
|
| TempLink |
This class represents a simple, temporary link used during various query and
graph traversal activities.
|
| TwoWayMap<X,Y> |
A bi-directional map
X <-> Y. |
| VarContext |
This is a glorified name/value map implementing the handling of query variables.
|
| WeakIdentityHashMap<K,V> |
This is a modified version of @see{WeakHashMap} from JDK 1.5.
|
Copyright © 2015. All rights reserved.