shz.st.bst.lxx

类 LLRedBlackBST<K extends Comparable<K>,V>

java.lang.Object

shz.st.bst.RedBlackBST<K>

shz.st.bst.lxx.LXXRedBlackBST<K>

shz.st.bst.lxx.LLRedBlackBST<K,V>

public class LLRedBlackBST<K extends Comparable<K>,V>
extends LXXRedBlackBST<K>

健为K类型，值为V类型的红黑树

8+[53+V(类型字节)+K(类型字节)+对齐填充]*n(n为元素个数)

B=24+48*n+(5+V+K+对齐填充)*n

嵌套类概要

嵌套类

限定符和类型	类和说明
protected static class	LLRedBlackBST.Node<K extends Comparable<K>,V> 8+V(类型字节)+29+K(类型字节)+对齐填充 B=53+V(类型字节)+K(类型字节)+对齐填充

字段概要

从类继承的字段 shz.st.bst.RedBlackBST

root

构造器概要

构造器

限定符	构造器和说明
protected	LLRedBlackBST(K key, V val)

方法概要

限定符和类型	方法和说明
void	delete(K key)
protected LLRedBlackBST.Node<K,V>	delete(LLRedBlackBST.Node<K,V> h, K key)
V	get(K key)
protected LLRedBlackBST.Node<K,V>	get(LLRedBlackBST.Node<K,V> h, K key)
static <K extends Comparable<K>,V> LLRedBlackBST<K,V>	of(K key)
static <K extends Comparable<K>,V> LLRedBlackBST<K,V>	of(K key, V val)
void	put(K key, V val)
protected LLRedBlackBST.Node<K,V>	put(LLRedBlackBST.Node<K,V> h, K key, V val)

从类继承的方法 shz.st.bst.lxx.LXXRedBlackBST

ceil, ceil, floor, floor, key, keys, keys, keys, keys, keysGe, keysGe, keysLe, keysLe, size, size, sizeGe, sizeGe, sizeLe, sizeLe

从类继承的方法 shz.st.bst.RedBlackBST

balance, deleteMax, deleteMax, deleteMin, deleteMin, depth, depth, flipColors, isEmpty, isLeaf, isRed, max, max, min, min, moveRedLeft, moveRedRight, root, rotateLeft, rotateRight, select, select, size, size

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

构造器详细资料

LLRedBlackBST

protected LLRedBlackBST(K key,
                        V val)

方法详细资料

of

public static <K extends Comparable<K>,V> LLRedBlackBST<K,V> of(K key,
                                                                V val)

of

public static <K extends Comparable<K>,V> LLRedBlackBST<K,V> of(K key)

put

public final void put(K key,
                      V val)

put

protected final LLRedBlackBST.Node<K,V> put(LLRedBlackBST.Node<K,V> h,
                                            K key,
                                            V val)

get

public final V get(K key)

get

protected final LLRedBlackBST.Node<K,V> get(LLRedBlackBST.Node<K,V> h,
                                            K key)

delete

public final void delete(K key)

delete

protected final LLRedBlackBST.Node<K,V> delete(LLRedBlackBST.Node<K,V> h,
                                               K key)