Description
Return members strictly between left and right and their count, requiring left<right and a strictly increasing supplied member list.
A finite set records membership, while a multiset also records multiplicity. An ordered set adds an ordering rule, and an interval adds endpoint-closure choices. A witness for one element, a count budget, and equality of complete sets establish different facts.
Return members strictly between left and right and their count, requiring left<right and a strictly increasing supplied member list.
When to use this tool
Use Ordered Set Exclusive Rank Gap when you need the stated finite-set, interval, multiplicity, membership, or ordering operation under the given equality convention.
How to use the tool and how it works
- Enter left, right, members. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read between, count. Use the output convention below.
Return members strictly between left and right and their count, requiring left<right and a strictly increasing supplied member list.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| left | Left | Required. Text; maximum UTF-16 length 8192. |
| right | Right | Required. Text; maximum UTF-16 length 8192. |
| members | Members | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| between | Between | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| count | Count under the stated input or output convention. | Required. Safe integer. |
{
"input": {
"left": "a",
"right": "d",
"members": [
"a",
"b",
"c",
"d"
]
},
"output": {
"between": [
"b",
"c"
],
"count": 2
}
}Limitations and assumptions
- Both endpoints are excluded, whether or not present in the list. This is a supplied ordered-string comparison, not locale collation, numeric parsing, or inferred rank boundaries.
- The field tables state structural bounds; the mechanics also specify cross-field constraints. Malformed inputs and unsupported domains cause errors. A successful false flag, empty branch value, or zero placeholder has the meaning stated above and is distinct from an input error.
- Numeric calculations use binary floating point unless exact decimal-integer arithmetic is explicitly stated. No hidden measurement tolerance or decimal rounding is added; nonfinite or out-of-contract results are rejected. Signed zero is exported as zero.
Alternative or Complementary methods
Use a full set operation when one element or count cannot establish the required relation. Preserve the distinction between strings, typed scalar atoms, nested sets, ordered lists, and multisets.
References
Similar or alternative tools
- Ordered Set Neighbor Insertion Rank
Locate a new value in a strictly increasing numeric sorted list and return zero-based insertion rank, predecessor, successor, and presence flags.
- Finite Set Rank After One Insertion
Return newRank=oldRank+1 only when the element was not already present and insertedRank<=oldRank.