| 程序包 | 说明 |
|---|---|
| shz.st.triest |
| 限定符和类型 | 类和说明 |
|---|---|
protected static class |
BTrieST.Node
1+25+8*r(r为数组长度)+对齐填充=32+8*r
B=48+8*r
|
protected static class |
CTrieST.Node
2+25+8*r(r为数组长度)+对齐填充=32+8*r
B=48+8*r
|
protected static class |
DTrieST.Node
8+25+8*r(r为数组长度)+对齐填充=40+8*r
B=56+8*r
|
protected static class |
FTrieST.Node
4+25+8*r(r为数组长度)+对齐填充=32+8*r
B=48+8*r
|
protected static class |
ITrieST.Node
4+25+8*r(r为数组长度)+对齐填充=32+8*r
B=48+8*r
|
protected static class |
JTrieST.Node
8+25+8*r(r为数组长度)+对齐填充=40+8*r
B=56+8*r
|
protected static class |
LTrieST.Node<E>
8+E(类型字节)+25+8*r(r为数组长度)+对齐填充
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+对齐填充
|
protected static class |
STrieST.Node
2+25+8*r(r为数组长度)+对齐填充=32+8*r
B=48+8*r
|
protected static class |
ZTrieST.Node
1+25+8*r(r为数组长度)+对齐填充=32+8*r
B=48+8*r
|
| 限定符和类型 | 字段和说明 |
|---|---|
TrieST.Node[] |
TrieST.Node.next |
protected TrieST.Node |
TrieST.root |
| 限定符和类型 | 方法和说明 |
|---|---|
protected <T extends TrieST.Node> |
TrieST.get(TrieST.Node x,
char[] a,
int d) |
<T extends TrieST.Node> |
TrieST.Node.next(int i) |
protected <T extends TrieST.Node> |
TrieST.root() |
| 限定符和类型 | 方法和说明 |
|---|---|
protected <T extends TrieST.Node> |
TrieST.get(TrieST.Node x,
char[] a,
int d) |
| 限定符和类型 | 方法和说明 |
|---|---|
protected Iterable<char[]> |
TrieST.getChars0(Predicate<TrieST.Node> predicate,
int limit) |
Copyright © 2022. All rights reserved.