structure
Interface Map

All Known Subinterfaces:
OrderedMap
All Known Implementing Classes:
AbstractMap, ChainedHashtable, Hashtable, MapList, Table

public interface Map

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(java.lang.Object k)
           
 boolean containsValue(java.lang.Object v)
           
 Set entrySet()
           
 boolean equals(java.lang.Object other)
           
 java.lang.Object get(java.lang.Object k)
           
 int hashCode()
           
 boolean isEmpty()
           
 Set keySet()
           
 java.lang.Object put(java.lang.Object k, java.lang.Object v)
           
 void putAll(Map other)
           
 java.lang.Object remove(java.lang.Object k)
           
 int size()
           
 Structure values()
           
 

Method Detail

size

public int size()

isEmpty

public boolean isEmpty()

containsKey

public boolean containsKey(java.lang.Object k)

containsValue

public boolean containsValue(java.lang.Object v)

get

public java.lang.Object get(java.lang.Object k)

put

public java.lang.Object put(java.lang.Object k,
                            java.lang.Object v)

remove

public java.lang.Object remove(java.lang.Object k)

putAll

public void putAll(Map other)

clear

public void clear()

keySet

public Set keySet()

values

public Structure values()

entrySet

public Set entrySet()

equals

public boolean equals(java.lang.Object other)
Overrides:
equals in class java.lang.Object

hashCode

public int hashCode()
Overrides:
hashCode in class java.lang.Object