A B C D E F G H I K L M N O P Q R S T U V W X Y

S

sameComponent(PartitionElement<T>) - Method in interface goldman.partition.PartitionElement
Returns true if and only if this partition element and x are in the same component.
sameComponent(PartitionElement<T>) - Method in class goldman.partition.UnionFindNode
 
sameSideChild() - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode

REQUIRES: it is not called on the root.
SeparateChaining<E> - Class in goldman.collection.set
This data structure should be considered when only a small fraction of the elements in U will be stored in the collection.
SeparateChaining(int, double, Comparator<? super E>, Hasher<? super E>) - Constructor for class goldman.collection.set.SeparateChaining
Creates a hash table with the specified capacity (plus one to handle null values), and with the given comparator and hasher
SeparateChaining(int, double, Comparator<? super E>) - Constructor for class goldman.collection.set.SeparateChaining
Creates a hash table with the specified capacity (plus one to handle null values), and with the given comparator and default separate chaining hasher
SeparateChaining() - Constructor for class goldman.collection.set.SeparateChaining
Creates a new set with a default initial capacity, load, equivalence tester, and hasher.
SeparateChaining(Comparator<? super E>) - Constructor for class goldman.collection.set.SeparateChaining
Creates a new set with a default initial capacity, load, and hasher.
SeparateChaining(int) - Constructor for class goldman.collection.set.SeparateChaining
Creates a new set with the given capacity, and the default load, equivalence tester, and hasher.
SeparateChaining(int, Comparator<? super E>) - Constructor for class goldman.collection.set.SeparateChaining
Creates a new set with the provided capacity and equivalence tester, using the default load and hasher
SeparateChaining(int, double) - Constructor for class goldman.collection.set.SeparateChaining
Creates a new set with the provided capacity and load, using the default equivalence tester and hasher.
SeparateChaining.DefaultSeparateChainingHasher<E> - Class in goldman.collection.set
The default separate chaining hasher provides a default hasher for separate chaining that hashes null to slot 0, and uses the element's hash code for all other elements.
SeparateChaining.DefaultSeparateChainingHasher() - Constructor for class goldman.collection.set.SeparateChaining.DefaultSeparateChainingHasher
 
SeparateChaining.Marker - Class in goldman.collection.set
 
SeparateChainingMapping<K,V> - Class in goldman.collection.tagged.set
A tagged version of a separate chaining.
SeparateChainingMapping(int, double, Comparator<? super K>) - Constructor for class goldman.collection.tagged.set.SeparateChainingMapping
 
SeparateChainingMapping() - Constructor for class goldman.collection.tagged.set.SeparateChainingMapping
 
SeparateChainingMapping(Comparator<? super K>) - Constructor for class goldman.collection.tagged.set.SeparateChainingMapping
 
SeparateChainingMapping(int) - Constructor for class goldman.collection.tagged.set.SeparateChainingMapping
 
SeparateChainingMapping(int, Comparator<? super K>) - Constructor for class goldman.collection.tagged.set.SeparateChainingMapping
 
SeparateChainingMapping(int, double) - Constructor for class goldman.collection.tagged.set.SeparateChainingMapping
 
set(int, E) - Method in class goldman.collection.ordered.SortedArray
 
set(int, E) - Method in class goldman.collection.positional.Array
 
set(int, E) - Method in interface goldman.collection.positional.PositionalCollection
Replaces the element at position p by the given value, and returns the element that had been in position p.
set(int, E) - Method in class goldman.collection.positional.SinglyLinkedList
 
set(E) - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
 
set(int, E) - Method in class goldman.collection.positional.TrackedArray
 
set(E) - Method in class goldman.collection.positional.TrackedArray.Tracker
 
Set<E> - Interface in goldman.collection.set
A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent.
set(T) - Method in interface goldman.partition.PartitionElement
Returns a string that describes the data associated with this partition element.
set(T) - Method in class goldman.partition.UnionFindNode
Resets the application data to the given value.
setChild(TrieNode<E>) - Method in class goldman.collection.ordered.digitized.CompressedTrie.InternalNode
It adds child as a child of this node.
setChild(TrieNode<E>, E, int) - Method in class goldman.collection.ordered.digitized.Trie.InternalNode
Sets the associated child for element to child.
setElement(E) - Method in class goldman.collection.tagged.TaggedElement
 
