Description
Generate an integer stream with empty, partial and full trailing-window answer states, exact safe sums and delegated full windows and Number-arithmetic means; empty extrema and means are null.
An operation trace pairs an ordered request stream with the state after each step. Empty operations, ties, evictions, and boundary indexes are part of the modeled contract rather than incidental display details.
Generate an integer stream with empty, partial and full trailing-window answer states, exact safe sums and delegated full windows and Number-arithmetic means; empty extrema and means are null.
When to use this tool
Use this generator to create reproducible rolling window aggregate trace 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 length, windowSize, minimumValue, maximumValue 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 stream, events, fullWindows. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Draw integer stream values and emit a trace from the empty prefix through the final prefix. Each trace retains the latest at most windowSize values, exact safe-integer sum, delegated mean, and extrema. Return full windows separately when enough values exist.1
Delegated operations used for this result: sliding window; mean. Their calculation or parsing conventions apply to the corresponding result fields.2, 3
| Input field | Meaning and units | Accepted input |
|---|---|---|
| length | Length | Required. Safe integer; minimum 0; maximum 64. |
| windowSize | Window Size | Required. Safe integer; minimum 1; maximum 16. |
| minimumValue | Minimum Value | Required. Safe integer. |
| maximumValue | Maximum Value | Required. Safe integer. |
| 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 |
|---|---|---|
| stream | Stream | Required. Array of Safe integer.; minimum items 0; maximum items 64. |
| events | Events | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 65. |
| events[].start | Start | Required. Safe integer; minimum 0; maximum 64. |
| events[].endExclusive | End Exclusive | Required. Safe integer; minimum 0; maximum 64. |
| events[].values | Values | Required. Array of Safe integer.; minimum items 0; maximum items 16. |
| events[].sum | Sum | Required. Safe integer. |
| events[].mean | Mean | Required. Finite number. or Null. |
| events[].minimum | Minimum | Required. Safe integer. or Null. |
| events[].maximum | Maximum | Required. Safe integer. or Null. |
| fullWindows | Full Windows | Required. Array of Array of Safe integer.; minimum items 0; maximum items 16.; minimum items 0; maximum items 64. |
| 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": {
"length": 3,
"windowSize": 2,
"minimumValue": 1,
"maximumValue": 4,
"seed": 42
},
"output": {
"stream": [
3,
2,
4
],
"events": [
{
"start": 0,
"endExclusive": 0,
"values": [],
"sum": 0,
"mean": null,
"minimum": null,
"maximum": null
},
{
"start": 0,
"endExclusive": 1,
"values": [
3
],
"sum": 3,
"mean": 3,
"minimum": 3,
"maximum": 3
},
{
"start": 0,
"endExclusive": 2,
"values": [
3,
2
],
"sum": 5,
"mean": 2.5,
"minimum": 2,
"maximum": 3
},
{
"start": 1,
"endExclusive": 3,
"values": [
2,
4
],
"sum": 6,
"mean": 3,
"minimum": 2,
"maximum": 4
}
],
"fullWindows": [
[
3,
2
],
[
2,
4
]
],
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- The empty event has sum zero and null mean, minimum, and maximum. Early events are partial windows; fullWindows excludes them. Overflow is rejected rather than silently rounded.
- 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 LFU Cache Tie Break Trace Generator
Plant an equal-frequency eviction tie when capacity is at least two; capacity one is an explicit single-candidate eviction control. Retain FIFO, LRU or lexical choices and resident counts that reset after eviction.
- Random LRU Cache Request Trace Generator
Generate bounded key bursts with declared previous-burst locality probability and retain least-to-most-recent cache snapshots, hits, evictions and exact global request counts.