{"id":"range-partitioning-parallel-arrays-routing","text":"`_partitions` and `_boundaries` are kept in lockstep as parallel arrays — index `i` in both refers to the same partition — trading O(n) insert/delete for O(1) indexed access and O(log n) binary search routing.","truth_value":"IN","source":"entries/2026/05/29/range-partitioning-range_partitioning.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"explanation":{"steps":[{"node":"range-partitioning-parallel-arrays-routing","truth_value":"IN","reason":"premise"}]}}