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

D

data() - Method in interface Iterator

Returns the data of the current entry, if it is valid, cf.

delete(K) - Method in class AVLtree

delete(K) - Method in class Dictionary

delete(K) - Method in class Hashtable

Removes the entry which stores the data for the key k.

delete(K) - Method in class List

Deletes the (first) element of this list with given key k, if such an element exists.

delete() - Method in interface Listiterator

Deletes the current entry (and directly steps to the next entry)

delete(K) - Method in interface Map

Removes the entry which stores the data for the key k.

delete(K) - Method in class Searchtree

Removes the entry which stores the data for the key k.

delete(K) - Method in class Set

Deletes an element k from the set if it is present in the set.

delete(K) - Method in class Skiplist

Deletes the key-data association for the given key in this skiplist in O(log n) in average.

delete(K) - Method in class Splaytree

delete(K) - Method in class Treap

Removes the entry which stores the data for the key k.

dequeue() - Method in class Queue

Returns and removes the element at the front of this queue.

Dictionary<K,D> - Class in <Unnamed>

A dictionary provides some default implementations of methods that are required for the Map-interface.

Dictionary() - Constructor for class Dictionary