merge(Collection, Trie.CollectionMergeResolver) |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
mergeDistinct(Collection) |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
process(Trie.Walker, Trie.Cursor) |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
subtrie(ByteComparable, boolean, ByteComparable, boolean) |  | 0% |  | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
forEachEntry(BiConsumer) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
dump(Function) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
subtrie(ByteComparable, ByteComparable) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
mergeWith(Trie, Trie.MergeResolver) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
forEachValue(Trie.ValueConsumer) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
process(Trie.Walker) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
valueIterator() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
dump() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
values() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
valuesUnordered() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
throwingResolver() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
empty() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
static {...} |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
singleton(ByteComparable, Object) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
entryIterator() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
Trie() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
entrySet() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |