| com.hp.hpl.jena.mem |
|
graph
Various memory-based implementations of interfaces,
specifically GraphMem for memory-based Graphs.
|
| Java Source File Name | Type | Comment |
| ArrayBunch.java | Class | An ArrayBunch implements TripleBunch with a linear search of a short-ish
array of Triples. |
| BunchMap.java | Interface | A pruned (and slightly stewed) version of Map, containing just those operations
required by NodeToTriplesMaps. |
| GraphMem.java | Class | A memory-backed graph with S/P/O indexes. |
| GraphMemBase.java | Class | GraphMemBase - a common base class for GraphMem and SmallGraphMem.
Any GraphMemBase maintains a reference count, set to one when it is created,
and incremented by the method openAgain(). |
| GraphMemBaseQueryHandler.java | Class | A QueryHandler for GraphMemBase's subclasses, exploiting those classes
indexes to implement objectsFor, predicatesFor, and subjectsFor efficiently
for the (ANY, ANY) case used in listSubjects(), listPredicates(), and
listObjects(). |
| GraphMemBulkUpdateHandler.java | Class | A GraphMemBulkUpdateHandler specialises the SimpleBulkUpdateHandler
by doing removeAll efficiently, by clearing the indexes directly. |
| GraphMemQueryHandler.java | Class | A GraphMemQueryHandler is an extension of the SimpleQueryHandler which
implements some of the query code more efficiently by exploiting the
GraphMem's indexes. |
| GraphTripleStore.java | Class | 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.
A GraphTripleStore is a searchable repository for triples. |
| GraphTripleStoreBase.java | Class | |
| HashCommon.java | Class | Shared stuff for our hashing implementations: does the base work for
hashing and growth sizes. |
| HashedBunchMap.java | Class | An implementation of BunchMap that does open-addressed hashing. |
| HashedTripleBunch.java | Class | |
| MatchOrBind.java | Class | |
| MixedGraphMem.java | Class | |
| MixedGraphMemStore.java | Class | |
| ModelMem.java | Class | OBSOLETE. |
| NodeToTriplesMap.java | Class | NodeToTriplesMap: a map from nodes to sets of triples. |
| NodeToTriplesMapBase.java | Class | A base class for the "normal" and "faster" NodeToTriplesMaps. |
| ObjectIterator.java | Class | Helper class for listObjects. |
| SetBunch.java | Class | |
| SmallGraphMem.java | Class | A SmallGraphMem is a memory-based Graph suitable only for Small models
(a few triples, perhaps a few tens of triples), because it does no indexing,
but it stores onlya single flat set of triples and so is memory-cheap. |
| StoreTripleIterator.java | Class | 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.java | Class | A WrappedIterator which remembers the last object next'ed in a
protected instance variable, so that subclasses have access to it
during .remove. |
| TripleBunch.java | Interface | A bunch of triples - a strippled-down set with specialised methods. |
| WrappedHashMap.java | Class | An implementation of BunchMap that delegates to a [Hashed]Map. |