Description
Permute supplied primitive entries and retain semantic equality, serialized differences and ECMAScript integer-index key ordering.
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.
Permute supplied primitive entries and retain semantic equality, serialized differences and ECMAScript integer-index key ordering.
When to use this tool
Use this generator to create reproducible json object key order corpus 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 entries, 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 variants. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Shuffle supplied key/value entries, create objects in that insertion order, and compare their enumeration, compact JSON, and semantic key/value equality against the original. Return insertionKeys separately from enumerationKeys.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| entries | Entries | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| entries[].key | Key | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 128. |
| entries[].value | Value | Required. Text; maximum UTF-16 length 65536. or Finite number. or Boolean. or Null. |
| 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 |
|---|---|---|
| variants | Variants | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| variants[].insertionKeys | Insertion Keys | Required. Array of Text; maximum UTF-16 length 65536.; minimum items 0; maximum items 16. |
| variants[].enumerationKeys | Enumeration Keys | Required. Array of Text; maximum UTF-16 length 65536.; minimum items 0; maximum items 16. |
| variants[].document | Document | Required. Object. |
| variants[].compact | Compact | Required. Text; maximum UTF-16 length 65536. |
| variants[].pretty | Pretty | Required. Text; maximum UTF-16 length 65536. |
| variants[].semanticallyEqual | Semantically Equal | Required. Boolean. |
| variants[].sameSerialization | Same Serialization | 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": {
"entries": [
{
"key": "2",
"value": "two"
},
{
"key": "a",
"value": 7
},
{
"key": "1",
"value": "one"
}
],
"count": 1,
"seed": 42
},
"output": {
"variants": [
{
"insertionKeys": [
"a",
"2",
"1"
],
"enumerationKeys": [
"1",
"2",
"a"
],
"document": {
"1": "one",
"2": "two",
"a": 7
},
"compact": "{\"1\":\"one\",\"2\":\"two\",\"a\":7}",
"pretty": "{\n \"1\": \"one\",\n \"2\": \"two\",\n \"a\": 7\n}\n",
"semanticallyEqual": true,
"sameSerialization": true
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- JavaScript integer-like key enumeration can differ from insertion order. Object member order is not JSON semantic identity, while serialized byte equality is stricter than semantic equality.
- 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 Duplicate ID Dataset Generator
Construct linked records with an exact duplicate insertion count and retain missing, unique and ambiguous reference candidate indices.
- Random JSON Flattening Round-Trip Corpus Generator
Reuse the random nested-document generator for its safe dot-path/contiguous-array subset, then actually flatten and rebuild every generated document with both existing cores; retain intermediate leaves and original/rebuilt forms, excluding sparse/mixed containers, reserved segments, literal-dot keys and empty-container loss cases rather than claiming arbitrary JSON round trips.