Uses of Class
org.genantics.set.KeyedSet

Packages that use KeyedSet

Package	Description
org.genantics.set

Uses of KeyedSet in org.genantics.set

Subclasses of KeyedSet in org.genantics.set

Modifier and Type	Class and Description
protected static class	KeyedSet.Empty<T extends Keyed<K>,K extends Comparable<K>> Empty is a singleton object representing the empty set.

Fields in org.genantics.set declared as KeyedSet

Modifier and Type	Field and Description
static KeyedSet	KeyedSet.EMPTY
protected KeyedSet<K,T>	KeyedSet.left
protected KeyedSet<K,T>	KeyedSet.right

Methods in org.genantics.set that return KeyedSet

Modifier and Type	Method and Description
KeyedSet<K,T>	KeyedSet.add(T element) Add an element to the set.
KeyedSet<K,T>	KeyedSet.add(T element, boolean[] added) Convenience method for java.util.Set, which returns true if the element was not already present in the tree.
KeyedSet<K,T>	KeyedSet.addAll(Iterable<T> iterable) Add all elements in iterable to set.
protected KeyedSet<K,T>	KeyedSet.addElement(T element, boolean[] added) addEntry returns this tree with added element
protected KeyedSet<K,T>	KeyedSet.Empty.addElement(T element, boolean[] added)
protected KeyedSet<K,T>	KeyedSet.balanceTree(KeyedSet<K,T> node)
KeyedSet<K,T>	KeyedSet.clear() Vacuous method for compatibility.
KeyedSet<K,T>	KeyedSet.delete(K key) Delete the element with matching key.
KeyedSet<K,T>	KeyedSet.delete(K key, boolean[] deleted) Delete the element with matching key.
KeyedSet<K,T>	KeyedSet.deleteFirst() Delete the first element of the tree.
KeyedSet<K,T>	KeyedSet.Empty.deleteFirst()
protected KeyedSet<K,T>	KeyedSet.deleteKey(K key, boolean[] deleted)
protected KeyedSet<K,T>	KeyedSet.Empty.deleteKey(K key, boolean[] deleted)
KeyedSet<K,T>	KeyedSet.deleteLast() Delete the last element of the tree.
KeyedSet<K,T>	KeyedSet.Empty.deleteLast()
KeyedSet<K,T>	KeyedSet.filter(Filter filter) Filter the set, removing all elements for which the test method returns false.
KeyedSet<K,T>	KeyedSet.Empty.filter(Filter filter)
protected KeyedSet<K,T>	KeyedSet.ReverseTreeIterator.loopTraversal(KeyedSet<K,T> node) Implements the recursive generator schema:
protected KeyedSet<K,T>	KeyedSet.newTree(T element, KeyedSet<K,T> left, KeyedSet<K,T> right) Function that wraps constructor.
KeyedSet<K,T>	KeyedSet.ReverseTreeIterator.next()
KeyedSet<K,T>	KeyedSet.remove(T element) Remove an element if the keys match and the values are equal.
KeyedSet<K,T>	KeyedSet.remove(T element, boolean[] removed) Remove an element if the keys match and the values are equal.
KeyedSet<K,T>	KeyedSet.removeAll(Iterable<T> iterable) Remove all elements in iterable from tree.
KeyedSet<K,T>	KeyedSet.Empty.removeAll(Iterable<T> iterable)
protected KeyedSet<K,T>	KeyedSet.removeElement(T element, boolean[] removed)
protected KeyedSet<K,T>	KeyedSet.Empty.removeElement(T value, boolean[] removed)
protected KeyedSet<K,T>	KeyedSet.removeHigh(KeyedSet<K,T> node, KeyedSet<K,T> high)
KeyedSet<K,T>	KeyedSet.retainAll(Iterable<T> iterable) Get all elements in both set and iterable.
KeyedSet<K,T>	KeyedSet.Empty.retainAll(Iterable<T> iterable)
protected KeyedSet<K,T>	KeyedSet.setLeft(KeyedSet<K,T> left)
protected KeyedSet<K,T>	KeyedSet.setRight(KeyedSet<K,T> right)

Methods in org.genantics.set that return types with arguments of type KeyedSet

Modifier and Type	Method and Description
Iterator<KeyedSet<K,T>>	KeyedSet.TreeIterable.iterator()
Iterator<KeyedSet<K,T>>	KeyedSet.ReverseTreeIterable.iterator()

Methods in org.genantics.set with parameters of type KeyedSet

Modifier and Type	Method and Description
protected KeyedSet<K,T>	KeyedSet.balanceTree(KeyedSet<K,T> node)
protected KeyedSet<K,T>	KeyedSet.ReverseTreeIterator.loopTraversal(KeyedSet<K,T> node) Implements the recursive generator schema:
protected KeyedSet<K,T>	KeyedSet.newTree(T element, KeyedSet<K,T> left, KeyedSet<K,T> right) Function that wraps constructor.
protected KeyedSet<K,T>	KeyedSet.newTree(T element, KeyedSet<K,T> left, KeyedSet<K,T> right) Function that wraps constructor.
protected KeyedSet<K,T>	KeyedSet.removeHigh(KeyedSet<K,T> node, KeyedSet<K,T> high)
protected KeyedSet<K,T>	KeyedSet.removeHigh(KeyedSet<K,T> node, KeyedSet<K,T> high)
protected KeyedSet<K,T>	KeyedSet.setLeft(KeyedSet<K,T> left)
protected KeyedSet<K,T>	KeyedSet.setRight(KeyedSet<K,T> right)

Constructors in org.genantics.set with parameters of type KeyedSet

Constructor and Description
KeyedSet.TreeState(KeyedSet<K,T> tree, int visited)
KeyedSet(T element, KeyedSet<K,T> left, KeyedSet<K,T> right) Constructor.
KeyedSet(T element, KeyedSet<K,T> left, KeyedSet<K,T> right) Constructor.