Window Start Index Planner
Plan full fixed-width window starts without allocating window values; incomplete tails are excluded.
Description
Plan full fixed-width window starts without allocating window values; incomplete tails are excluded.
Window-start planning separates a sequence's indexing policy from its contents. A stride can skip overlapping positions while retaining only complete windows.
When to use this tool
Plan full fixed-width window starts without allocating window values; incomplete tails are excluded.
- Prepare the supplied length, window, stride fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter length, window, stride. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.startIndexes. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Validate nonnegative length and positive integer window/stride. Generate starts j*stride for every j whose complete window fits within length.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| length | length. | Integer from 0 to 10000 inclusive |
| window | window. | Integer from 1 to 10000 inclusive |
| stride | stride. | Integer from 1 to 10000 inclusive |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.startIndexes | The start indexes list in the ordering and representation described above. |
{
"input": {
"length": 8,
"window": 3,
"stride": 2
},
"output": {
"result": {
"startIndexes": [
0,
2,
4
]
}
}
}Limitations and assumptions
- No partial final window or padding is added. A window exceeding the sequence length yields no starts; all dimensions are counts rather than time durations.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- Ordinary string lists have at most 128 entries of at most 128 code units each; numeric lists and matrices have separate bounded size checks. Nonfinite results and excessively large serialized outputs are rejected.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
Use explicit source-index maps when rearranging data or planning missing-value fills. Keep row-major coordinates, cyclic indexes and one-based occurrence numbers distinct, and inspect null donor positions before copying values.
References
Similar or alternative tools
- sliding window
Slice a list into overlapping fixed-size windows stepped one element at a time.
- Sliding Window Distinct Count
Count distinct exact-string values in each complete stride-one window, preserving window order.