|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.hypergraphdb.query.impl.SortedIntersectionResult<T>
public class SortedIntersectionResult<T>
Combines two ordered result sets into a (ordered) result representing their set theoretical intersection.
It assumes that the objects contained in the result sets being intersected
are java.lang.Comparable instances.
| Constructor Summary | |
|---|---|
SortedIntersectionResult()
|
|
SortedIntersectionResult(HGSearchResult<T> left,
HGSearchResult<T> right)
|
|
| Method Summary | |
|---|---|
void |
close()
Free all system resources held up by the result set and invalidate it for further use. |
T |
current()
Returns the current element in the result set. |
boolean |
hasNext()
|
boolean |
hasPrev()
Return true if there is a previous element in the current
iteration state and false otherwise. |
void |
init(HGSearchResult<T> left,
HGSearchResult<T> right)
|
boolean |
isOrdered()
Return true if the elements in this search result are in ordered
and false otherwise. |
T |
next()
|
T |
prev()
Returns the previous element in this iteration. |
void |
remove()
|
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public SortedIntersectionResult()
public SortedIntersectionResult(HGSearchResult<T> left,
HGSearchResult<T> right)
| Method Detail |
|---|
public void init(HGSearchResult<T> left,
HGSearchResult<T> right)
init in interface RSCombiner<T>public T current()
HGSearchResultReturns the current element in the result set. If there is no current element,
java.util.NoSuchElementException is thrown. There
is no current element in one of two cases: either the
result set is empty or the next method was never
invoked.
current in interface HGSearchResult<T>HGSearchResult.public void close()
HGSearchResultFree all system resources held up by the result set and invalidate it for further use.
close in interface HGSearchResult<T>close in interface CloseMepublic boolean hasPrev()
TwoWayIterator
Return true if there is a previous element in the current
iteration state and false otherwise. After the iterator
has been initialized, the value of hasPrev will always be
false.
hasPrev in interface TwoWayIterator<T>public T prev()
TwoWayIteratorReturns the previous element in this iteration.
prev in interface TwoWayIterator<T>public boolean hasNext()
hasNext in interface java.util.Iterator<T>public T next()
next in interface java.util.Iterator<T>public void remove()
remove in interface java.util.Iterator<T>public boolean isOrdered()
HGSearchResultReturn true if the elements in this search result are in ordered
and false otherwise. It is assumed that when elements are ordered,
they are instances of java.lang.Comparable
isOrdered in interface HGSearchResult<T>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||