Class RBTree<K,​V>

    • Constructor Detail

    • Method Detail

      • isEmpty

        public boolean isEmpty()
      • search

        public io.keikaiex.util.RBNode<K,​V> search​(K key)
      • insert

        public io.keikaiex.util.RBNode<K,​V> insert​(io.keikaiex.util.RBNode<K,​V> node,
                                                         Object context)
      • delete

        public io.keikaiex.util.RBNode<K,​V> delete​(K key,
                                                         Object context)
      • insertDuplicate

        protected void insertDuplicate​(io.keikaiex.util.RBNode<K,​V> original,
                                       io.keikaiex.util.RBNode<K,​V> newone,
                                       Object context)
      • insertLeft

        protected void insertLeft​(io.keikaiex.util.RBNode<K,​V> parent,
                                  io.keikaiex.util.RBNode<K,​V> child)
      • insertRight

        protected void insertRight​(io.keikaiex.util.RBNode<K,​V> parent,
                                   io.keikaiex.util.RBNode<K,​V> child)
      • rightJumpUp

        protected void rightJumpUp​(io.keikaiex.util.RBNode<K,​V> g)
      • leftJumpUp

        protected void leftJumpUp​(io.keikaiex.util.RBNode<K,​V> g)
      • rotateRight

        protected void rotateRight​(io.keikaiex.util.RBNode<K,​V> g)
      • rotateLeft

        protected void rotateLeft​(io.keikaiex.util.RBNode<K,​V> g)
      • fixUp

        protected void fixUp​(List<io.keikaiex.util.RBTree.Traversal<K,​V>> lineal)