See: Description
| Interface | Description |
|---|---|
| BunchMap |
A pruned (and slightly stewed) version of Map, containing just those operations
required by NodeToTriplesMaps.
|
| HashCommon.NotifyEmpty |
A hashed structure may become empty as a side-effect of a .remove on one
of its iterators: a container can request notification of this by passing
a
NotifyEmpty object in when the iterator is constructed,
and its emptied method is called when the bunch
becomes empty. |
| TripleBunch |
A bunch of triples - a stripped-down set with specialized methods.
|
| Class | Description |
|---|---|
| ArrayBunch |
An ArrayBunch implements TripleBunch with a linear search of a short-ish
array of Triples.
|
| GraphMem | |
| GraphMemBase |
GraphMemBase - a common base class for GraphMem and SmallGraphMem.
|
| GraphTripleStore |
GraphTripleStore - the underlying triple-indexed triple store for GraphMem et al,
ripped out from the heart of GraphMem as part of simplifying the reification code.
|
| GraphTripleStoreBase | |
| GraphTripleStoreMem | |
| HashCommon<Key> |
Shared stuff for our hashing implementations: does the base work for
hashing and growth sizes.
|
| HashedBunchMap |
An implementation of BunchMap that does open-addressed hashing.
|
| HashedTripleBunch | |
| NodeToTriplesMap |
NodeToTriplesMap: a map from nodes to sets of triples.
|
| NodeToTriplesMapBase |
A base class for in-memory graphs
|
| NodeToTriplesMapMem | |
| ObjectIterator |
Helper class for listObjects.
|
| SetBunch | |
| StoreTripleIterator |
An iterator wrapper for NodeToTriplesMap iterators which ensures that
a .remove on the base iterator is copied to the other two maps of this
GraphMem.
|
| TrackingTripleIterator |
A WrappedIterator which remembers the last object next'ed in a
protected instance variable, so that subclasses have access to it
during .remove.
|
| WrappedHashMap |
An implementation of BunchMap that delegates to a [Hashed]Map.
|
Licenced under the Apache License, Version 2.0