Map map = new HashMap();
map = new TreeMap(); // sorted map
// Add key/value pairs to the map
map.put("x", new Integer(1));
map.put("y", new Integer(2));
map.put("z", new Integer(3));
// Get number of entries in map
int size = map.size(); // 2
// Adding an entry whose key exists in the map causes
// the new value to replace the old value
Object oldValue = map.put("x", new Integer(9)); // 1
// Remove an entry from the map and
// return the value of the removed entry
oldValue = map.remove("c"); // 3
// Iterate over all keys in the table
Iterator it = map.keySet().iterator();
while (it.hasNext()) {
// Retrieve key
Object key = it.next();
}
// Iterate over all values in table
it = map.values().iterator();
while (it.hasNext()) {
// Get value
Object value = it.next();
}
submitted by guest blogger
milky owens, Newzealand
Retweet this story
No comments:
Post a Comment