Uses of Class
com.ibm.icu.util.StringTrieBuilder.Node
Packages that use StringTrieBuilder.Node
-
Uses of StringTrieBuilder.Node in com.ibm.icu.util
Subclasses of StringTrieBuilder.Node in com.ibm.icu.utilModifier and TypeClassDescriptionprivate static final class
private static class
private static final class
private static final class
private static final class
private static final class
private static final class
private static class
Fields in com.ibm.icu.util declared as StringTrieBuilder.NodeModifier and TypeFieldDescriptionprivate StringTrieBuilder.Node[]
StringTrieBuilder.ListBranchNode.equal
private StringTrieBuilder.Node
StringTrieBuilder.SplitBranchNode.greaterOrEqual
private StringTrieBuilder.Node
StringTrieBuilder.SplitBranchNode.lessThan
private StringTrieBuilder.Node
StringTrieBuilder.BranchHeadNode.next
private StringTrieBuilder.Node
StringTrieBuilder.IntermediateValueNode.next
private StringTrieBuilder.Node
StringTrieBuilder.LinearMatchNode.next
private StringTrieBuilder.Node
StringTrieBuilder.root
Fields in com.ibm.icu.util with type parameters of type StringTrieBuilder.NodeModifier and TypeFieldDescriptionprivate ArrayList<StringTrieBuilder.Node>
StringTrieBuilder.DynamicBranchNode.equal
StringTrieBuilder.nodes
StringTrieBuilder.nodes
Methods in com.ibm.icu.util that return StringTrieBuilder.NodeModifier and TypeMethodDescriptionStringTrieBuilder.DynamicBranchNode.add
(StringTrieBuilder builder, CharSequence s, int start, int sValue) StringTrieBuilder.LinearMatchNode.add
(StringTrieBuilder builder, CharSequence s, int start, int sValue) StringTrieBuilder.Node.add
(StringTrieBuilder builder, CharSequence s, int start, int sValue) Recursive method for adding a new (string, value) pair.StringTrieBuilder.ValueNode.add
(StringTrieBuilder builder, CharSequence s, int start, int sValue) StringTrieBuilder.DynamicBranchNode.register
(StringTrieBuilder builder) private StringTrieBuilder.Node
StringTrieBuilder.DynamicBranchNode.register
(StringTrieBuilder builder, int start, int limit) StringTrieBuilder.LinearMatchNode.register
(StringTrieBuilder builder) StringTrieBuilder.Node.register
(StringTrieBuilder builder) Recursive method for registering unique nodes, after all (string, value) pairs have been added.private final StringTrieBuilder.Node
StringTrieBuilder.registerNode
(StringTrieBuilder.Node newNode) Makes sure that there is only one unique node registered that is equivalent to newNode, unless BUILDING_FAST.Methods in com.ibm.icu.util with parameters of type StringTrieBuilder.NodeModifier and TypeMethodDescriptionvoid
StringTrieBuilder.DynamicBranchNode.add
(char c, StringTrieBuilder.Node node) void
StringTrieBuilder.ListBranchNode.add
(int c, StringTrieBuilder.Node node) private final StringTrieBuilder.Node
StringTrieBuilder.registerNode
(StringTrieBuilder.Node newNode) Makes sure that there is only one unique node registered that is equivalent to newNode, unless BUILDING_FAST.Constructors in com.ibm.icu.util with parameters of type StringTrieBuilder.NodeModifierConstructorDescriptionBranchHeadNode
(int len, StringTrieBuilder.Node subNode) IntermediateValueNode
(int v, StringTrieBuilder.Node nextNode) LinearMatchNode
(CharSequence builderStrings, int sOffset, int len, StringTrieBuilder.Node nextNode) SplitBranchNode
(char middleUnit, StringTrieBuilder.Node lessThanNode, StringTrieBuilder.Node greaterOrEqualNode)