Class Int2FloatRBTreeMap

All Implemented Interfaces:
it.unimi.dsi.fastutil.Function<Integer,Float>, it.unimi.dsi.fastutil.ints.Int2FloatFunction, Int2FloatMap, Int2FloatSortedMap, Serializable, Cloneable, Function<Integer,Float>, IntToDoubleFunction, Map<Integer,Float>, SequencedMap<Integer,Float>, SortedMap<Integer,Float>

public class Int2FloatRBTreeMap extends AbstractInt2FloatSortedMap implements Serializable, Cloneable
A type-specific red-black tree map with a fast, small-footprint implementation.

The iterators provided by the views of this class are type-specific bidirectional iterators. Moreover, the iterator returned by iterator() can be safely cast to a type-specific list iterator.

See Also:
  • Field Details

    • tree

      protected transient it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.Entry tree
      A reference to the root entry.
    • count

      protected int count
      Number of entries in this map.
    • firstEntry

      protected transient it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.Entry firstEntry
      The first key in this map.
    • lastEntry

      protected transient it.unimi.dsi.fastutil.ints.Int2FloatRBTreeMap.Entry lastEntry
      The last key in this map.
    • entries

      protected transient it.unimi.dsi.fastutil.objects.ObjectSortedSet<Int2FloatMap.Entry> entries
      Cached set of entries.
    • keys

      protected transient it.unimi.dsi.fastutil.ints.IntSortedSet keys
      Cached set of keys.
    • values

      protected transient it.unimi.dsi.fastutil.floats.FloatCollection values
      Cached collection of values.
    • modified

      protected transient boolean modified
      The value of this variable remembers, after a put() or a remove(), whether the domain of the map has been modified.
    • storedComparator

      protected Comparator<? super Integer> storedComparator
      This map's comparator, as provided in the constructor.
    • actualComparator

      protected transient it.unimi.dsi.fastutil.ints.IntComparator actualComparator
      This map's actual comparator; it may differ from storedComparator because it is always a type-specific comparator, so it could be derived from the former by wrapping.
  • Constructor Details

    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap()
      Creates a new empty tree map.
    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap(Comparator<? super Integer> c)
      Creates a new empty tree map with the given comparator.
      Parameters:
      c - a (possibly type-specific) comparator.
    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap(Map<? extends Integer,? extends Float> m)
      Creates a new tree map copying a given map.
      Parameters:
      m - a Map to be copied into the new tree map.
    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap(SortedMap<Integer,Float> m)
      Creates a new tree map copying a given sorted map (and its Comparator).
      Parameters:
      m - a SortedMap to be copied into the new tree map.
    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap(Int2FloatMap m)
      Creates a new tree map copying a given map.
      Parameters:
      m - a type-specific map to be copied into the new tree map.
    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap(Int2FloatSortedMap m)
      Creates a new tree map copying a given sorted map (and its Comparator).
      Parameters:
      m - a type-specific sorted map to be copied into the new tree map.
    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap(int[] k, float[] v, Comparator<? super Integer> c)
      Creates a new tree map using the elements of two parallel arrays and the given comparator.
      Parameters:
      k - the array of keys of the new tree map.
      v - the array of corresponding values in the new tree map.
      c - a (possibly type-specific) comparator.
      Throws:
      IllegalArgumentException - if k and v have different lengths.
    • Int2FloatRBTreeMap

      public Int2FloatRBTreeMap(int[] k, float[] v)
      Creates a new tree map using the elements of two parallel arrays.
      Parameters:
      k - the array of keys of the new tree map.
      v - the array of corresponding values in the new tree map.
      Throws:
      IllegalArgumentException - if k and v have different lengths.
  • Method Details