Modul speiger.src.collections
Package speiger.src.collections.doubles.maps.impl.tree

Klasse Double2BooleanRBTreeMap

java.lang.Object
java.util.AbstractMap<Double,Boolean>
speiger.src.collections.doubles.maps.abstracts.AbstractDouble2BooleanMap
speiger.src.collections.doubles.maps.impl.tree.Double2BooleanRBTreeMap
Alle implementierten Schnittstellen:
DoublePredicate, Map<Double,Boolean>, NavigableMap<Double,Boolean>, SortedMap<Double,Boolean>, Double2BooleanMap, Double2BooleanNavigableMap, Double2BooleanSortedMap
public class Double2BooleanRBTreeMap extends AbstractDouble2BooleanMap implements Double2BooleanNavigableMap
A Simple Type Specific RB 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap()
      Default Constructor

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(DoubleComparator comp)
      Constructor that allows to define the sorter
      Parameter:
      comp - the function that decides how the tree is sorted, can be null

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(Double[] keys, Boolean[] 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(Double[] keys, Boolean[] values, DoubleComparator 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(double[] keys, boolean[] 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(double[] keys, boolean[] values, DoubleComparator 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(Map<? extends Double,? extends Boolean> 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(Map<? extends Double,? extends Boolean> map, DoubleComparator 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(Double2BooleanMap 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

    • Double2BooleanRBTreeMap

      public Double2BooleanRBTreeMap(Double2BooleanMap map, DoubleComparator 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