structure5
Interface Map<K,V>

All Known Subinterfaces:
OrderedMap<K,V>
All Known Implementing Classes:
AbstractMap, ChainedHashtable, Hashtable, MapList, Table

public interface Map<K,V>

Associations establish a link between a key and a value. An associative array or map is a structure that allows a disjoint set of keys to become associated with an arbitrary set of values. The convenience of an associative array is that the values used to index the elements need not be comparable and their range need not be known ahead of time. Furthermore, there is no upper bound on the size of the structure. It is able to maintain an arbitrary number of different pieces of information simultaneously. Maps are sometimes called dictionaries because of the uniqueness of the association of words and definitions in a household dictionary.

Example Usage:

To create a dictionary by reading a collection of words and definitions from System.in we could use the following!

 public static void main (String[] argv){
        Map dict = new structure.MapBST#MapBST();
        ReadStream r = new ReadStream();
        String word, def;
        System.out.println("Enter a word: ");
        while(!r.eof()){
            word = r.readLine();
            System.out.println("Enter a definition: ");
            def = r.readLine();
            dict.put(word,def);
            System.out.println("Enter a word: ");
        }
        System.out.println(dict);
 }
 


Method Summary
 void clear()
           
 boolean containsKey(K k)
           
 boolean containsValue(V v)
           
 Set<Association<K,V>> entrySet()
           
 boolean equals(Object other)
           
 V get(K k)
           
 int hashCode()
           
 boolean isEmpty()
           
 Set<K> keySet()
           
 V put(K k, V v)
           
 void putAll(Map<K,V> other)
           
 V remove(K k)
           
 int size()
           
 Structure<V> values()
           
 

Method Detail

size

int size()

isEmpty

boolean isEmpty()

containsKey

boolean containsKey(K k)

containsValue

boolean containsValue(V v)

get

V get(K k)

put

V put(K k,
      V v)

remove

V remove(K k)

putAll

void putAll(Map<K,V> other)

clear

void clear()

keySet

Set<K> keySet()

values

Structure<V> values()

entrySet

Set<Association<K,V>> entrySet()

equals

boolean equals(Object other)
Overrides:
equals in class Object

hashCode

int hashCode()
Overrides:
hashCode in class Object