Interval Containment Classifier
Classify containment and equality of nonempty half-open intervals without conflating partial overlap with containment.
Description
Classify containment and equality of nonempty half-open intervals without conflating partial overlap with containment.
Containment compares the full bounds of two positive-length intervals. Equal intervals contain each other under inclusive boundary comparison.
When to use this tool
Classify containment and equality of nonempty half-open intervals without conflating partial overlap with containment.
- 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.aContainsB, result.bContainsA, result.equal. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Require both intervals to have end greater than start. Return whether A contains B and whether B contains A using nonstrict comparisons on their starts and ends.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.aContainsB | Flag for a contains b under the exact condition described above. |
| result.bContainsA | Flag for b contains a under the exact condition described above. |
| result.equal | Flag for equal under the exact condition described above. |
{
"input": {
"aStart": 0,
"aEnd": 4,
"bStart": 1,
"bEnd": 3
},
"output": {
"result": {
"aContainsB": true,
"bContainsA": false,
"equal": false
}
}
}Limitations and assumptions
- These are bound-containment flags without open/closed endpoint choices. They do not measure overlap length or accept degenerate intervals.
- 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 Shared Endpoint Classifier
Identify exact shared endpoint values independently of whether interval interiors overlap.
- Allen Interval Relation Classifier
Classify the 13 Allen relations between finite positive-length intervals, with A relative to B and exact endpoint equality.