Description
Generate version and range cases with exact matched and unmatched controls using the existing range checker's supported grammar.
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.
Generate version and range cases with exact matched and unmatched controls using the existing range checker's supported grammar.
When to use this tool
Use this generator to create reproducible semantic version range 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 count, ranges, minimumComponent, maximumComponent 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.
Preflight every supplied semantic-version range under the existing checker's supported grammar and safe component limits. For each sampled version, return the caller-range case, an equality control that matches, and a strictly-greater control that does not.1
Delegated operations used for this result: semantic version range; version parse. Their calculation or parsing conventions apply to the corresponding result fields.2, 3
| Input field | Meaning and units | Accepted input |
|---|---|---|
| count | Requested count; the mechanics explain whether one draw expands into several returned records. | Required. Safe integer; minimum 1; maximum 32. |
| ranges | Ranges | Required. Array of Text; maximum UTF-16 length 512.; minimum items 1; maximum items 32. |
| minimumComponent | Minimum Component | Required. Safe integer; minimum 0. |
| maximumComponent | Maximum Component | Required. Safe integer; minimum 0. |
| 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 3; maximum items 96. |
| cases[].role | Role | Required. Text; one of "sample", "matched-control", "unmatched-control". |
| cases[].range | Range | Required. Text; maximum UTF-16 length 4096. |
| cases[].version | Version | Required. Text; maximum UTF-16 length 4096. |
| cases[].comparatorCount | Comparator Count | Required. Safe integer. |
| cases[].satisfied | Satisfied | 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": {
"count": 1,
"ranges": [
"^1.0.0",
">=2.0.0 <3.0.0"
],
"minimumComponent": 1,
"maximumComponent": 3,
"seed": 42
},
"output": {
"cases": [
{
"role": "sample",
"range": ">=2.0.0 <3.0.0",
"version": "2.3.3",
"comparatorCount": 2,
"satisfied": true
},
{
"role": "matched-control",
"range": "=2.3.3",
"version": "2.3.3",
"comparatorCount": 1,
"satisfied": true
},
{
"role": "unmatched-control",
"range": ">2.3.3",
"version": "2.3.3",
"comparatorCount": 1,
"satisfied": false
}
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- count generates three cases per draw. Unsupported syntax is rejected even in unsampled ranges. This inherits the linked range grammar rather than promising every package manager's range semantics.
- 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 Semantic Version Ordering Corpus Generator
Generate synthetic safe-component semantic versions with prereleases, build precedence ties, exact duplicates, and a stable sorted answer key.
- Random Identifier Transcription Error Corpus Generator
Generate synthetic checksum-valid EAN-13 and 978-prefixed ISBN-13 originals, apply a selected decimal substitution, deletion, or adjacent transposition, and record actual GTIN/ISBN validator outcomes; swaps may be unchanged or remain valid, and checksum validity is not product or publication allocation.