This Map stores it's keys as strings in upper case, null and duplicate keys are not allowed : Map « Collections Data Structure « Java






This Map stores it's keys as strings in upper case, null and duplicate keys are not allowed

     
//package com.customwars.client.tools;

import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;

/**
 * This Map stores it's keys as strings in upper case, null and duplicate keys are not allowed
 * Attempting to add a duplicate object in this map results in an IllegalArgumentException
 * Null values are not allowed
 *
 * @param <T> The type of the object stored in this UCaseMap
 */
public class UCaseMap<T> implements Map<String, T> {
  private final Map<String, T> cache;

  public UCaseMap() {
    cache = new HashMap<String, T>();
  }

  public UCaseMap(int initialCapacity) {
    cache = new HashMap<String, T>(initialCapacity);
  }

  public boolean containsKey(Object key) {
    if (key != null) {
      String s = (String) key;
      return cache.containsKey(s.toUpperCase());
    } else {
      return false;
    }
  }

  public boolean containsValue(Object value) {
    return cache.containsValue(value);
  }

  public T get(Object objKey) {
    if (objKey == null) {
      throw new IllegalArgumentException("objKey cannot be null");
    }

    String strKey = (String) objKey;
    String uCaseKey = strKey.toUpperCase();

    if (cache.containsKey(uCaseKey)) {
      return cache.get(uCaseKey);
    } else {
      throw new IllegalArgumentException("No obj found for '" + uCaseKey + "' available keys " + cache.keySet());
    }
  }

  public T put(String key, T value) {
    String uCaseKey = key.toUpperCase();
    if (value == null) {
      return get(key);
    }

    if (!cache.containsKey(uCaseKey)) {
      return cache.put(uCaseKey, value);
    } else {
      throw new IllegalArgumentException("key " + uCaseKey + " is already cached");
    }
  }

  public T remove(Object key) {
    return cache.remove(key);
  }

  public void putAll(Map<? extends String, ? extends T> map) {
    cache.putAll(map);
  }

  public int size() {
    return cache.size();
  }

  public boolean isEmpty() {
    return cache.isEmpty();
  }

  public void clear() {
    cache.clear();
  }

  public Set<String> keySet() {
    return cache.keySet();
  }

  public Collection<T> values() {
    return cache.values();
  }

  public Set<Entry<String, T>> entrySet() {
    return cache.entrySet();
  }

  @Override
  public String toString() {
    return cache.toString();
  }
}

   
    
    
    
    
  








Related examples in the same category

1.Creating and storing arrays in a map
2.Sort based on the values
3.Get a key from value with an HashMap
4.Retrieve environment variables (JDK1.5)
5.Creating a Type-Specific Map: creates a map whose keys are Integer objects and values are String objects.
6.A map declared to hold objects of a type T can also hold objects that extend from T
7.A value retrieved from a type-specific collection does not need to be casted
8.Map techniques.
9.Create an array containing the keys in a map
10.Create an array containing the values in a map
11.Creating a Hash Table
12.Creating a Map That Retains Order-of-Insertion
13.Automatically Removing an Unreferenced Element from a Hash Table
14.Creating a Type-Specific Map [5.0]
15.Use Iterator to loop through the HashMap class
16.Create type specific collections
17.Convert Properties into Map
18.A java.util.Map implementation using reference values
19.Utility method that return a String representation of a map. The elements will be represented as "key = value"
20.Utility method that return a String representation of a map. The elements will be represented as "key = value" (tab)
21.This program demonstrates the use of a map with key type String and value type Employee
22.Format a Map
23.A Map implementation that dumps its content when memory runs low.
24.A Map that stores the values in files within a directory.
25.Map List
26.Multi Value Map Array List
27.Multi Value Map Linked HashSet
28.An object that maps keys to values, and values back to keys.
29.LRU Map
30.A map acts like array.
31.Order Retaining Map
32.BinaryMap class implements a map from objects to integer objects where the only value is the integer with value 1.
33.A space-optimized map for associating char keys with values.
34.A Map implementation that grows to a fixed size and then retains only a fixed number of the highest (largest) keys.
35.Class which creates mapping between keys and a list of values.
36.A map of values by class.
37.History Map
38.Sorts map by values in ascending order.
39.Map from a given key to a list of values
40.Map from a given key to a set of values
41.Class which keeps a set of values and assigns each value a unique positive index.
42.Array Map
43.Array map
44.An ArrayMap is a very inefficient map type that is more robust in dealing with changes to its keys than other maps.
45.Map to string
46.A simple class that stores key Strings as char[]'s in a hash table.