Various memory-based implementations of interfaces, specifically GraphMem for memory-based Graphs.
Interface Summary Interface Description BunchMapA pruned (and slightly stewed) version of Map, containing just those operations required by NodeToTriplesMaps. HashCommon.NotifyEmptyA 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
NotifyEmptyobject in when the iterator is constructed, and its
emptiedmethod is called when the bunch becomes empty.
TripleBunchA bunch of triples - a stripped-down set with specialized methods.
Class Summary Class Description ArrayBunchAn ArrayBunch implements TripleBunch with a linear search of a short-ish array of Triples. GraphMem GraphMemBaseGraphMemBase - a common base class for GraphMem and SmallGraphMem. GraphTripleStoreGraphTripleStore - 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. HashedBunchMapAn implementation of BunchMap that does open-addressed hashing. HashedTripleBunch NodeToTriplesMapNodeToTriplesMap: a map from nodes to sets of triples. NodeToTriplesMapBaseA base class for in-memory graphs NodeToTriplesMapMem ObjectIteratorHelper class for listObjects. SetBunch StoreTripleIteratorAn iterator wrapper for NodeToTriplesMap iterators which ensures that a .remove on the base iterator is copied to the other two maps of this GraphMem. TrackingTripleIteratorA WrappedIterator which remembers the last object next'ed in a protected instance variable, so that subclasses have access to it during .remove. WrappedHashMapAn implementation of BunchMap that delegates to a [Hashed]Map.