Klasse Object2ByteAVLTreeMap<T>

java.lang.Object
java.util.AbstractMap<T,Byte>
speiger.src.collections.objects.maps.abstracts.AbstractObject2ByteMap<T>
speiger.src.collections.objects.maps.impl.tree.Object2ByteAVLTreeMap<T>
Typparameter:
T - the keyType of elements maintained by this Collection
Alle implementierten Schnittstellen:
Map<T,Byte>, NavigableMap<T,Byte>, SortedMap<T,Byte>, ToByteFunction<T>, Object2ByteMap<T>, Object2ByteNavigableMap<T>, Object2ByteSortedMap<T>

public class Object2ByteAVLTreeMap<T> extends AbstractObject2ByteMap<T> implements Object2ByteNavigableMap<T>
A Simple Type Specific AVL TreeMap implementation that reduces boxing/unboxing. It is using a bit more memory then FastUtil, but it saves a lot of Performance on the Optimized removal and iteration logic. Which makes the implementation actually useable and does not get outperformed by Javas default implementation.
  • Konstruktordetails

    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap()
      Default Constructor
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(Comparator<T> comp)
      Constructor that allows to define the sorter
      Parameter:
      comp - the function that decides how the tree is sorted, can be null
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(T[] keys, Byte[] values)
      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.
      Löst aus:
      IllegalStateException - if the keys and values do not match in lenght
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(T[] keys, Byte[] values, Comparator<T> comp)
      Helper constructor that has a custom sorter and 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.
      comp - the function that decides how the tree is sorted, can be null
      Löst aus:
      IllegalStateException - if the keys and values do not match in lenght
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(T[] keys, byte[] values)
      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.
      Löst aus:
      IllegalStateException - if the keys and values do not match in lenght
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(T[] keys, byte[] values, Comparator<T> comp)
      Helper constructor that has a custom sorter and 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.
      comp - the function that decides how the tree is sorted, can be null
      Löst aus:
      IllegalStateException - if the keys and values do not match in lenght
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(Map<? extends T,? extends Byte> map)
      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
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(Map<? extends T,? extends Byte> map, Comparator<T> comp)
      A Helper constructor that has a custom sorter and 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
      comp - the function that decides how the tree is sorted, can be null
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(Object2ByteMap<T> map)
      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
    • Object2ByteAVLTreeMap

      public Object2ByteAVLTreeMap(Object2ByteMap<T> map, Comparator<T> comp)
      A Type Specific Helper function that has a custom sorter and 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
      comp - the function that decides how the tree is sorted, can be null
  • Methodendetails