Index (useful-datastructures-api 1.0-SNAPSHOT API)

A B C D E G H I L M P R S
All Classes and Interfaces|All Packages

A

add(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Adds an item to the tree.
AdjustableHeap<T> - Interface in com.abstractkamen.datastructures.api.heaps: An interface representing an adjustable binary heap data structure.

B

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.
clear() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Remove all elements from this tree.
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
comparator() - Method in interface com.abstractkamen.datastructures.api.heaps.Heap: Get the comparator used to order items in this heap.
completeWords() - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: The number of complete words in this trie.
contains(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Checks if a word exists in this trie.
contains(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Check if an item exists in the tree.
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.

D

decreaseKey(T, T) - Method in interface com.abstractkamen.datastructures.api.heaps.AdjustableHeap: Try to decrease item if it's present in this heap.
delete(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Deletes a word from the trie.
depth() - Method in interface com.abstractkamen.datastructures.api.stacks.ImmutableStack: The depth of current stack.
dequeue() - Method in interface com.abstractkamen.datastructures.api.queues.RingBuffer: 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.

E

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

G

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

H

Heap<T> - Interface in com.abstractkamen.datastructures.api.heaps: A heap is a data structure which satisfies the heap property.
height() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the height of this tree.

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.
increaseKey(T, T) - Method in interface com.abstractkamen.datastructures.api.heaps.AdjustableHeap: Try to increase item if it's present in this heap.
insert(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Inserts a word into the trie.
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.
isPrefix(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Checks if prefix is present in this trie.
isSuffix(String) - Method in interface com.abstractkamen.datastructures.api.trees.search.SuffixTrie: Checks if suffix is present in this trie.

L

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

M

max() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the maximum item.
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().
min() - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Get the minimum item.

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.
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.
PrefixTrie - Interface in com.abstractkamen.datastructures.api.trees.search: The PrefixTrie can perform fast prefix matching.
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.
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.

R

remove(T) - Method in interface com.abstractkamen.datastructures.api.trees.search.BinarySearchTree: Removes an item to from the tree.
RingBuffer<T> - Interface in com.abstractkamen.datastructures.api.queues: A ring buffer abstraction

S

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.
startsWith(String, int) - Method in interface com.abstractkamen.datastructures.api.trees.search.PrefixTrie: Try to find strings which start with prefix.
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.
SuffixTrie - Interface in com.abstractkamen.datastructures.api.trees.search: An extension of the prefix trie.

A B C D E G H I L M P R S
All Classes and Interfaces|All Packages