structure5
Class MapList<K,V>

java.lang.Object
  structure5.MapList<K,V>

All Implemented Interfaces:

Map<K,V>

public class MapList<K,V>
extends Object
implements 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.

This implementation is based on a list, so performance for most operations is linear.

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 MapList();
        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);
 }
 

Constructor Summary

MapList()
Construct an empty map, based on a list

MapList(Map<K,V> source)
Construct a map with values found in source

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() Returns the number of entries in the map
Structure<V>	values()

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MapList

public MapList()

Construct an empty map, based on a list

MapList

public MapList(Map<K,V> source)

Construct a map with values found in source

Method Detail

size

public int size()

Returns the number of entries in the map

Specified by:

size in interface Map<K,V>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<K,V>

containsKey

public boolean containsKey(K k)

Specified by:

containsKey in interface Map<K,V>

containsValue

public boolean containsValue(V v)

Specified by:

containsValue in interface Map<K,V>

get

public V get(K k)

Specified by:

get in interface Map<K,V>

put

public V put(K k,
             V v)

Specified by:

put in interface Map<K,V>

remove

public V remove(K k)

Specified by:

remove in interface Map<K,V>

putAll

public void putAll(Map<K,V> other)

Specified by:

putAll in interface Map<K,V>

clear

public void clear()

Specified by:

clear in interface Map<K,V>

keySet

public Set<K> keySet()

Specified by:

keySet in interface Map<K,V>

values

public Structure<V> values()

Specified by:

values in interface Map<K,V>

entrySet

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

Specified by:

entrySet in interface Map<K,V>

equals

public boolean equals(Object other)

Specified by:

equals in interface Map<K,V>

Overrides:

equals in class Object

hashCode

public int hashCode()

Specified by:

hashCode in interface Map<K,V>

Overrides:

hashCode in class Object