Method Summary |
|
public void | clear() Clear away all the triples. |
public ExtendedIterator | find(TripleMatch m) Answer an iterator over all the quadlets that match m that
correspond to complete reified triples held in this map. |
abstract public Triple | getTriple(Node tag) Answer the triple (ie reified statement) that is bound to this node, or
null if there's no such triple. |
abstract public boolean | hasTriple(Triple t) Answer true iff we have a reified triple t -- ie, getTriple would
not return null . |
abstract public Triple | putTriple(Node key, Triple value) Bind the triple value to the node key and
answer that triple. |
abstract public void | removeTriple(Node key) Unbind key from any triple already bound to it. |
abstract public void | removeTriple(Node key, Triple value) key should already be bound to triple ; that
binding is removed. |
abstract public void | removeTriple(Triple triple) Remove every binding tag -> triple . |
public int | size() Answer the number of quadlets in this map. |
abstract public ExtendedIterator | tagIterator() Answer an iterator over all the bound tags in this map. |
abstract public ExtendedIterator | tagIterator(Triple t) Answer an iterator over all the tags in this map that are bound to
t . |