Interval Shared Endpoint Classifier
Identify exact shared endpoint values independently of whether interval interiors overlap.
Description
Identify exact shared endpoint values independently of whether interval interiors overlap.
Two intervals can share a named endpoint independently of whether their interiors overlap. A shared-endpoint inventory exposes exact boundary coincidences.
When to use this tool
Identify exact shared endpoint values independently of whether interval interiors overlap.
- Prepare the supplied aStart, aEnd, bStart, bEnd 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 aStart, aEnd, bStart, bEnd. 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.sharedEndpoints. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Compare the start/end values from both ordered intervals, keep values occurring among both pairs, remove duplicates and sort the resulting shared endpoints numerically.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| aStart | a start. | Finite number |
| aEnd | a end. | Finite number |
| bStart | b start. | Finite number |
| bEnd | b end. | Finite number |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.sharedEndpoints | The shared endpoints list in the ordering and representation described above. |
{
"input": {
"aStart": 0,
"aEnd": 1,
"bStart": 1,
"bEnd": 2
},
"output": {
"result": {
"sharedEndpoints": [
1
]
}
}
}Limitations and assumptions
- Intervals may be degenerate. Shared endpoints do not classify full containment or measure overlap, and exact numeric equality supplies no tolerance for measured coordinates.
- 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 Containment Classifier
Classify containment and equality of nonempty half-open intervals without conflating partial overlap with containment.
- Interval Endpoint Event Table
Build grouped endpoint event tables with starts, ends and empty intervals separately; simultaneous events are not silently ordered.