Description
Find exact common boundaries between two histogram edge plans with identical outer endpoints.
Histogram edges divide a numeric coordinate axis into ordered bins, while each bin mass represents a count or nonnegative weight. Probability mass is a fraction of the total; probability density additionally divides by bin width and therefore has inverse coordinate units. An edge plan alone contains no observations.
Find exact common boundaries between two histogram edge plans with identical outer endpoints.
When to use this tool
Use common boundaries to prepare two edge plans for exact whole-bin coarsening.
How to use the tool and how it works
- Enter leftEdges, rightEdges using the definitions below.
- Run the operation. Resolve input-format errors before interpreting an output.
- Read result.edges, result.leftIndexes, result.rightIndexes, using the stated boundary, ordering, sign and absence conventions.
Require identical outer endpoints for two strictly increasing edge lists. Retain only boundaries present by exact numeric equality in both lists, and report their original indexes on each side.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| leftEdges | Left strictly increasing finite edge plan, with outer endpoints exactly matching rightEdges. | Dense list of at most 128 finite numbers, under the stated integer/range rules. |
| rightEdges | Right strictly increasing finite edge plan, sharing exact outer endpoints with leftEdges. | Dense list of at most 128 finite numbers, under the stated integer/range rules. |
| Output field | Interpretation |
|---|---|
| result | Object containing the fields below. |
| result.edges | Resulting increasing coordinate boundaries; no observations are implicitly added. |
| result.leftIndexes | Original indexes of every retained common boundary in leftEdges. |
| result.rightIndexes | Original indexes of every retained common boundary in rightEdges. |
{
"input": {
"leftEdges": [
0,
1,
2,
4
],
"rightEdges": [
0,
2,
3,
4
]
},
"output": {
"result": {
"edges": [
0,
2,
4
],
"leftIndexes": [
0,
2,
3
],
"rightIndexes": [
0,
1,
3
]
}
}
}Limitations and assumptions
- This is a common boundary plan, not a resampling or mass-merging operation. Approximately equal floating-point boundaries are treated as different.
- Edge lists contain at least two finite strictly increasing numbers. A mass array paired with edges has exactly one nonnegative finite mass per interval. Other mass-only operations accept empty arrays. Floating-point calculations do not imply exact decimal arithmetic or recover observations inside a bin.
- Every declared outer field is required and unknown outer fields are rejected. Strings and JSON text have size limits, lists are bounded to 128 entries, and JSON nesting/node counts are bounded. Tighter operation-specific bounds stated above take precedence.
- Numeric outputs must remain finite and within safe-integer magnitude. Original record indexes and cell coordinates are zero-based; stated half-open ranges exclude their end.
Alternative or Complementary methods
Keep edge definitions with mass arrays. Use common-boundary coarsening and whole-bin merging for aligned comparisons; use observation-level data when a calculation requires locations within bins.
References
Similar or alternative tools
- Histogram Adjacent Bin Merge Plan
Merge adjacent whole histogram bins according to explicit retained boundary indexes.
- Histogram Matched Bin Difference Table
Compare aligned histogram masses using signed right-minus-left differences per bin and in total.