Description
Test exact terminal word membership for each supplied query, preserving empty queries and repeated occurrences.
A trie stores literal words as root-to-node character paths, with terminal flags marking complete words. A terminal can also have children, and an existing prefix path need not be a stored word. This family uses one UTF-16 code unit per ordinary edge, so code-unit length differs from a displayed character or Unicode code-point count.
Test exact terminal word membership for each supplied query, preserving empty queries and repeated occurrences.
When to use this tool
Use this tool to test exact terminal word membership for each supplied query, preserving empty queries and repeated occurrences.
How to use the tool and how it works
- Enter nodesJson, words using the definitions below. Serialize JSON text fields in the decoded shape shown below.
- Run the operation. Resolve input-format errors before interpreting an output.
- Read result.membership, using the stated boundary, ordering, sign and absence conventions.
Follow one UTF-16 edge per query code unit. Return 1 only when all edges exist and the final node is terminal, otherwise 0, preserving query order.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| nodesJson | JSON array of {id,parent,character,terminal} nodes under the complete root-zero trie rules below. | Text, at most 8,192 UTF-16 code units; narrower grammar/range rules also apply. |
| words | Explicit literal word strings in caller order; construction limits each word to 127 code units. | Dense list of at most 128 literal strings, each at most 8,192 UTF-16 units. |
These decoded structures show the examples inside JSON text fields. Supply their serialized JSON strings as input.
{
"nodesJson": [
{
"id": 0,
"parent": null,
"character": "",
"terminal": false
},
{
"id": 1,
"parent": 0,
"character": "a",
"terminal": true
},
{
"id": 2,
"parent": 1,
"character": "b",
"terminal": true
},
{
"id": 3,
"parent": 0,
"character": "b",
"terminal": true
}
]
}| Output field | Interpretation |
|---|---|
| result | Object containing the fields below. |
| result.membership | Input-order numeric 0/1 terminal-word membership flags. |
{
"input": {
"nodesJson": "[{\"id\": 0, \"parent\": null, \"character\": \"\", \"terminal\": false}, {\"id\": 1, \"parent\": 0, \"character\": \"a\", \"terminal\": true}, {\"id\": 2, \"parent\": 1, \"character\": \"b\", \"terminal\": true}, {\"id\": 3, \"parent\": 0, \"character\": \"b\", \"terminal\": true}]",
"words": [
"",
"a",
"ab",
"ac"
]
},
"output": {
"result": {
"membership": [
0,
1,
1,
0
]
}
}
}Limitations and assumptions
- An existing nonterminal prefix is not a stored word; the root counts as the empty word only when terminal.
- Ordinary node tables have at most 128 nodes with distinct IDs 0–127, one root ID 0 with empty character and null parent, unique parent/character edges, complete acyclic parent links and a boolean terminal flag. Every nonroot character is exactly one UTF-16 code unit.
- Every declared outer field is required and unknown outer fields are rejected. Strings and JSON text have size limits, lists are bounded to 128 entries, and JSON nesting/node counts are bounded. Tighter operation-specific bounds stated above take precedence.
- Ordinary numeric outputs must be finite and within safe-integer magnitude. Exact large lengths/counts use decimal strings. Original record indexes and code-unit positions are zero-based; span ends are exclusive unless stated otherwise.
Alternative or Complementary methods
Choose word membership, prefix existence, completion or ranking according to the question. Normalize text separately if needed; these operations preserve exact code units and caller order.
References
Similar or alternative tools
- Prefix Trie Terminal Word Path List
Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; list all terminal literal word paths in source node order, including an explicitly terminal root as the empty word.
- Prefix Trie Literal Prefix Completion List
Bounded explicit prefix trie with root ID 0, unique sibling UTF-16 code-unit edges and terminal flags; select terminal word completions in source-node order, including the prefix itself if terminal.