Class MinimumMemoryMap<K,​V>

  • All Implemented Interfaces:
    Map<K,​V>

    public class MinimumMemoryMap<K,​V>
    extends Object
    implements Map<K,​V>
    Array based implementation of the Map interface. This implementation uses the minimum amount of memory to store keys and values. Keys are kept in sorted order, so time for inserts and lookups is O(log2(N)).
    • Constructor Detail

      • MinimumMemoryMap

        public MinimumMemoryMap()
      • MinimumMemoryMap

        public MinimumMemoryMap​(int initialSize)
      • MinimumMemoryMap

        public MinimumMemoryMap​(Map<K,​V> otherMap)
    • Method Detail

      • clear

        public void clear()
        Specified by:
        clear in interface Map<K,​V>
      • size

        public int size()
        Specified by:
        size in interface Map<K,​V>
      • isEmpty

        public boolean isEmpty()
        Specified by:
        isEmpty in interface Map<K,​V>
      • containsKey

        public boolean containsKey​(Object key)
        Specified by:
        containsKey in interface Map<K,​V>
      • get

        public V get​(Object key)
        Specified by:
        get in interface Map<K,​V>
      • put

        public V put​(K key,
                     V value)
        Specified by:
        put in interface Map<K,​V>
      • remove

        public V remove​(Object key)
        Specified by:
        remove in interface Map<K,​V>
      • putAll

        public void putAll​(Map<? extends K,​? extends V> m)
        Specified by:
        putAll in interface Map<K,​V>
      • keySet

        public Set<K> keySet()
        Specified by:
        keySet in interface Map<K,​V>