|
||||||||||
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>
il.ac.tau.cs.sw1.sortedset.lazy.IntersectionSortedSet<T>
public class IntersectionSortedSet<T extends java.lang.Comparable<T>>
Constructor Summary | |
---|---|
IntersectionSortedSet(SortedSet<T> setA,
SortedSet<T> setB)
|
Method Summary | |
---|---|
boolean |
contains(T element)
Return true if this set contains the specified element. |
SortedIterator<T> |
iterator()
Return an iterator over the elements of this set. |
Methods inherited from class il.ac.tau.cs.sw1.sortedset.lazy.BinaryOpSortedSet |
---|
getMaximum, getMinimum, isEmpty, size |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public IntersectionSortedSet(SortedSet<T> setA, SortedSet<T> setB)
Method Detail |
---|
public boolean contains(T element)
SortedSet
true
if this set contains the specified element.
true
if this set contains the specified elementpublic SortedIterator<T> iterator()
SortedSet
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |