Set

All Known Implementing Classes:

BDDSet
```
public interface Set
```
This is the generic interface for finite SETS

See Also:

Universe

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method and Description
`double`	`cardinality()`
`void`	`clear()` empties the set.
`int`	`compare(Set s)` NOTE: both sets must be created with the same type of universe!
`Set`	`copy()` creates a deep copy of this set.
`Set`	`diff(Set s1)` NOTE: sets must be from the same universe
`SetEnumeration`	`elements()`
`boolean`	`equals(Set s)` NOTE: the sets must be created with the same type of universe!
`void`	`free()` free the memory used by this set.
`boolean`	`insert(int[] value)` insert a value into the set.
`Set`	`intersection(Set s1)`
`Set`	`invert()`
`boolean`	`isEmpty()`
`boolean`	`member(int[] value)` set membership test.
`boolean`	`remove(int[] value)` remove a value from the set.
`Set`	`union(Set s1)`

- Method Detail
  - free
```
void free()
```
    free the memory used by this set. make the set invalid after the call!
    NOTE: you can/need not to call this function after theUniverse has been freed!
    
    See Also:
    
    Universe
  - cardinality
```
double cardinality()
```
    Returns:
    
    the cardinality of the set
  - insert
```
boolean insert(int[] value)
```
    insert a value into the set.
    
    Returns:
    
    true if the value was previously not in the set.
  - remove
```
boolean remove(int[] value)
```
    remove a value from the set.
    
    Returns:
    
    true if the value was previously in the set and is now removed.
  - member
```
boolean member(int[] value)
```
    set membership test.
    
    Returns:
    
    true if value is in the set
  - compare
```
int compare(Set s)
```
    NOTE: both sets must be created with the same type of universe!
    
    Returns:
    
    0 if equal, -1 if this \subset s, +1 if s \subset this, Integer.MAX_VALUE otherwise
  - equals
```
boolean equals(Set s)
```
    NOTE: the sets must be created with the same type of universe!
    
    Returns:
    
    true if the two sets are equal.
  - isEmpty
```
boolean isEmpty()
```
    Returns:
    
    true if the set is empty
  - invert
```
Set invert()
```
    Returns:
    
    the inverse set. that is, (UNIVERSE - this set)
  - copy
```
Set copy()
```
    creates a deep copy of this set.
  - clear
```
void clear()
```
    empties the set.
    NOTE: this does not return the memory allocated by this set. to do that, call free()
    
    See Also:
    
    free()
  - union
```
Set union(Set s1)
```
    Returns:
    
    union of two sets (sets must be from the same universe)
  - intersection
```
Set intersection(Set s1)
```
    Returns:
    
    intersection of two sets (sets must be from the same universe)
  - diff
```
Set diff(Set s1)
```
    NOTE: sets must be from the same universe
    
    Returns:
    
    difference between this set and s1. i.e. [this - s1]
  - elements
```
SetEnumeration elements()
```
    Returns:
    
    the special set enumerator for this type of set.

Interface Set

Method Summary

Method Detail

free

cardinality

insert

remove

member

compare

equals

isEmpty

invert

copy

clear

union

intersection

diff

elements