Serialized Form

  • Package net.evmodder.EvLib.util

    • Class net.evmodder.EvLib.util.IndexTreeMap

      class IndexTreeMap extends AbstractMap<K,V> implements Serializable
      serialVersionUID:
      919286545866124777L

      • Serialization Methods

        • readObject
          private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
          Reconstitute the IndexTreeMap instance from a stream (i.e., deserialize it).
          Throws:
          IOException
          ClassNotFoundException
        • writeObject
          private void writeObject(ObjectOutputStream s) throws IOException
          Save the state of the IndexTreeMap instance to a stream (i.e., serialize it).
          Serial Data:
          The size of the IndexTreeMap (the number of key-value mappings) is emitted (int), followed by the key (Object) and value (Object) for each key-value mapping represented by the IndexTreeMap. The key-value mappings are emitted in key-order (as determined by the IndexTreeMap's Comparator, or by the keys' natural ordering if the IndexTreeMap has no Comparator).
          Throws:
          IOException

      • Serialized Fields

        • comparator
          Comparator<? super K> comparator
          The comparator used to maintain order in this tree map, or null if it uses the natural ordering of its keys.

    • Class net.evmodder.EvLib.util.IndexTreeMap.AscendingSubMap

      class AscendingSubMap extends net.evmodder.EvLib.util.IndexTreeMap.NavigableSubMap<K,V> implements Serializable
      serialVersionUID:
      912986545866124777L

    • Class net.evmodder.EvLib.util.IndexTreeMap.DescendingSubMap

      class DescendingSubMap extends net.evmodder.EvLib.util.IndexTreeMap.NavigableSubMap<K,V> implements Serializable
      serialVersionUID:
      912986545866120777L

      • Serialized Fields

        • reverseComparator
          Comparator<? super K> reverseComparator

    • Class net.evmodder.EvLib.util.IndexTreeMap.NavigableSubMap

      class NavigableSubMap extends AbstractMap<K,V> implements Serializable
      serialVersionUID:
      -2102997345730753777L

      • Serialized Fields

        • fromStart
          boolean fromStart
        • hi
          K hi
          Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive). If fromStart is true, then the low (absolute) bound is the start of the backing map, and the other values are ignored. Otherwise, if loInclusive is true, lo is the inclusive bound, else lo is the exclusive bound. Similarly for the upper bound.
        • hiInclusive
          boolean hiInclusive
        • lo
          K lo
          Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive). If fromStart is true, then the low (absolute) bound is the start of the backing map, and the other values are ignored. Otherwise, if loInclusive is true, lo is the inclusive bound, else lo is the exclusive bound. Similarly for the upper bound.
        • loInclusive
          boolean loInclusive
        • m
          IndexTreeMap<K,V> m
          The backing map.
        • toEnd
          boolean toEnd

    • Class net.evmodder.EvLib.util.IndexTreeMultiMap

      class IndexTreeMultiMap extends AbstractMap<K,Collection<V>> implements Serializable
      serialVersionUID:
      919286545866124777L

      • Serialization Methods

        • readObject
          private void readObject(ObjectInputStream s) throws IOException, ClassNotFoundException
          Reconstitute the IndexTreeMap instance from a stream (i.e., deserialize it).
          Throws:
          IOException
          ClassNotFoundException
        • writeObject
          private void writeObject(ObjectOutputStream s) throws IOException
          Save the state of the IndexTreeMap instance to a stream (i.e., serialize it).
          Serial Data:
          The size of the IndexTreeMap (the number of key-value mappings) is emitted (int), followed by the key (Object) and value (Object) for each key-value mapping represented by the IndexTreeMap. The key-value mappings are emitted in key-order (as determined by the IndexTreeMap's Comparator, or by the keys' natural ordering if the IndexTreeMap has no Comparator).
          Throws:
          IOException

      • Serialized Fields

        • comparator
          Comparator<? super K> comparator
          The comparator used to maintain order in this tree map, or null if it uses the natural ordering of its keys.

    • Class net.evmodder.EvLib.util.IndexTreeMultiMap.AscendingSubMap

      class AscendingSubMap extends net.evmodder.EvLib.util.IndexTreeMultiMap.NavigableSubMap<K,V> implements Serializable
      serialVersionUID:
      912986545866124777L

    • Class net.evmodder.EvLib.util.IndexTreeMultiMap.DescendingSubMap

      class DescendingSubMap extends net.evmodder.EvLib.util.IndexTreeMultiMap.NavigableSubMap<K,V> implements Serializable
      serialVersionUID:
      912986545866120777L

      • Serialized Fields

        • reverseComparator
          Comparator<? super K> reverseComparator

    • Class net.evmodder.EvLib.util.IndexTreeMultiMap.NavigableSubMap

      class NavigableSubMap extends AbstractMap<K,Collection<V>> implements Serializable
      serialVersionUID:
      -2102997345730753777L

      • Serialized Fields

        • fromStart
          boolean fromStart
        • hi
          K hi
          Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive). If fromStart is true, then the low (absolute) bound is the start of the backing map, and the other values are ignored. Otherwise, if loInclusive is true, lo is the inclusive bound, else lo is the exclusive bound. Similarly for the upper bound.
        • hiInclusive
          boolean hiInclusive
        • lo
          K lo
          Endpoints are represented as triples (fromStart, lo, loInclusive) and (toEnd, hi, hiInclusive). If fromStart is true, then the low (absolute) bound is the start of the backing map, and the other values are ignored. Otherwise, if loInclusive is true, lo is the inclusive bound, else lo is the exclusive bound. Similarly for the upper bound.
        • loInclusive
          boolean loInclusive
        • m
          IndexTreeMultiMap<K,V> m
          The backing map.
        • toEnd
          boolean toEnd