Index (Software and Algorithms 1.0 API)

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

A

add(int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
add(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
add(int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Add the specified item to this list at the specified index, shifting elements of this list if necessary.
add(int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Add the specified item to this list at the specified index, shifting elements of this list if necessary.
add(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
add(int, T) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Add the specified item to this list at the specified index, shifting elements of this list if necessary.
addAll(ThriftyList.ListInternal<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Add all elements of the specified source list to this list.
addAll(ThriftyList.ListInternal<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Add all elements of the specified source list to this list.
addAll(ThriftyList.ListInternal<T>) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Add all elements of the specified source list to this list.
addFirst(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
addHead(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Add the specified item to the beginning of this list.
addHead(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Add the specified item to the beginning of this list.
addHead(T) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Add the specified item to the beginning of this list.
addImpl(int, int, int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Internal add method requiring the sublist index and offset be pre-calculated.
addLast(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
addSome(ThriftyList.ListInternal<T>, int, int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Add a number of elements from the specified source list, beginning with the element at the specified index and ending once the specified count of added elements has been reached, to this list.
addSome(ThriftyList.ListInternal<T>, int, int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Add a number of elements from the specified source list, beginning with the element at the specified index and ending once the specified count of added elements has been reached, to this list.
addSome(ThriftyList.ListInternal<T>, int, int) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Add a number of elements from the specified source list, beginning with the element at the specified index and ending once the specified count of added elements has been reached, to this list.
addTail(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Add the specified item to the end of this list.
addTail(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Add the specified item to the end of this list.
addTail(T) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Add the specified item to the end of this list.
array - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
array - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal

B

binarySearchTree - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree
blogspot.software_and_algorithms.stern_library.data_structure - package blogspot.software_and_algorithms.stern_library.data_structure
blogspot.software_and_algorithms.stern_library.geometry - package blogspot.software_and_algorithms.stern_library.geometry
blogspot.software_and_algorithms.stern_library.optimization - package blogspot.software_and_algorithms.stern_library.optimization
blogspot.software_and_algorithms.stern_library.string - package blogspot.software_and_algorithms.stern_library.string
buildTree(Set<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Build the interval tree to support the elements of the specified set of intervals.

C

calculateFreeCapacity() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
calculateFreeCapacity() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
calculateFreeCapacity() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal
calculateFreeCapacityHead() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Helper method to calculate the free capacity at the head end of the sublists.
calculateSublistsUsed() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Helper method to fetch the count of used sublists.
capacity() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
capacity() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
capacity() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal
checkCapacity() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Manipulate the state of this instance appropriately if its capacity has fallen outside of either capacity limit.
CircularListInternal(int) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Construct an empty instance with the specified capacity.
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Clear the contents of the tree.
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Clear all entries from this tree.
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Clear all entries from this tree.
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Clear the contents of the tree, leaving the tree structure intact.
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Clear the elements of this node.
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Clear all elements from this list.
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
clear() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Clear all elements from this list.
clear() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Clear all elements from this list.
clone() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Clone this list.
clone() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Clone this list.
clone() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Clone this list.
closestPair(int, int, List<Point2D>) - Method in class blogspot.software_and_algorithms.stern_library.geometry.ClosestPointPairAlgorithm: Internal helper method which implements the closest point pair algorithm.
ClosestPointPairAlgorithm - Class in blogspot.software_and_algorithms.stern_library.geometry: An implementation of a divide-and-conquer algorithm for computing the closest pair of elements of a set of points.
ClosestPointPairAlgorithm(Collection<Point2D>) - Constructor for class blogspot.software_and_algorithms.stern_library.geometry.ClosestPointPairAlgorithm: Construct an instance of the algorithm for the specified point Collection.
ClosestPointPairAlgorithm.PairStructure - Class in blogspot.software_and_algorithms.stern_library.geometry: Convenience data structure to hold a pair of points along with their distance from one another.
compareTo(Interval<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval
computeInitialFeasibleSolution() - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Compute an initial feasible solution by assigning zero labels to the workers and by assigning to each job a label equal to the minimum cost among its incident edges.
computeSubtreeSpan() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node: Compute the maximum high and minimum low endpoints among intervals stored within the subtree rooted at this node and correct values up the tree.
contains(Interval<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval: Test whether or not this interval contains the specified interval.
contains(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval: Test whether or not this interval contains the specified value.
contains(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Test whether or not the specified value is an element of this tree.
contains(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
copyTo(E, E) - Static method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Helper function to copy all data from the source to the destination and return the destination.
createNewNode(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Create a new node with the specified value.
createNewNode(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Create a new node with the specified value.
currentIndex - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
currentSublistIndex - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
currentSublistOffset - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
cursor() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase: Calculates the sublist index/offset for the index.

D

DamerauLevenshteinAlgorithm - Class in blogspot.software_and_algorithms.stern_library.string: The Damerau-Levenshtein Algorithm is an extension to the Levenshtein Algorithm which solves the edit distance problem between a source string and a target string with the following operations: Character Insertion Character Deletion Character Replacement Adjacent Character Swap Note that the adjacent character swap operation is an edit that may be applied when two adjacent characters in the source string match two adjacent characters in the target string, but in reverse order, rather than a general allowance for adjacent character swaps.
DamerauLevenshteinAlgorithm(int, int, int, int) - Constructor for class blogspot.software_and_algorithms.stern_library.string.DamerauLevenshteinAlgorithm: Constructor.
delete(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Delete the specified interval from this tree.
delete(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Delete the specified value from this tree.
delete(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Delete the specified value from this tree.
delete(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Delete the specified interval from this tree.
delete(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Delete the specified interval from this node.
descendingIterator() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
DynamicIntervalTree,T extends Interval> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A dynamic interval tree is a balanced binary search tree which stores intervals so that both point queries (queries that return intervals from the set which contain a query point) and overlapping interval queries (queries that return intervals from the set which overlap a query interval) can be completed in time O(k*log(n)), where n is the number of intervals stored in the tree and k is the size of the result set from the query.
DynamicIntervalTree() - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree
DynamicIntervalTree.Node,T extends Interval> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A node for a dynamic interval tree is a red-black tree node augmented to store the maximum high and minimum low endpoints among intervals stored within the subtree rooted at the node.

E

element() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
equals(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval
exchangeValues(RedBlackTree.Node<T>, RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Called by RedBlackTree.delete(Object) when the node to be removed is a leaf.
exchangeValues(RedBlackTree.Node<T>, RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Called by RedBlackTree.delete(Object) when the node to be removed is a leaf.
execute() - Method in class blogspot.software_and_algorithms.stern_library.geometry.ClosestPointPairAlgorithm: Execute the algorithm.
execute() - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Execute the algorithm.
execute(String, String) - Method in class blogspot.software_and_algorithms.stern_library.string.DamerauLevenshteinAlgorithm: Compute the Damerau-Levenshtein distance between the specified source string and the specified target string.
execute(String) - Method in class blogspot.software_and_algorithms.stern_library.string.KnuthMorrisPrattAlgorithm: Execute the search algorithm.
execute(String, int) - Method in class blogspot.software_and_algorithms.stern_library.string.KnuthMorrisPrattAlgorithm: Execute the search algorithm.
executePhase() - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Execute a single phase of the algorithm.

F

fetchContainingInterval(U) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Fetch an interval containing the specified point.
fetchContainingIntervals(U) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Fetch intervals containing the specified point.
fetchContainingIntervals(V, U) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Fetch intervals containing the specified point.
fetchIntervalsContainingNodePoint(Collection<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Fetch all intervals from this node that contain the node's point.
fetchIntervalsContainingPointHigh(Collection<T>, U, boolean) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Fetch intervals containing the specified value.
fetchIntervalsContainingPointLow(Collection<T>, U, boolean) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Fetch intervals containing the specified value.
fetchOverlappingInterval(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Fetch an interval overlapping the specified interval.
fetchOverlappingIntervals(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Fetch intervals overlapping the specified interval.
fetchOverlappingIntervals(V, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Fetch intervals overlapping the specified interval.
fetchOverlappingIntervals(Collection<T>, Interval) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Fetch all intervals from this node which overlap the specified interval.
fetchUnmatchedWorker() - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm
fill(T[], int, int, int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Fill the specified array, beginning with the specified index, with the data of this list.
fill(T[], int, int, int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Fill the specified array, beginning with the specified index, with the data of this list.
fill(T[], int, int, int) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Fill the specified array, beginning with the specified index, with the data of this list.
fixAfterDeletion(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Re-balance the tree after a delete operation.
fixAfterInsertion(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Re-balance the tree after an insert operation.
FixedListInternal(int) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Construct an empty instance with the specified capacity.

G

get(int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Get the element of this list at the specified index.
get(int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Get the element of this list at the specified index.
get(int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
get(int) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Get the element of this list at the specified index.
getColor() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Get the color.
getFirst() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
getFirstNode() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Get the node containing the smallest value held by this tree.
getFirstNode() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Get the node containing the smallest value held by this tree.
getHead() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
getHead() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
getHead() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal
getHigh() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval: Get the high endpoint.
getLast() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
getLeft() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node: Get the left child.
getLeft() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Get the left child.
getLeft() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Get the left child.
getLow() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval: Get the low endpoint.
getNode(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Get the node that holds the specified value.
getParent() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node: Get the parent.
getParent() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Get the parent.
getPoint() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Get the point associated with this node.
getPredecessor(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Get the predecessor of the specified node.
getPredecessor() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree.Node: Get the predecessor node.
getPredecessor(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Get the predecessor of the specified node.
getRight() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node: Get the right child.
getRight() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Get the right child.
getRight() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Get the right child.
getRoot() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Get the root of this tree.
getSize() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Get the number of intervals being stored in the tree.
getSize() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Get the number of elements contained within this tree.
getSize() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Get the number of intervals being stored in the tree.
getSubtreeSpanHigh() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node
getSubtreeSpanLow() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node
getSuccessor(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Get the successor of the specified node.
getSuccessor() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree.Node: Get the successor node.
getSuccessor(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Get the successor of the specified node.
getTail() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
getTail() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
getTail() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal
getValue() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Get the value.
greedyMatch() - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Find a valid matching by greedily selecting among zero-cost matchings.
growHead() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Grow the head of this list by adding capacity of ThriftyList.smallSublistSizeExp to the beginning.
growTail() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Grow the tail of this list.

H

hashCode() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval
hasNext() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.Iter
hasNext() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ReverseIter
hasPrevious() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.Iter
hasPrevious() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ReverseIter
head - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
HungarianAlgorithm - Class in blogspot.software_and_algorithms.stern_library.optimization: An implementation of the Hungarian algorithm for solving the assignment problem.
HungarianAlgorithm(double[][]) - Constructor for class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Construct an instance of the algorithm.

I

index - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
indexOf(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Get the index of the first list element equal to the specified Object.
indexOf(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Get the index of the first list element equal to the specified Object.
indexOf(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
indexOf(Object) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Get the index of the first list element equal to the specified Object.
initializePhase(int) - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Initialize the next phase of the algorithm by clearing the committed workers and jobs sets and by initializing the slack arrays to the values corresponding to the specified root worker.
insert(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree: Insert the specified interval into this tree.
insert(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Insert the specified value into this tree.
insert(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Insert the specified value into this tree.
insert(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Insert the specified interval into this tree.
Interval<T extends Comparable<T>> - Class in blogspot.software_and_algorithms.stern_library.data_structure: An interval is the subset of elements which fall between (with respect to a total order) two endpoint elements of a set.
Interval(T, boolean, T, boolean) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.Interval: Construct a new instance with the specified low and high endpoints.
isClosedOnHigh() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval
isClosedOnLow() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval
isClosedOnSubtreeSpanHigh() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node
isClosedOnSubtreeSpanLow() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node
isEmpty() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree
isEmpty() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
isEmpty() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
isEmpty() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
isEmpty() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal
isFull() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
isFull() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
isFull() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal
isLeaf() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Test whether or not this node is a leaf node.
Iter(int) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.Iter
iterator() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Returns an Iterator over the elements of this tree.
iterator() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
IterBase(int) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase

K

KnuthMorrisPrattAlgorithm - Class in blogspot.software_and_algorithms.stern_library.string: An implementation of the Knuth Morris Pratt substring search algorithm.
KnuthMorrisPrattAlgorithm(String) - Constructor for class blogspot.software_and_algorithms.stern_library.string.KnuthMorrisPrattAlgorithm: Constructor.

L

lastIndexOf(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Get the index of the last element equal to the specified Object.
lastIndexOf(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Get the index of the last element equal to the specified Object.
lastIndexOf(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
lastIndexOf(Object) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Get the index of the last element equal to the specified Object.
leftRotate(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Perform a left rotate operation on the specified node.
listIterator() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
listIterator(int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList

M

match(int, int) - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Helper method to record a matching between worker w and job j.
merge(E, E, E) - Static method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Helper function to merge two ThriftyList.ListInternal instances into the target ThriftyList.ListInternal instance.
mergeNextSmallSublists() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Merge two small sublists to a single large sublist if two small sublists exist, or double the capacity of the single small sublist to that of a large sublist if only a single small sublist exists.

N

next() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
nextIndex() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.Iter
nextIndex() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ReverseIter
Node(T) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree.Node: Construct a new node associated with the specified interval.
Node(T) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree.Node: Construct a node with the specified value.
Node(T) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Construct a new node with the specified value.
Node(U) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node: Construct a new node associated with the specified point.

O

offer(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
offerFirst(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
offerLast(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
OrderLinkedRedBlackTree<T> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A red black tree that has been augmented to support linear time partial iteration by storing pointers to a node's predecessor and successor within the node itself.
OrderLinkedRedBlackTree() - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Default constructor.
OrderLinkedRedBlackTree(Comparator<T>) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree: Construct a new instance which uses the specified comparator.
OrderLinkedRedBlackTree.Node<T> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A red-black tree node augmented to store pointers to its predecessor and successor.
overlaps(Interval<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval: Test whether or not this interval and the specified interval overlap.

P

PairStructure(Point2D, Point2D, double) - Constructor for class blogspot.software_and_algorithms.stern_library.geometry.ClosestPointPairAlgorithm.PairStructure: Constructor.
peek() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
peekFirst() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
peekLast() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
poll() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
pollFirst() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
pollLast() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
pop() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
previous() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
previousIndex() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.Iter
previousIndex() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ReverseIter
push(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList

R

RedBlackTree<T> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A red-black tree is a binary search tree guaranteeing that no path from root to leaf is more than twice as long as any other such path.
RedBlackTree() - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Default constructor.
RedBlackTree(Comparator<? super T>) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Construct a new tree which uses the specified custom comparator.
RedBlackTree.Node<T> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A red-black tree node is a binary tree node augmented to hold an additional piece of information called the node's color.
RedBlackTree.Node.NodeColor - Enum in blogspot.software_and_algorithms.stern_library.data_structure: The domain of values from which a node's color is assigned.
reduce() - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Reduce the cost matrix by subtracting the smallest element of each row from all elements of the row as well as the smallest element of each column from all elements of the column.
remove(int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Remove and return the element of this list at the specified index.
remove(int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Remove and return the element of this list at the specified index.
remove() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
remove(int) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Remove and return the element of this list at the specified index.
remove() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
remove(int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
removeFirst() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
removeFirstOccurrence(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
removeHead() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Remove the head element of this list.
removeHead() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Remove the head element of this list.
removeHead() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Remove the head element of this list.
removeImpl(int, int) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Internal remove method requiring the sublist index and offset be pre-calculated.
removeLast() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
removeLastOccurrence(Object) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
removeTail() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Remove the tail element of this list.
removeTail() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Remove the tail element of this list.
removeTail() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Remove the tail element of this list.
ReverseIter(int) - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ReverseIter
rightRotate(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree: Perform a right rotate operation on the specified node.

S

set(int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal: Set the element of this list at the specified index to the specified item.
set(int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal: Set the element of this list at the specified index to the specified item.
set(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
set(int, T) - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal: Set the element of this list at the specified index to the specified item.
set(int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
setColor(RedBlackTree.Node.NodeColor) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Set the color.
setImpl(int, int, T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Internal set method requiring the sublist index and offset be pre-calculated.
setLeft(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Set the left child.
setParent(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Set the parent.
setPredecessor(OrderLinkedRedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree.Node: Set the predecessor node.
setRight(RedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Set the right child.
setSuccessor(OrderLinkedRedBlackTree.Node<T>) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.OrderLinkedRedBlackTree.Node: Set the successor node.
setValue(T) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node: Set the value.
shrinkHead() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Shrink the head of this list.
shrinkTail() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Shrink the tail of this list.
size - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
size() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
size - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
size() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
size() - Method in interface blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ListInternal
size() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
split(ThriftyList.ListInternal<T>, ThriftyList.ListInternal<T>, ThriftyList.ListInternal<T>, boolean) - Static method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Helper function to split the data of the source list between two destination lists.
splitNextLargeSublist() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Splits a large sublist into two small sublists.
StaticIntervalTree,T extends Interval> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A static interval tree is a balanced binary search tree which is built to store a pre-specified set of intervals so that both point queries (queries that return intervals from the set which contain a query point) and overlapping interval queries (queries that return intervals from the set which overlap a query interval) can be completed in time O(log(n)+k), where n is the size of the pre-specified set of intervals and k is the size of the result set from the query.
StaticIntervalTree() - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree: Default constructor.
StaticIntervalTree.Node,T extends Interval> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A node for a static interval tree is a binary tree node augmented with an associated point value and the ability to store intervals.
stepForward() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.Iter
stepForward() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
stepForward() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ReverseIter
stepReverse() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.Iter
stepReverse() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
stepReverse() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.ReverseIter
sublistIndex - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase
sublistOffset - Variable in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.IterBase

T

ThriftyList<T> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A dynamically sized compact data structure implementing both the Deque and List interfaces.
ThriftyList() - Constructor for class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList: Construct an empty instance of ThriftyList with the default capacity.
ThriftyList.CircularListInternal<T> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A fixed capacity circular list.
ThriftyList.FixedListInternal<T> - Class in blogspot.software_and_algorithms.stern_library.data_structure: A fixed capacity list.
ThriftyList.Iter - Class in blogspot.software_and_algorithms.stern_library.data_structure
ThriftyList.IterBase - Class in blogspot.software_and_algorithms.stern_library.data_structure
ThriftyList.ListInternal<T> - Interface in blogspot.software_and_algorithms.stern_library.data_structure: Interface for internal helper lists to ThriftyList as instances are not required to perform bounds checking (all such responsibilities are delegated to ThriftyList itself).
ThriftyList.ReverseIter - Class in blogspot.software_and_algorithms.stern_library.data_structure
toArray() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
toArray(U[]) - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList
toString() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.Interval
toString() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree
toString() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.StaticIntervalTree.Node
toString() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.CircularListInternal
toString() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList.FixedListInternal
toString() - Method in class blogspot.software_and_algorithms.stern_library.data_structure.ThriftyList

U

updateLabeling(double) - Method in class blogspot.software_and_algorithms.stern_library.optimization.HungarianAlgorithm: Update labels with the specified slack by adding the slack value for committed workers and by subtracting the slack value for committed jobs.

V

valueOf(String) - Static method in enum blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node.NodeColor: Returns the enum constant of this type with the specified name.
values() - Static method in enum blogspot.software_and_algorithms.stern_library.data_structure.RedBlackTree.Node.NodeColor: Returns an array containing the constants of this enum type, in the order they are declared.

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