Class Short2CharRBTreeMap

All Implemented Interfaces:
it.unimi.dsi.fastutil.Function<Short,Character>, it.unimi.dsi.fastutil.shorts.Short2CharFunction, Short2CharMap, Short2CharSortedMap, Serializable, Cloneable, Function<Short,Character>, IntUnaryOperator, Map<Short,Character>, SequencedMap<Short,Character>, SortedMap<Short,Character>

public class Short2CharRBTreeMap extends AbstractShort2CharSortedMap 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.shorts.Short2CharRBTreeMap.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.shorts.Short2CharRBTreeMap.Entry firstEntry
      The first key in this map.
    • lastEntry

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

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

      protected transient it.unimi.dsi.fastutil.shorts.ShortSortedSet keys
      Cached set of keys.
    • values

      protected transient it.unimi.dsi.fastutil.chars.CharCollection 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 Short> storedComparator
      This map's comparator, as provided in the constructor.
    • actualComparator

      protected transient it.unimi.dsi.fastutil.shorts.ShortComparator 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

    • Short2CharRBTreeMap

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

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

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

      public Short2CharRBTreeMap(SortedMap<Short,Character> 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.
    • Short2CharRBTreeMap

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

      public Short2CharRBTreeMap(Short2CharSortedMap 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.
    • Short2CharRBTreeMap

      public Short2CharRBTreeMap(short[] k, char[] v, Comparator<? super Short> 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.
    • Short2CharRBTreeMap

      public Short2CharRBTreeMap(short[] k, char[] 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