

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
java.lang.Object structure5.AbstractStructure<E> structure5.AbstractSet<E> structure5.SetList<E>
public class SetList<E>
Implementation of a set of elements using a list as the underlying storage mechanism. As with the mathematical object, the elements of the set are not duplicated. No order is implied or enforced in this structure, but simple set operations such as intersection, union, difference, and subset are provided.
Example Usage: Given a list of students who completed a computer science thesis in the 20012002 academic year at Williams College and a list of graduating computer science majors who are continuing on to graduate school, we could determine which thesis students are planning to attend graduate school as follows:
public static void main(String[] argv){ //thesis students in the class of '02 String[] thesis = new String[]{"Doug", "Evan", "Feng"}; //students continuing on to grad school String[] grad = new String[]{"Doug", "Feng", "Lida"}; //instantiate our sets Set thesisSet = newSetList()
, gradSet = newSetList()
; //build sets up for(int i = 0; i < thesis.length; i++) thesisSet.add(thesis[i])
; for(int i = 0; i < grad.length; i++) gradSet.add(grad[i])
; //calculate the intersection of the two sets thesisSet.retainAll(gradSet)
; System.out.println(thesisSet); }
Constructor Summary  

SetList()
Construct a new set list. 
Method Summary  

void 
add(E e)
Add an element to set, if not already present. 
void 
addAll(Structure<E> other)
Compute the union of this set with other. 
void 
clear()
Remove all the elements from the set. 
Object 
clone()
Returns a shallow clone of this set. 
boolean 
contains(E e)
Returns true if value is an element of the set. 
boolean 
containsAll(Structure<E> other)
Determine if this set is a subset of other. 
boolean 
isEmpty()
Determine if the set is empty. 
Iterator<E> 
iterator()
Construct an traversal to traverse the elements of the set. 
E 
remove(E e)
Remove an element from the set. 
void 
removeAll(Structure<E> other)
Compute the difference between two sets. 
void 
retainAll(Structure<E> other)
Compute the intersection of this set and other. 
int 
size()
Determine the number of elements in the set. 
String 
toString()
Construct a string representation of the set. 
Methods inherited from class structure5.AbstractStructure 

elements, hashCode, values 
Methods inherited from class java.lang.Object 

equals, getClass, notify, notifyAll, wait, wait, wait 
Methods inherited from interface structure5.Structure 

elements, values 
Constructor Detail 

public SetList()
Method Detail 

public void clear()
public boolean isEmpty()
isEmpty
in interface Structure<E>
isEmpty
in class AbstractStructure<E>
public void add(E e)
e
 The new value to be added to set.public E remove(E e)
e
 The element of the set to be removed.
public boolean contains(E e)
contains
in interface Structure<E>
contains
in class AbstractStructure<E>
e
 The element sought in set.
public boolean containsAll(Structure<E> other)
containsAll
in interface Set<E>
containsAll
in class AbstractSet<E>
other
 The potential superset.public Object clone()
clone
in class Object
public void addAll(Structure<E> other)
addAll
in interface Set<E>
addAll
in class AbstractSet<E>
other
 The set to be unioned with this.public void retainAll(Structure<E> other)
retainAll
in interface Set<E>
retainAll
in class AbstractSet<E>
other
 The other set to be intersected with this.public void removeAll(Structure<E> other)
removeAll
in interface Set<E>
removeAll
in class AbstractSet<E>
other
 The set whose values are to be eliminated from this.public Iterator<E> iterator()
AbstractIterator
,
Iterator
,
Enumeration
,
Structure.elements()
public int size()
public String toString()
toString
in class Object


PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 