Index (Useful Datastructures 1.0-SNAPSHOT API)

A B C D E G H I L M O P R S T V
All Classes and Interfaces|All Packages|Constant Field Values

A

add(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Adds an item to the tree.
add(T) - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
AdjustableBinaryHeap<T> - Class in com.abstractkamen.datastructures.impl.heaps: An implementation of an adjustable binary heap data structure.
AdjustableBinaryHeap(Comparator<T>) - Constructor for class com.abstractkamen.datastructures.impl.heaps.AdjustableBinaryHeap: Create an AdjustableBinaryHeap<T> with a custom comparator
AdjustableBinaryHeap(Comparator<T>, int) - Constructor for class com.abstractkamen.datastructures.impl.heaps.AdjustableBinaryHeap: Create an AdjustableBinaryHeap<T> with a custom comparator
AdjustableHeap<T> - Interface in com.abstractkamen.datastructures.api.heaps: An interface representing an adjustable binary heap data structure.
AvlTree<T> - Class in com.abstractkamen.datastructures.impl.trees.search: An AVL implementation of the BinarySearchTree interface.
AvlTree(Comparator<T>) - Constructor for class com.abstractkamen.datastructures.impl.trees.search.AvlTree: Create an AvlTree<T> with a custom comparator and allowed duplicate values.
AvlTree(Comparator<T>, boolean) - Constructor for class com.abstractkamen.datastructures.impl.trees.search.AvlTree: Create an AvlTree<T> with a custom comparator and flag for duplicate values.

B

BinaryHeap<T> - Class in com.abstractkamen.datastructures.impl.heaps: The elements of the binary heap are ordered according to their natural ordering, or by a Comparator provided at construction time, depending on which constructor is used.
BinaryHeap(Comparator<T>) - Constructor for class com.abstractkamen.datastructures.impl.heaps.BinaryHeap: Create an BinaryHeap<T> with a custom comparator.
BinaryHeap(Comparator<T>, int) - Constructor for class com.abstractkamen.datastructures.impl.heaps.BinaryHeap: Create an BinaryHeap<T> with a custom comparator and capacity.
BinarySearchTree<T> - Interface in com.abstractkamen.datastructures.api.trees.search: Basic binary search tree collection which permits duplicates.

C

capacity() - Method in interface com.abstractkamen.datastructures.api.queues.RingBuffer: Returns the total capacity of the buffer.
capacity() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer
clear() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Remove all elements from this tree.
clear() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
com.abstractkamen.datastructures.api.heaps - package com.abstractkamen.datastructures.api.heaps
com.abstractkamen.datastructures.api.queues - package com.abstractkamen.datastructures.api.queues
com.abstractkamen.datastructures.api.stacks - package com.abstractkamen.datastructures.api.stacks
com.abstractkamen.datastructures.api.trees.search - package com.abstractkamen.datastructures.api.trees.search
com.abstractkamen.datastructures.impl.heaps - package com.abstractkamen.datastructures.impl.heaps
com.abstractkamen.datastructures.impl.queues - package com.abstractkamen.datastructures.impl.queues
com.abstractkamen.datastructures.impl.stacks - package com.abstractkamen.datastructures.impl.stacks
com.abstractkamen.datastructures.impl.trees.search - package com.abstractkamen.datastructures.impl.trees.search
comparator() - Method in interface com.abstractkamen.datastructures.api.heaps.Heap: Get the comparator used to order items in this heap.
comparator() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
completeWords() - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: The number of complete words in this trie.
completeWords() - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
contains(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Checks if a word exists in this trie.
contains(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
contains(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Check if an item exists in the tree.
contains(T) - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
containsCount(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Check how many items are equal to item there are in the tree.
containsCount(T) - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
createComparable() - Static method in class com.abstractkamen.datastructures.impl.heaps.AdjustableBinaryHeap: Create an AdjustableBinaryHeap<T> with natural order comparator in a type safe way.
createComparable() - Static method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap: Create an BinaryHeap<T> with natural order comparator in a type safe way.
createComparable() - Static method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree: Create an AvlTree<T> with natural order comparator in a type safe way.
createComparable(boolean) - Static method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree: Create an AvlTree<T> with natural order comparator in a type safe way and flag for duplicate values.
createComparable(int) - Static method in class com.abstractkamen.datastructures.impl.heaps.AdjustableBinaryHeap: Create an AdjustableBinaryHeap<T> with natural order comparator in a type safe way.
createComparable(int) - Static method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap: Create an BinaryHeap<T> with natural order comparator in a type safe way.

D

decreaseKey(T, T) - Method in interface com.abstractkamen.datastructures.api.heaps.AdjustableHeap: Try to decrease item if it's present in this heap.
decreaseKey(T, T) - Method in class com.abstractkamen.datastructures.impl.heaps.AdjustableBinaryHeap
DEFAULT_CAPACITY - Static variable in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
delete(PrefixTrieImpl.PrefixTrieNode, String, int) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl: Internal protected delete for this tree implementation.
delete(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Deletes a word from the trie.
delete(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
delete(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
depth() - Method in interface com.abstractkamen.datastructures.api.stacks.ImmutableStack: The depth of current stack.
depth() - Method in class com.abstractkamen.datastructures.impl.stacks.ImmutableStackImpl
dequeue() - Method in interface com.abstractkamen.datastructures.api.queues.RingBuffer: Dequeues and returns the oldest item from the buffer.
dequeue() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer: Dequeues and returns the oldest item from the buffer.
descendingIterator() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get an iterator over the elements in this tree, in descending order.
descendingIterator() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree

E

endsWith(String, int) - Method in interface com.abstractkamen.datastructures.api.trees.search.SuffixTrie: Try to find strings which end with suffix.
endsWith(String, int) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
enqueue(T) - Method in interface com.abstractkamen.datastructures.api.queues.RingBuffer: Enqueues the specified item into the buffer.
enqueue(T) - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer: Enqueues the specified item into the buffer, overwriting the oldest item if the buffer is full.

G

getItems() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
getRoot() - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl: Get the root of this tree.
greater(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the first item greater than item.
greater(T) - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree

H

Heap<T> - Interface in com.abstractkamen.datastructures.api.heaps: A heap is a data structure which satisfies the heap property.
heapifyDown(Object[], Comparator<T>, int, int) - Static method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
heapifyUp(Object[], Comparator<T>, int) - Static method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
height() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the height of this tree.
height() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree

I

ImmutableStack<T> - Interface in com.abstractkamen.datastructures.api.stacks: This stack is considered 'immutable' because no operations are performed in-place at any given element.
ImmutableStackImpl<T> - Class in com.abstractkamen.datastructures.impl.stacks: This class is the non-empty implementation.
ImmutableStackImpl() - Constructor for class com.abstractkamen.datastructures.impl.stacks.ImmutableStackImpl
increaseKey(T, T) - Method in interface com.abstractkamen.datastructures.api.heaps.AdjustableHeap: Try to increase item if it's present in this heap.
increaseKey(T, T) - Method in class com.abstractkamen.datastructures.impl.heaps.AdjustableBinaryHeap
insert(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Inserts a word into the trie.
insert(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
insert(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
insert(String, PrefixTrieImpl.PrefixTrieNode, int, BiFunction<Integer, PrefixTrieImpl.PrefixTrieNode, PrefixTrieImpl.PrefixTrieNode>) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl: Inserts a word character by character where first a character is lookup in the root and if it's missing a new node is created and appended to the root after which the algorithm is repeated recursively until we reach the end of the word.
isEmpty() - Method in interface com.abstractkamen.datastructures.api.heaps.Heap: Checks if the heap is empty.
isEmpty() - Method in interface com.abstractkamen.datastructures.api.queues.RingBuffer: True if buffer is empty.
isEmpty() - Method in interface com.abstractkamen.datastructures.api.stacks.ImmutableStack: True if stack is empty.
isEmpty() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Returns true if tree has no elements.
isEmpty() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
isEmpty() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer
isEmpty() - Method in class com.abstractkamen.datastructures.impl.stacks.ImmutableStackImpl
isEmpty() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
isPrefix(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Checks if prefix is present in this trie.
isPrefix(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
isPrefix(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
isSuffix(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.SuffixTrie: Checks if suffix is present in this trie.
isSuffix(String) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
iterator() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer: Returns an iterator over the items in the buffer.
iterator() - Method in class com.abstractkamen.datastructures.impl.stacks.ImmutableStackImpl
iterator() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree

L

lesser(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the first item lesser than item.
lesser(T) - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree

M

max() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the maximum item.
max() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
MergeableHeap<T> - Interface in com.abstractkamen.datastructures.api.heaps: A mergeable heap data structure is a heap that allows for efficient merging of two heaps into a single heap.
mergeWith(Heap<T>) - Method in interface com.abstractkamen.datastructures.api.heaps.MergeableHeap: Merges this heap with the other using this.Heap.comparator().
mergeWith(Heap<T>) - Method in class com.abstractkamen.datastructures.impl.heaps.AdjustableBinaryHeap
mergeWith(Heap<T>) - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
min() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the minimum item.
min() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree

O

OverwritingRingBuffer<T> - Class in com.abstractkamen.datastructures.impl.queues: Represents a ring buffer that overwrites the oldest element when full.
OverwritingRingBuffer(int) - Constructor for class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer: Constructs a new OverwritingRingBuffer with the specified initial capacity.

P

peek() - Method in interface com.abstractkamen.datastructures.api.heaps.Heap: Retrieves the best element of the heap without removing it.
peek() - Method in interface com.abstractkamen.datastructures.api.stacks.ImmutableStack: See the current element.
peek() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
peek() - Method in class com.abstractkamen.datastructures.impl.stacks.ImmutableStackImpl
pop() - Method in interface com.abstractkamen.datastructures.api.heaps.Heap: Removes and retrieves the best element of the heap, and ensures that the heap property is maintained after removal.
pop() - Method in interface com.abstractkamen.datastructures.api.stacks.ImmutableStack: Returns the tail of the current stack.
pop() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
pop() - Method in class com.abstractkamen.datastructures.impl.stacks.ImmutableStackImpl
PrefixTrie - Interface in com.abstractkamen.datastructures.api.trees.search: The PrefixTrie can perform fast prefix matching.
PrefixTrieImpl - Class in com.abstractkamen.datastructures.impl.trees.search: Basic implementation of a prefix 'trie'.
PrefixTrieImpl() - Constructor for class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl: Constructor
PrefixTrieImpl.PrefixTrieNode - Class in com.abstractkamen.datastructures.impl.trees.search: Node structure for this tree implementation.
prettyString() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get a detailed representation of the structure of this tree.
prettyString() - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: A detailed string representation of the structure of this trie.
prettyString() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
prettyString() - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
push(T) - Method in interface com.abstractkamen.datastructures.api.heaps.Heap: Inserts an element into the heap and ensures that the minimum heap property is maintained.
push(T) - Method in interface com.abstractkamen.datastructures.api.stacks.ImmutableStack: Creates a new stack out of the element and appends the previous stack to it.
push(T) - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
push(T) - Method in class com.abstractkamen.datastructures.impl.stacks.ImmutableStackImpl

R

remove(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Removes an item to from the tree.
remove(T) - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
restoreHeapOrder() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap: Restores the minimum heap property of the binary heap after modifications to its elements.
ReversePrefixTrie - Class in com.abstractkamen.datastructures.impl.trees.search: This implementation uses the same insert/delete/search algorithm as the PrefixTrieImpl.
ReversePrefixTrie() - Constructor for class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
RingBuffer<T> - Interface in com.abstractkamen.datastructures.api.queues: A ring buffer abstraction

S

search(PrefixTrieImpl.PrefixTrieNode, String, int, Collection<String>, int, Predicate<PrefixTrieImpl.PrefixTrieNode>, StringBuilder) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl: Searching method for this trie.
shouldDecrementWordOnDelete(PrefixTrieImpl.PrefixTrieNode) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl: PrefixTrieImpl.completeWords decrementing condition.
shouldDecrementWordOnDelete(PrefixTrieImpl.PrefixTrieNode) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
size() - Method in interface com.abstractkamen.datastructures.api.heaps.Heap: Gets the number of elements currently stored in the heap.
size() - Method in interface com.abstractkamen.datastructures.api.queues.RingBuffer: Returns the number of elements currently stored in the buffer.
size() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the current number of elements in the tree.
size() - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: The number of nodes in this trie.
size() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
size() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer
size() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
size() - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
spliterator() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer: Returns a sequential Spliterator of items in the buffer.
startsWith(String, int) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Try to find strings which start with prefix.
startsWith(String, int) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
startsWith(String, int) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie
stream() - Method in interface com.abstractkamen.datastructures.api.queues.RingBuffer: Returns a sequential Stream of items in the buffer.
stream() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get a sequential stream over elements in this tree.
stream() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer: Returns a sequential Stream of items in the buffer.
stream() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
SuffixTrie - Interface in com.abstractkamen.datastructures.api.trees.search: An extension of the prefix trie.

T

toString() - Method in class com.abstractkamen.datastructures.impl.heaps.BinaryHeap
toString() - Method in class com.abstractkamen.datastructures.impl.queues.OverwritingRingBuffer
toString() - Method in class com.abstractkamen.datastructures.impl.trees.search.AvlTree
toString() - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl
toString() - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie

V

visitWordNode(PrefixTrieImpl.PrefixTrieNode, StringBuilder, StringBuilder) - Method in class com.abstractkamen.datastructures.impl.trees.search.PrefixTrieImpl: Visit a node which we know is a word.
visitWordNode(PrefixTrieImpl.PrefixTrieNode, StringBuilder, StringBuilder) - Method in class com.abstractkamen.datastructures.impl.trees.search.ReversePrefixTrie

A B C D E G H I L M O P R S T V
All Classes and Interfaces|All Packages|Constant Field Values