protected static final class LTrieST.Node<E> extends TrieST.Node
B=49+E(类型字节)+8*r+对齐填充
若E为String,r=4(例如基因序列A,T,C,G),则B=49+64+2*n(n为字符串长度)+8*4=113+2*n+32=145+2*n+对齐填充
E
val
leaf, next
Node(int r)
next
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public E val
public Node(int r)
Copyright © 2022. All rights reserved.