|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectil.ac.tau.cs.sw1.sortedset.lazy.BinaryOpSortedSet<T>
public abstract class BinaryOpSortedSet<T extends java.lang.Comparable<T>>
Constructor Summary | |
---|---|
BinaryOpSortedSet(SortedSet<T> setA,
SortedSet<T> setB)
Constructs a new CompositeSortedSet from two preexisting sets |
Method Summary | |
---|---|
T |
getMaximum()
Return the maximum element in this set. |
T |
getMinimum()
Return the minimum element in this set. |
boolean |
isEmpty()
Return true iff the set is empty. |
int |
size()
Return the size of this set. the size is computed only once, and is memoized for later use |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface il.ac.tau.cs.sw1.sortedset.SortedSet |
---|
contains, iterator |
Constructor Detail |
---|
public BinaryOpSortedSet(SortedSet<T> setA, SortedSet<T> setB)
setA
- - the first set in the compositionsetB
- - the second set in the compositionMethod Detail |
---|
public int size()
size
in interface SortedSet<T extends java.lang.Comparable<T>>
public boolean isEmpty()
isEmpty
in interface SortedSet<T extends java.lang.Comparable<T>>
public T getMinimum()
getMinimum
in interface SortedSet<T extends java.lang.Comparable<T>>
public T getMaximum()
getMaximum
in interface SortedSet<T extends java.lang.Comparable<T>>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |