Interval Window Intersection Table
Tabulate each positive-length source/window intersection with both indexes; touching endpoints are not overlap rows.
Description
Tabulate each positive-length source/window intersection with both indexes; touching endpoints are not overlap rows.
Intersecting many source intervals with many windows produces a traceable set of clipped spans. Source and window indexes retain the origin of each intersection.
When to use this tool
Tabulate each positive-length source/window intersection with both indexes; touching endpoints are not overlap rows.
- Prepare the supplied intervals, windows 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 intervals, windows. 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.intersections. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
For every source/window pair, take the larger start and smaller end. Return a row with both indexes only when end is strictly greater than start.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| intervals | intervals. | Numeric rows; at most 128 rows and 128 values per row |
| windows | windows. | Numeric rows; at most 128 rows and 128 values per row |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.intersections | The intersections list in the ordering and representation described above. |
{
"input": {
"intervals": [
[
0,
2
]
],
"windows": [
[
1,
3
]
]
},
"output": {
"result": {
"intersections": [
{
"sourceIndex": 0,
"windowIndex": 0,
"start": 1,
"end": 2
}
]
}
}
}Limitations and assumptions
- Endpoint-only contact and zero-length intervals produce no row. Inputs are bounded ordered pairs; the tool does not merge duplicate or adjacent output spans.
- Interval-array rows contain exactly two finite endpoints in start/end order, with at most 128 intervals per collection. Individual operations state when positive length, integer endpoints or explicit inclusion flags are required.
- 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
Retain the endpoint convention with every result. Continuous length, integer point counts and open/closed membership differ; merge returned cells separately when a canonical minimal interval collection is required.
References
Similar or alternative tools
- Interval Affine Transform
Affine-transform interval endpoints, reorder the image bounds and retain negative-scale orientation reversal.
- Interval Clamp and Empty Audit
Audit raw clipped interval bounds and emptiness; disjoint intersections retain start>end as evidence, not a fabricated nonempty interval.