Interval Gap Threshold Selector
Select positive uncovered gaps between union-covered intervals at an inclusive caller gap-length threshold.
Description
Select positive uncovered gaps between union-covered intervals at an inclusive caller gap-length threshold.
An interval collection can leave uncovered gaps even when some members overlap. Tracking the furthest covered endpoint avoids reporting false gaps inside overlapping spans.
When to use this tool
Select positive uncovered gaps between union-covered intervals at an inclusive caller gap-length threshold.
- Prepare the supplied intervals, minimumGap 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, minimumGap. 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.selectedGaps. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Require positive-length intervals, sort them by start, and extend the running covered end across overlaps. Emit each strictly positive gap whose length is at least minimumGap.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| intervals | intervals. | Numeric rows; at most 128 rows and 128 values per row |
| minimumGap | minimum gap. | Finite number; zero or greater |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.selectedGaps | The selected gaps list in the ordering and representation described above. |
{
"input": {
"intervals": [
[
0,
1
],
[
3,
4
],
[
3.5,
5
]
],
"minimumGap": 2
},
"output": {
"result": {
"selectedGaps": [
[
1,
3
]
]
}
}
} Limitations and assumptions
- Only gaps between supplied intervals are considered. No outer domain is inferred; zero-length gaps are never selected even when the minimum is zero.
- 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.