Description
Construct original, retry and conflicting-payload operations with exact-string idempotency rules and retained accepted-payload state.
A protocol fixture is local test data representing headers, messages, identifiers, or request decisions. Serialization and parsing can be checked without contacting a server, while authentication, delivery, and actual client behavior require separate tests.
Construct original, retry and conflicting-payload operations with exact-string idempotency rules and retained accepted-payload state.
When to use this tool
Use this generator to create reproducible idempotency key replay 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 keys, payloads, modes, 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 operations, accepted, pretty. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Sample operation modes and retain the first accepted payload for each key. Later exact-payload replays are duplicate and differing payloads are conflict; return outcomes and retained payloads without overwriting accepted state.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| keys | Keys | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 128.; minimum items 1; maximum items 16. |
| payloads | Payloads | Required. Array of Text; maximum UTF-16 length 65536.; minimum items 1; maximum items 16. |
| modes | Modes | Required. Array of Text; one of "new", "retry", "conflict".; minimum items 1; maximum items 3. |
| 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 |
|---|---|---|
| operations | Operations | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 32. |
| operations[].key | Key | Required. Text; maximum UTF-16 length 65536. |
| operations[].payload | Payload | Required. Text; maximum UTF-16 length 65536. |
| operations[].mode | Mode | Required. Text; maximum UTF-16 length 65536. |
| operations[].outcome | Outcome | Required. Text; one of "accepted", "duplicate", "conflict". |
| operations[].retainedPayload | Retained Payload | Required. Text; maximum UTF-16 length 65536. |
| accepted | Accepted | Required. Array of Object; no unknown keys.; minimum items 0; maximum items 32. |
| accepted[].key | Key | Required. Text; maximum UTF-16 length 65536. |
| accepted[].payload | Payload | Required. Text; maximum UTF-16 length 65536. |
| 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": {
"keys": [
"op1"
],
"payloads": [
"A"
],
"modes": [
"retry"
],
"count": 3,
"seed": 42
},
"output": {
"operations": [
{
"key": "op1",
"payload": "A",
"mode": "retry",
"outcome": "accepted",
"retainedPayload": "A"
},
{
"key": "op1",
"payload": "A",
"mode": "retry",
"outcome": "duplicate",
"retainedPayload": "A"
},
{
"key": "op1",
"payload": "A",
"mode": "retry",
"outcome": "duplicate",
"retainedPayload": "A"
}
],
"accepted": [
{
"key": "op1",
"payload": "A"
}
],
"pretty": "[\n {\n \"key\": \"op1\",\n \"payload\": \"A\"\n }\n]\n",
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- A mode labeled new can still select an existing key, so read outcome rather than assuming acceptance. This is a sequential in-memory model without expiry, persistence, concurrency, or a real service request.
- 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 HTTP Vary Cache Key Fixture Generator
Construct synthetic request-header dimensions and exact tuple-key partitions under an explicit trim or exact policy, with wildcard requests isolated.
- Random HTML Attribute Quoting Corpus Generator
Compose bounded benign start-tag source with caller text, delegated five-character entity escaping, feasible double/single/unquoted/Boolean attribute forms, and duplicate attributes; retain the lexical parser's raw character references and first-duplicate rule, not DOM-decoded values, sanitization, or HTML conformance certification.