V - 值public abstract class BaseNode<V> extends Object implements Comparable<BaseNode>
| 限定符和类型 | 类和说明 |
|---|---|
static class |
BaseNode.Status |
class |
BaseNode.TrieEntry |
| 限定符和类型 | 字段和说明 |
|---|---|
protected char |
c
节点代表的字符
|
protected BaseNode[] |
child
子节点
|
protected BaseNode.Status |
status
节点状态
|
protected V |
value
节点代表的值
|
| 构造器和说明 |
|---|
BaseNode() |
| 限定符和类型 | 方法和说明 |
|---|---|
protected abstract boolean |
addChild(BaseNode node)
添加子节点
|
int |
compareTo(BaseNode other) |
int |
compareTo(char other)
重载,与字符的比较
|
protected char |
getChar() |
abstract BaseNode |
getChild(char c)
获取子节点
|
BaseNode.Status |
getStatus()
获取节点的成词状态
|
V |
getValue()
获取节点对应的值
|
protected boolean |
hasChild(char c)
是否含有子节点
|
void |
setValue(V value)
设置节点对应的值
|
String |
toString() |
BaseNode<V> |
transition(char[] path,
int begin) |
protected void |
walk(StringBuilder sb,
Set<Map.Entry<String,V>> entrySet) |
protected void |
walkToLoad(ByteArray byteArray,
_ValueArray<V> valueArray) |
protected void |
walkToLoad(ObjectInput byteArray) |
protected void |
walkToSave(DataOutputStream out) |
protected void |
walkToSave(ObjectOutput out) |
protected BaseNode[] child
protected BaseNode.Status status
protected char c
protected V value
protected abstract boolean addChild(BaseNode node)
protected boolean hasChild(char c)
c - 子节点的charprotected char getChar()
public abstract BaseNode getChild(char c)
c - 子节点的charpublic final V getValue()
public final void setValue(V value)
value - 值public int compareTo(BaseNode other)
compareTo 在接口中 Comparable<BaseNode>public int compareTo(char other)
other - public BaseNode.Status getStatus()
protected void walk(StringBuilder sb, Set<Map.Entry<String,V>> entrySet)
protected void walkToSave(DataOutputStream out) throws IOException
IOExceptionprotected void walkToSave(ObjectOutput out) throws IOException
IOExceptionprotected void walkToLoad(ByteArray byteArray, _ValueArray<V> valueArray)
protected void walkToLoad(ObjectInput byteArray) throws IOException, ClassNotFoundException
Copyright © 2014–2017 码农场. All rights reserved.