On Thu, 15 Oct 2026 at 19:59, Brian Bi <bbi5291_at_[hidden]> wrote:
>
> On Thu, Oct 15, 2026 at 12:56 PM Ville Voutilainen <ville.voutilainen_at_[hidden]> wrote:
>>
>> On Thu, 15 Oct 2026 at 19:19, Brian Bi via Std-Proposals
>> <std-proposals_at_[hidden]> wrote:
>> >
>> > I don't think segment trees are a good candidate for standardization. There are multiple different implementation strategies and the choice of implementation strategy affects performance in a meaningful way.
>>
>> Which part of that is not solvable by specifying complexity guarantees?
>
>
> If you're using this data structure, you probably care about the constant factor on the complexity of the number of operations, and you might even care about the number of cache misses.

The first of which can most certainly be specified by a standard, and
the second, well, you have three implementation vendors to whom to
explain
what you mean by that.

Not that I'm advocating for segment trees, or any random tree from a
random problem domain.