Modul speiger.src.collections
Package speiger.src.collections.ints.maps.impl.customHash

Klasse Int2IntLinkedOpenCustomHashMap

java.lang.Object
java.util.AbstractMap<Integer,Integer>
speiger.src.collections.ints.maps.abstracts.AbstractInt2IntMap
speiger.src.collections.ints.maps.impl.customHash.Int2IntOpenCustomHashMap
speiger.src.collections.ints.maps.impl.customHash.Int2IntLinkedOpenCustomHashMap
Alle implementierten Schnittstellen:
IntUnaryOperator, Map<Integer,Integer>, IntUnaryOperator, Int2IntMap, Int2IntOrderedMap, ITrimmable
public class Int2IntLinkedOpenCustomHashMap extends Int2IntOpenCustomHashMap implements Int2IntOrderedMap
A Type Specific LinkedHashMap that allows for custom HashControl. That uses arrays to create links between nodes. For cases where Objects/primitive do not allow hashcoding this can be really useful and provide a lot of control. This implementation of SortedMap does not support SubMaps of any kind. It implements the interface due to sortability and first/last access

  • Konstruktordetails

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(IntStrategy strategy)
      Default Constructor
      Parameter:
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(int minCapacity, IntStrategy strategy)
      Constructor that defines the minimum capacity
      Parameter:
      minCapacity - the minimum capacity the HashMap is allowed to be.
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the minimum capacity is negative

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(int minCapacity, float loadFactor, IntStrategy strategy)
      Constructor that defines the minimum capacity and load factor
      Parameter:
      minCapacity - the minimum capacity the HashMap is allowed to be.
      loadFactor - the percentage of how full the backing array can be before they resize
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the minimum capacity is negative
      IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(Integer[] keys, Integer[] values, IntStrategy strategy)
      Helper constructor that allow to create a map from boxed values (it will unbox them)
      Parameter:
      keys - the keys that should be put into the map
      values - the values that should be put into the map.
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the keys and values do not match in lenght

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(Integer[] keys, Integer[] values, float loadFactor, IntStrategy strategy)
      Helper constructor that allow to create a map from boxed values (it will unbox them)
      Parameter:
      keys - the keys that should be put into the map
      values - the values that should be put into the map.
      loadFactor - the percentage of how full the backing array can be before they resize
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the keys and values do not match in lenght
      IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(int[] keys, int[] values, IntStrategy strategy)
      Helper constructor that allow to create a map from unboxed values
      Parameter:
      keys - the keys that should be put into the map
      values - the values that should be put into the map.
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the keys and values do not match in lenght

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(int[] keys, int[] values, float loadFactor, IntStrategy strategy)
      Helper constructor that allow to create a map from unboxed values
      Parameter:
      keys - the keys that should be put into the map
      values - the values that should be put into the map.
      loadFactor - the percentage of how full the backing array can be before they resize
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the keys and values do not match in lenght
      IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(Map<? extends Integer,? extends Integer> map, IntStrategy strategy)
      A Helper constructor that allows to create a Map with exactly the same values as the provided map.
      Parameter:
      map - the values that should be present in the map
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(Map<? extends Integer,? extends Integer> map, float loadFactor, IntStrategy strategy)
      A Helper constructor that allows to create a Map with exactly the same values as the provided map.
      Parameter:
      map - the values that should be present in the map
      loadFactor - the percentage of how full the backing array can be before they resize
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(Int2IntMap map, IntStrategy strategy)
      A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
      Parameter:
      map - the values that should be present in the map
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null

    • Int2IntLinkedOpenCustomHashMap

      public Int2IntLinkedOpenCustomHashMap(Int2IntMap map, float loadFactor, IntStrategy strategy)
      A Type Specific Helper function that allows to create a new Map with exactly the same values as the provided map.
      Parameter:
      map - the values that should be present in the map
      loadFactor - the percentage of how full the backing array can be before they resize
      strategy - the strategy that allows hash control.
      Löst aus:
      NullPointerException - if Strategy is null
      IllegalStateException - if the loadfactor is either below/equal to 0 or above/equal to 1

  • Methodendetails

    • putAndMoveToFirst

      public int putAndMoveToFirst(int key, int value)
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A customized put method that allows you to insert into the first index.
      Angegeben von:
      putAndMoveToFirst in Schnittstelle Int2IntOrderedMap
      Parameter:
      key - the key that should be inserted
      value - the value that should be inserted
      Gibt zurück:
      the previous present or default return value
      Siehe auch:

    • putAndMoveToLast

      public int putAndMoveToLast(int key, int value)
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A customized put method that allows you to insert into the last index. (This may be nessesary depending on the implementation)
      Angegeben von:
      putAndMoveToLast in Schnittstelle Int2IntOrderedMap
      Parameter:
      key - the key that should be inserted
      value - the value that should be inserted
      Gibt zurück:
      the previous present or default return value
      Siehe auch:

    • moveToFirst

      public boolean moveToFirst(int key)
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A specific move method to move a given key/value to the first index.
      Angegeben von:
      moveToFirst in Schnittstelle Int2IntOrderedMap
      Parameter:
      key - that should be moved to the first index
      Gibt zurück:
      true if the value was moved.

    • moveToLast

      public boolean moveToLast(int key)
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A specific move method to move a given key/value to the last index.
      Angegeben von:
      moveToLast in Schnittstelle Int2IntOrderedMap
      Parameter:
      key - that should be moved to the first last
      Gibt zurück:
      true if the value was moved.

    • getAndMoveToFirst

      public int getAndMoveToFirst(int key)
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A Specific get method that allows to move teh given key/value int the first index.
      Angegeben von:
      getAndMoveToFirst in Schnittstelle Int2IntOrderedMap
      Parameter:
      key - that is searched for
      Gibt zurück:
      the given value for the requested key or default return value

    • getAndMoveToLast

      public int getAndMoveToLast(int key)
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A Specific get method that allows to move teh given key/value int the last index.
      Angegeben von:
      getAndMoveToLast in Schnittstelle Int2IntOrderedMap
      Parameter:
      key - that is searched for
      Gibt zurück:
      the given value for the requested key or default return value

    • copy

      public Int2IntLinkedOpenCustomHashMap copy()
      Beschreibung aus Schnittstelle kopiert: Int2IntMap
      A Function that does a shallow clone of the Map itself. This function is more optimized then a copy constructor since the Map does not have to be unsorted/resorted. It can be compared to Cloneable but with less exception risk
      Angegeben von:
      copy in Schnittstelle Int2IntMap
      Angegeben von:
      copy in Schnittstelle Int2IntOrderedMap
      Setzt außer Kraft:
      copy in Klasse Int2IntOpenCustomHashMap
      Gibt zurück:
      a Shallow Copy of the Map

    • firstIntKey

      public int firstIntKey()
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A method to get the first Key of a Map.
      Angegeben von:
      firstIntKey in Schnittstelle Int2IntOrderedMap
      Gibt zurück:
      the first key in the map

    • pollFirstIntKey

      public int pollFirstIntKey()
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A method to get and remove the first Key of a Map.
      Angegeben von:
      pollFirstIntKey in Schnittstelle Int2IntOrderedMap
      Gibt zurück:
      the first key in the map

    • lastIntKey

      public int lastIntKey()
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A method to get the last Key of a Map.
      Angegeben von:
      lastIntKey in Schnittstelle Int2IntOrderedMap
      Gibt zurück:
      the last key in the map

    • pollLastIntKey

      public int pollLastIntKey()
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A method to get and remove the last Key of a Map.
      Angegeben von:
      pollLastIntKey in Schnittstelle Int2IntOrderedMap
      Gibt zurück:
      the last key in the map

    • firstIntValue

      public int firstIntValue()
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A method to get the first Value of a Map.
      Angegeben von:
      firstIntValue in Schnittstelle Int2IntOrderedMap
      Gibt zurück:
      the first key in the map

    • lastIntValue

      public int lastIntValue()
      Beschreibung aus Schnittstelle kopiert: Int2IntOrderedMap
      A method to get the last Value of a Map.
      Angegeben von:
      lastIntValue in Schnittstelle Int2IntOrderedMap
      Gibt zurück:
      the last key in the map

    • int2IntEntrySet

      public ObjectOrderedSet<Int2IntMap.Entry> int2IntEntrySet()
      Beschreibung aus Schnittstelle kopiert: Int2IntMap
      Type Sensitive EntrySet to reduce boxing/unboxing and optionally Temp Object Allocation.
      Angegeben von:
      int2IntEntrySet in Schnittstelle Int2IntMap
      Angegeben von:
      int2IntEntrySet in Schnittstelle Int2IntOrderedMap
      Setzt außer Kraft:
      int2IntEntrySet in Klasse Int2IntOpenCustomHashMap
      Gibt zurück:
      a EntrySet of the collection

    • keySet

      public IntOrderedSet keySet()
      Angegeben von:
      keySet in Schnittstelle Int2IntMap
      Angegeben von:
      keySet in Schnittstelle Int2IntOrderedMap
      Angegeben von:
      keySet in Schnittstelle Map<Integer,Integer>
      Setzt außer Kraft:
      keySet in Klasse Int2IntOpenCustomHashMap

    • values

      public IntCollection values()
      Angegeben von:
      values in Schnittstelle Int2IntMap
      Angegeben von:
      values in Schnittstelle Map<Integer,Integer>
      Setzt außer Kraft:
      values in Klasse Int2IntOpenCustomHashMap

    • forEach

      public void forEach(IntIntConsumer action)
      Beschreibung aus Schnittstelle kopiert: Int2IntMap
      Type Specific forEach method to reduce boxing/unboxing
      Angegeben von:
      forEach in Schnittstelle Int2IntMap
      Setzt außer Kraft:
      forEach in Klasse Int2IntOpenCustomHashMap
      Parameter:
      action - processor of the values that are iterator over

    • clear

      public void clear()
      Angegeben von:
      clear in Schnittstelle Map<Integer,Integer>
      Setzt außer Kraft:
      clear in Klasse Int2IntOpenCustomHashMap

    • clearAndTrim

      public void clearAndTrim(int size)
      Beschreibung aus Schnittstelle kopiert: ITrimmable
      Trims the collection down to the requested size and clears all elements while doing so
      Angegeben von:
      clearAndTrim in Schnittstelle ITrimmable
      Setzt außer Kraft:
      clearAndTrim in Klasse Int2IntOpenCustomHashMap
      Parameter:
      size - the amount of elements that should be allowed