Description
Construct a bounded item tree with unique IDs, repeated caller labels, leaf-only lazy placeholders, one selection and visibility derived from ancestor expansion.
An interface fixture makes content and state explicit so a consumer can test a rendering or interaction. Literal labels, modeled states, and calculated geometry remain separate from what a browser or assistive technology actually displays or announces.
Construct a bounded item tree with unique IDs, repeated caller labels, leaf-only lazy placeholders, one selection and visibility derived from ancestor expansion.
When to use this tool
Use this generator to create reproducible tree view expansion fixture cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply labels, nodeCount in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read nodes. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Build a bounded tree by attaching each new node to an existing node below the depth limit. Draw labels and expansion flags, derive visibility from ancestor expansion, select exactly one node and retain lazy loading placeholders only on leaves.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| labels | Labels | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 128.; minimum items 1; maximum items 32. |
| nodeCount | Node Count | Required. Safe integer; minimum 1; maximum 32. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| nodes | Nodes | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| nodes[].id | Literal identifier used to match records, independently of their display labels. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 32. |
| nodes[].parentId | Parent Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 32. or Null. |
| nodes[].label | Caller-facing text label; not a globally unique identifier. | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| nodes[].expanded | Expanded | Required. Boolean. |
| nodes[].selected | Selected | Required. Boolean. |
| nodes[].lazy | Lazy | Required. Boolean. |
| nodes[].placeholderId | Placeholder Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 32. or Null. |
| nodes[].visible | Visible | Required. Boolean. |
| randomness | Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional numeric replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"labels": [
"Node"
],
"nodeCount": 2,
"seed": 42
},
"output": {
"nodes": [
{
"id": "node-0",
"parentId": null,
"label": "Node",
"expanded": true,
"selected": false,
"lazy": false,
"placeholderId": null,
"visible": true
},
{
"id": "node-1",
"parentId": "node-0",
"label": "Node",
"expanded": false,
"selected": true,
"lazy": false,
"placeholderId": null,
"visible": true
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Repeated caller labels do not merge unique node IDs. This is state data rather than a functional tree widget, keyboard interaction model or actual asynchronous data loader.
- A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random Navigation Menu Tree Fixture Generator
Build a bounded supplied-label menu tree with disabled states and one enabled current-location ancestry path; no browser interaction is modeled.
- Random Heading Hierarchy Mutation Corpus Generator
Mutate caller heading sequences at a constructible interior position to introduce an upward skip, retaining baseline and mutated markup and the existing outline heuristic.