Description
Generate multilevel synthetic hierarchy totals, depths and parent shares with explicit empty terminal branches; radial layout is surface-owned.
A chart dataset contains values plus the labels, grouping, totals, or missing-value conventions needed to interpret them. Separating the numeric construction from plotting makes conservation rules and deliberate edge cases visible before a chart is rendered.
Generate multilevel synthetic hierarchy totals, depths and parent shares with explicit empty terminal branches; radial layout is surface-owned.
When to use this tool
Use this generator to create reproducible sunburst hierarchy dataset 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 nodes, minimum, maximum, emptyBranches 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.
Generate the requested hierarchy with positive leaf weights and aggregate ancestor values. Explicit empty branches have value zero. Return depth and parentShare, using null for the root or when the parent value is zero.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| 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 64. |
| nodes[].parent | Parent | Required. Safe integer; minimum -1; maximum 30. |
| nodes[].leaf | Leaf | Required. Boolean. |
| minimum | Minimum | Required. Safe integer; minimum 1; maximum 9007199254740990. |
| maximum | Maximum | Required. Safe integer; minimum 1; maximum 9007199254740990. |
| emptyBranches | Empty Branches | Required. Array of Safe integer; minimum 0; maximum 31.; minimum items 0; maximum items 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 64. |
| nodes[].parent | Parent | Required. Safe integer. |
| nodes[].depth | Depth | Required. Safe integer. |
| nodes[].value | Value | Required. Safe integer. |
| nodes[].parentShare | Parent Share | Required. Finite number. or Null. |
| 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": {
"nodes": [
{
"id": "r",
"parent": -1,
"leaf": false
},
{
"id": "a",
"parent": 0,
"leaf": true
},
{
"id": "empty",
"parent": 0,
"leaf": false
}
],
"minimum": 2,
"maximum": 5,
"emptyBranches": [
2
],
"seed": 42
},
"output": {
"nodes": [
{
"id": "r",
"parent": -1,
"depth": 0,
"value": 4,
"parentShare": null
},
{
"id": "a",
"parent": 0,
"depth": 1,
"value": 4,
"parentShare": 1
},
{
"id": "empty",
"parent": 0,
"depth": 1,
"value": 0,
"parentShare": 0
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- A hierarchy and its shares do not specify a radial sunburst layout. Empty branches and null shares require deliberate consumer handling; the values are synthetic.
- 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 Treemap Hierarchy Dataset Generator
Generate positive leaf weights and exact ancestor totals in a supplied rooted hierarchy; treemap packing belongs to the renderer.
- Random Heatmap Block Structure Dataset Generator
Construct labeled heatmap blocks with bounded integer noise and optional mirrored symmetry, retaining the planted block mask.