Package | Description |
---|---|
com.simiacryptus.util.text |
Modifier and Type | Class and Description |
---|---|
class |
IndexNode |
Modifier and Type | Field and Description |
---|---|
protected TrieNode |
NodewalkerCodec.Encoder.fromNode |
protected TrieNode |
NodewalkerCodec.Decoder.node |
protected TrieNode |
NodewalkerCodec.Encoder.node |
Modifier and Type | Method and Description |
---|---|
TrieNode |
TrieNode.getContinuation(char c) |
TrieNode |
TrieNode.getParent() |
TrieNode |
TrieNode.godparent() |
TrieNode |
CharTrie.matchEnd(String search) |
TrieNode |
CharTrie.matchPredictor(String search) |
protected TrieNode |
TrieNode.newNode(int index) |
protected TrieNode |
IndexNode.newNode(int index) |
TrieNode |
TrieNode.refresh() |
TrieNode |
CharTrie.root() |
TrieNode |
IndexNode.split() |
TrieNode |
TrieNode.traverse(long cursorId) |
TrieNode |
TrieNode.traverse(String str) |
TrieNode |
CharTrie.traverse(String search)
Locate a node by finding the maximum prefix match with the given string
|
TrieNode |
TrieNode.visitFirst(Consumer<? super TrieNode> visitor) |
TrieNode |
TrieNode.visitLast(Consumer<? super TrieNode> visitor) |
Modifier and Type | Method and Description |
---|---|
Optional<? extends TrieNode> |
TrieNode.getChild(char token) |
Stream<? extends TrieNode> |
TrieNode.getChildren() |
TreeMap<Character,? extends TrieNode> |
TrieNode.getChildrenMap() |
Map<Character,TrieNode> |
TrieNode.getGodChildren() |
<T extends Comparable<T>> |
CharTrie.max(Function<TrieNode,T> fn,
int maxResults) |
Stream<? extends TrieNode> |
TrieNode.streamDecendents(int level) |
protected Optional<TrieNode> |
NodewalkerCodec.writeBackup(NodewalkerCodec.Encoder encoder,
char token) |
Modifier and Type | Method and Description |
---|---|
Bits |
TrieNode.bitsTo(TrieNode toNode) |
String |
TrieNode.getDebugString(TrieNode root) |
String |
TrieNode.getString(TrieNode root) |
protected long |
ConvolutionalTrieSerializer.getUpperBound(TrieNode currentParent,
AtomicLong currentChildren,
TrieNode godchildNode,
int godchildAdjustment) |
Interval |
TrieNode.intervalTo(TrieNode toNode) |
Modifier and Type | Method and Description |
---|---|
<T extends Comparable<T>> |
CharTrie.max(Function<TrieNode,T> fn,
int maxResults) |
CharTrie |
CharTrie.reduce(CharTrie right,
BiFunction<TrieNode,TrieNode,TreeMap<Character,Long>> fn) |
CharTrie |
CharTrie.reduce(CharTrie right,
BiFunction<TrieNode,TrieNode,TreeMap<Character,Long>> fn) |
static BiFunction<CharTrie,CharTrie,CharTrie> |
CharTrie.reducer(BiFunction<TrieNode,TrieNode,TreeMap<Character,Long>> fn) |
static BiFunction<CharTrie,CharTrie,CharTrie> |
CharTrie.reducer(BiFunction<TrieNode,TrieNode,TreeMap<Character,Long>> fn) |
CharTrie |
CharTrie.rewrite(BiFunction<TrieNode,Map<Character,TrieNode>,TreeMap<Character,Long>> fn) |
CharTrie |
CharTrie.rewrite(BiFunction<TrieNode,Map<Character,TrieNode>,TreeMap<Character,Long>> fn) |
TrieNode |
TrieNode.visitFirst(Consumer<? super TrieNode> visitor) |
TrieNode |
TrieNode.visitLast(Consumer<? super TrieNode> visitor) |
Constructor and Description |
---|
IndexNode(CharTrie trie,
short depth,
int index,
TrieNode parent) |
TrieNode(CharTrie trie,
int index,
TrieNode parent) |
Copyright © 2017 SimiaCryptus Software. All rights reserved.