setLast(SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.DoublyLinkedList
 
setLast(SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.SinglyLinkedList
 
setLeft(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
setNext(TrieLeafNode<E>) - Method in class goldman.collection.ordered.digitized.AbstractTrieLeafNode
 
setNext(TrieLeafNode<E>) - Method in interface goldman.collection.ordered.digitized.TrieLeafNode
Sets the next element in the ordered leaf chain to the leaf node referenced by newNode.
setNext(SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.DoublyLinkedList.DLListItem
 
setNext(SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.SinglyLinkedList.ListItem
 
setParent(TrieNode<E>) - Method in class goldman.collection.ordered.digitized.AbstractTrieNode
 
setParent(TrieNode<E>) - Method in interface goldman.collection.ordered.digitized.TrieNode
Sets the parent reference to be the given trie node.
setPrev(TrieLeafNode<E>) - Method in class goldman.collection.ordered.digitized.AbstractTrieLeafNode
 
setPrev(TrieLeafNode<E>) - Method in interface goldman.collection.ordered.digitized.TrieLeafNode
Sets the previous element in the ordered leaf chain to prevNode.
setRight(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
setTag(T) - Method in class goldman.collection.tagged.MutableTaggedElement
 
setTargetLoad(double) - Method in class goldman.collection.set.OpenAddressing
Resizes the table so that it has the desired load factor
setTargetLoad(double) - Method in class goldman.collection.set.SeparateChaining
Resizes the table so that it has the desired load factor
setToNull(int, int) - Method in class goldman.collection.positional.CircularArray
Sets positions pos1, ..., pos2 to null.
shiftLeft(int, int, int) - Method in class goldman.collection.positional.CircularArray
Shifts the elements held in p1, ..., p2 (possibly wrapped) left num slots
shiftLeft(int, int, int) - Method in class goldman.collection.positional.TrackedArray
Shifts the elements held in p1, ..., p2 (possibly wrapped) left num slots
shiftRight(int, int, int) - Method in class goldman.collection.positional.CircularArray
Shifts the elements held in p1, ..., p2 (possibly wrapped) right num slots.
shiftRight(int, int, int) - Method in class goldman.collection.positional.TrackedArray
Shifts the elements held in p1, ..., p2 (possibly wrapped) right num slots.
ShortestPathMatrix<V,E extends WeightedEdge<V>> - Class in goldman.graph
The ShortestPathMatrix class is used to store the result from an all-pairs shortest path algorithm.
showStructure() - Method in class goldman.collection.priority.FibonacciHeap
 
showStructure() - Method in class goldman.collection.priority.LeftistHeap
 
showStructure() - Method in class goldman.collection.priority.PairingHeap
 
shrinkTableAsNeeded() - Method in class goldman.collection.set.SeparateChaining
Checks if the hash table is at or below its minimum allowed load, and, if so, resizes within the limitations of the last call to ensureCapacity
sibling() - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode

REQUIRES: it is not called on the root
SimpleEdge<V> - Class in goldman.graph
The SimpleEdge class provides a sample implementation for an edge.
SimpleEdge(V, V) - Constructor for class goldman.graph.SimpleEdge
 
SimpleWeightedEdge<V> - Class in goldman.graph
The simple weighted edge class provides a sample implementation for a weighted edge.
SimpleWeightedEdge(V, V, double) - Constructor for class goldman.graph.SimpleWeightedEdge
 
SinglyLinkedList<E> - Class in goldman.collection.positional
The simplest of the list-based positional collections, SinglyLinkedList maintains a linked list where each list node only references the next element in the list.
SinglyLinkedList() - Constructor for class goldman.collection.positional.SinglyLinkedList
Creates an empty collection
SinglyLinkedList.ListItem<E> - Class in goldman.collection.positional
The ListItem interface must be supported by any class defining objects to be used in a singly linked list or a doubly linked list.
SinglyLinkedList.Tracker - Class in goldman.collection.positional
 
SinglyLinkedList.Tracker(SinglyLinkedList.ListItem<E>) - Constructor for class goldman.collection.positional.SinglyLinkedList.Tracker
 
size - Variable in class goldman.collection.AbstractCollection
 
size() - Method in class goldman.collection.ordered.AbstractSearchTree.TreeNode
 
size() - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
 
size() - Method in interface goldman.collection.ordered.TreeNode
Returns the number of elements held in this tree node.
SkipList<E> - Class in goldman.collection.ordered
The skip list is a sorted list with additional structure that supports finding an element in expected logarithmic time.
SkipList(int, Comparator<? super E>) - Constructor for class goldman.collection.ordered.SkipList
Creates an empty skip list that uses the provided initial height for head and tail and the provided comparator.
SkipList() - Constructor for class goldman.collection.ordered.SkipList
Creates an empty skip list using the default height and comparator
SkipList(int) - Constructor for class goldman.collection.ordered.SkipList
Creates an empty skip list using the default comparator and the provided size for the height of the head and tail.
SkipList(Comparator<? super E>) - Constructor for class goldman.collection.ordered.SkipList
Creates an empty skip list that uses the given comparator and the default height for head and tail.
SkipList.Tracker - Class in goldman.collection.ordered
 
skipRemovedElements(TrieLeafNode<E>) - Method in class goldman.collection.ordered.digitized.Trie.Tracker
Similar to the path compression performed by the union-find data structure (Section~\ref{sec:union-find}), this method performs the optimization of compressing the path of the redirect chain by updating all next pointers to refer directly to the returned element.
skipRemovedElements(SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.SinglyLinkedList.Tracker
 
SortedArray<E> - Class in goldman.collection.ordered
The sorted array provides very efficient use of space and the fastest search time independent of the access pattern.
SortedArray() - Constructor for class goldman.collection.ordered.SortedArray
 
SortedArray(Comparator<? super E>) - Constructor for class goldman.collection.ordered.SortedArray
 
SortedArray(int) - Constructor for class goldman.collection.ordered.SortedArray
This constructor should not be used if the array should be automatically resized.
SortedArray(Comparator<? super E>, int) - Constructor for class goldman.collection.ordered.SortedArray
This constructor should not be used if the array should be automatically resized.
source() - Method in interface goldman.graph.Edge
Returns the source (tail) of this edge.
source() - Method in class goldman.graph.SimpleEdge
 
SpatialCollection<E> - Interface in goldman.collection.spatial
A spatial collection organizes its elements by location in a multidimensional space.
SplayTree<E> - Class in goldman.collection.ordered
A splay tree is a form of a balanced binary search tree in which the nodes store no explicit information to enforce a balancing condition.
SplayTree() - Constructor for class goldman.collection.ordered.SplayTree
 
SplayTree(Comparator<? super E>) - Constructor for class goldman.collection.ordered.SplayTree
 
Stack<E> - Class in goldman.collection.positional
More specialized than a buffer, a stack is natural for applications that insert and remove elements only at one end of the buffer.
Stack(int, boolean, boolean) - Constructor for class goldman.collection.positional.Stack
Creates a stack satisfying the given requirements
Stack() - Constructor for class goldman.collection.positional.Stack
Creates an bounded, untracked stack with a default initial capacity
Stack(int) - Constructor for class goldman.collection.positional.Stack
Creates an unbounded, untracked stack with the given capacity
Stack(int, boolean) - Constructor for class goldman.collection.positional.Stack
Creates an untracked stack satisfying the given requirements
start - Variable in class goldman.collection.positional.CircularArray
 
StringDigitizer - Class in goldman.collection
The StringDigitizer class is an implementation of the Digitizer interface for a string composed of only the 26 lower case letters.
StringDigitizer(int) - Constructor for class goldman.collection.StringDigitizer
 
substituteNode(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.BinarySearchTree.BSTNode
Replaces the node on which this method is called by x
substituteNode(BinarySearchTree<E>.BSTNode) - Method in class goldman.collection.ordered.RedBlackTree.RBNode
Replaces the node on which this method is called by x
successor(E) - Method in class goldman.collection.ordered.BinarySearchTree
This method does not require that target be in the collection.
successor(E) - Method in class goldman.collection.ordered.BTree
This method does not require that target be in the collection.
successor(E) - Method in class goldman.collection.ordered.digitized.Trie
This method does not require that element be in the collection.
successor(E) - Method in interface goldman.collection.ordered.OrderedCollection
Returns a least element in the ordered collection that is greater than x.
successor(E) - Method in class goldman.collection.ordered.SkipList
This method does not require that target be in the collection.
successor(E) - Method in class goldman.collection.ordered.SortedArray
This method does not require that target be in the collection.
successor(E) - Method in class goldman.collection.ordered.SplayTree
It uses splay to bring the successor to the root.
successor(T) - Method in interface goldman.collection.tagged.ordered.TaggedOrderedCollection
Returns smallest tag used by some tagged element in the collection that is greater than tag.
successor(T) - Method in class goldman.collection.tagged.ordered.TaggedOrderedCollectionWrapper
This method does not require that tag is in use.
supportsTracking() - Method in class goldman.collection.priority.BinaryHeap
 
swap(int, int) - Method in class goldman.collection.positional.Array
Swaps the values held in positions pos1 and pos2
swap(int, int) - Method in interface goldman.collection.positional.PositionalCollection
Interchanges the element at position a with the element at position b.
swap(int, int) - Method in class goldman.collection.positional.SinglyLinkedList
Swaps the elements held in positions a and b
swapAfter(SinglyLinkedList.ListItem<E>, SinglyLinkedList.ListItem<E>) - Method in class goldman.collection.positional.SinglyLinkedList
 

A B C D E F G H I K L M N O P Q R S T U V W X Y