Description
Construct caller-supplied enum code and label examples with guaranteed unknown-code controls and nullable lookup answers.
A parser corpus pairs literal input spellings or structured documents with observable parser results or explicitly constructed expectations. Successful parsing, semantic validity, and exact round-trip preservation are separate properties, so test records retain the relevant evidence.
Construct caller-supplied enum code and label examples with guaranteed unknown-code controls and nullable lookup answers.
When to use this tool
Use this generator to create reproducible json schema enum label 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 mappings, unknownControl, count 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 cases. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Choose a supplied code-to-label mapping or substitute a generated code absent from the entire bank. Return whether the code is known, its label or null, and a pretty serialized record.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| mappings | Mappings | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| mappings[].code | Code | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| mappings[].label | Caller-facing text label; not a globally unique identifier. | Required. Text; maximum UTF-16 length 65536. |
| unknownControl | Unknown Control | Required. Boolean. |
| count | Requested count; the mechanics explain whether one draw expands into several returned records. | 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 |
|---|---|---|
| cases | Cases | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| cases[].code | Code | Required. Text; maximum UTF-16 length 65536. |
| cases[].known | Known | Required. Boolean. |
| cases[].label | Caller-facing text label; not a globally unique identifier. | Required. Text; maximum UTF-16 length 65536. or Null. |
| cases[].pretty | Pretty | Required. Text; maximum UTF-16 length 65536. |
| 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": {
"mappings": [
{
"code": "A",
"label": "Alpha"
},
{
"code": "B",
"label": "Beta"
}
],
"unknownControl": false,
"count": 1,
"seed": 42
},
"output": {
"cases": [
{
"code": "B",
"known": true,
"label": "Beta",
"pretty": "{\n \"code\": \"B\",\n \"label\": \"Beta\"\n}\n"
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Unknown controls intentionally have null labels. Codes must be distinct but labels may repeat. This is a finite mapping fixture, not validation against an external enumeration standard.
- 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 JSON Schema Example Fixture Generator
Synthesize flat string-enum, safe-integer-range and boolean schema examples with controlled missing-field or wrong-type labels.
- Random JSON Schema Union Branch Fixture Generator
Construct caller-labeled tagged-union documents with missing, unknown or conflicting payload controls and explicit branch-selection keys.