| java.lang.Object com.hp.hpl.jena.util.iterator.NiceIterator com.hp.hpl.jena.graph.impl.FragmentTripleIterator
FragmentTripleIterator | abstract public class FragmentTripleIterator extends NiceIterator (Code) | | Iterator which delivers all the triples from a Fragment's map.
|
Method Summary | |
abstract protected void | fill(GraphAdd ga, Node n, Object fragmentsObject) Add all the [implied, matching] triples from the Object into the GraphAdd
entity (which will be our list). | public boolean | hasNext() Answer true iff there are any triples left, ie, there are some triples in the pending
list once we've refilled. | public Object | next() Answer the next triple in the iteration, if one exists. | protected void | refillFrom(GraphAdd pending, Object next) Refill the buffer pending from the iterator element
next . |
FragmentTripleIterator | public FragmentTripleIterator(Triple match, Iterator it)(Code) | | An iterator over all the reification triples buried in it that match
match . The elements of the iterator are either Triples
or Fragmentss.
|
fill | abstract protected void fill(GraphAdd ga, Node n, Object fragmentsObject)(Code) | | Add all the [implied, matching] triples from the Object into the GraphAdd
entity (which will be our list). It would be nice if we could create an interface
for the fragmentObject's type.
|
hasNext | public boolean hasNext()(Code) | | Answer true iff there are any triples left, ie, there are some triples in the pending
list once we've refilled.
true iff there are more triples to come |
next | public Object next()(Code) | | Answer the next triple in the iteration, if one exists. The triples are stored in the
pending list and removed from its end (which we hope is efficient).
the next triple throws: NoSuchElementException - if there isn't one |
refillFrom | protected void refillFrom(GraphAdd pending, Object next)(Code) | | Refill the buffer pending from the iterator element
next . The default behaviour is to assume that this object is
a Map.Entry; over-ride if it's something else.
|
|
|