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

S

Searchtree<K extends java.lang.Comparable<K>,D> - Class in <Unnamed>

A Searchtree is a Map-implementation as (not necessarily balanced) binary tree.

Searchtree() - Constructor for class Searchtree

second() - Method in class Pair

Selector of the second value

set(int, D) - Method in class Array

Sets the i-th element of this array to d.

Set<K> - Class in <Unnamed>

A set is like a Map without data, i.e.

Set() - Constructor for class Set

Creates a new empty set.

Set(Map<K, ?>) - Constructor for class Set

Creates a set where the elements are the keys of the given map.

setfirst(A) - Method in class Pair

Setter for first value

setsecond(B) - Method in class Pair

Setter for second value

simpleiterator() - Method in class Dictionary

simpleiterator() - Method in interface Map

Creates a new iterator only over the keys.

SimpleIterator<K> - Class in <Unnamed>

A SimpleIterator only iterates over the keys, but hides the data associated to the keys.

SimpleIterator(Iterator<K, ?>) - Constructor for class SimpleIterator

Creates a new SimpleIterator from an Iterator.

size() - Method in class Array

Returns the size of this array (constant time)

size() - Method in class Dictionary

Linear time implementation of Map.size()

size() - Method in class Hashtable

Returns the size of this map, i.e. the number of keys, under which data is stored in O(1).

size() - Method in interface Map

Returns the size of this map, i.e. the number of keys, under which data is stored.

size() - Method in class Queue

Returns the number of elements in this queue.

size() - Method in class Searchtree

size() - Method in class Skiplist

Returns the size of this skiplist (in constant time).

size() - Method in class Stack

Returns the number of elements in this stack.

Skiplist<K extends java.lang.Comparable<K>,D> - Class in <Unnamed>

This class implements the Map-interface as skiplists.

Skiplist() - Constructor for class Skiplist

Creates a new empty skiplist with default geometric distribution (where p = 0.5).

Skiplist(int) - Constructor for class Skiplist

Creates a new skiplist with given random seed.

Skiplist(int, double) - Constructor for class Skiplist

Creates a new skiplist with given random seed and given probability p.

Splaytree<K extends java.lang.Comparable<K>,D> - Class in <Unnamed>

An implementation of a Splaytree.

Splaytree() - Constructor for class Splaytree

Stack<D> - Class in <Unnamed>

A list-based implementation of a stack (LIFO-buffer) with only constant time operations.

Stack() - Constructor for class Stack

Creates an empty stack.

step() - Method in interface Iterator

Move to the next entry.

step() - Method in class SimpleIterator

The method is the same as in Iterator.step().