Class TreeValueSortedMap.Node

  • All Implemented Interfaces:
    java.util.Map.Entry<K,​V>
    Enclosing class:
    TreeValueSortedMap<K,​V>

    protected class TreeValueSortedMap.Node
    extends java.lang.Object
    implements java.util.Map.Entry<K,​V>
    An entry in the map. Nodes are elements of a binary tree and a doubly-linked list.
    • Constructor Detail

      • Node

        protected Node​(K key,
                       V val)
        Construct a new node
        Parameters:
        key - the key
        val - the data
    • Method Detail

      • toString

        public java.lang.String toString()
        Overrides:
        toString in class java.lang.Object
      • equals

        public boolean equals​(java.lang.Object obj)
        Specified by:
        equals in interface java.util.Map.Entry<K,​V>
        Overrides:
        equals in class java.lang.Object
      • hashCode

        public int hashCode()
        Specified by:
        hashCode in interface java.util.Map.Entry<K,​V>
        Overrides:
        hashCode in class java.lang.Object
      • computeIndex

        public int computeIndex()
        Compute this node's index. This uses the sizeLeft field to compute the index in O(log n) on average.
        Returns:
        the index
      • getKey

        public K getKey()
        Specified by:
        getKey in interface java.util.Map.Entry<K,​V>
      • getValue

        public V getValue()
        Specified by:
        getValue in interface java.util.Map.Entry<K,​V>
      • setValue

        public V setValue​(V value)
        Specified by:
        setValue in interface java.util.Map.Entry<K,​V>