Various memory-based implementations of interfaces, specifically GraphMem for memory-based Graphs.
|Class and Description|
A pruned (and slightly stewed) version of Map, containing just those operations required by NodeToTriplesMaps.
GraphMemBase - a common base class for GraphMem and SmallGraphMem.
Shared stuff for our hashing implementations: does the base work for hashing and growth sizes.
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
A base class for in-memory graphs
A WrappedIterator which remembers the last object next'ed in a protected instance variable, so that subclasses have access to it during .remove.
A bunch of triples - a stripped-down set with specialized methods.
Licenced under the Apache License, Version 2.0