Uses of Interface
Map

Uses of Map in <Unnamed>

Classes in <Unnamed> that implement Map

class	AVLtree<K extends Comparable<K>,D> An AVL-tree is an always balanced tree.
class	Dictionary<K,D> A dictionary provides some default implementations of methods that are required for the Map-interface.
class	Hashtable<K,D> A hashtable implementation of the Map-interface.
class	List<K,D> A List is a Map implemented as double-linked list.
class	Searchtree<K extends Comparable<K>,D> A Searchtree is a Map-implementation as (not necessarily balanced) binary tree.
class	Skiplist<K extends Comparable<K>,D> This class implements the Map-interface as skiplists.
class	Splaytree<K extends Comparable<K>,D> An implementation of a Splaytree.
class	Treap<K extends Comparable<K>,D> A treap is like a search-tree where the nodes are annotated with weights/priorities.

Constructors in <Unnamed> with parameters of type Map

Set(Map<K,?> m)
Creates a set where the elements are the keys of the given map.