Per Vognsen@pervognsen@mastodon.social
@pkhuong@discuss.systems Hey Paul (or anyone else), what's the standard CS name for the (stable, non-reallocating) dynamic array data structure based on power-of-two segment lengths where you do two-level indexing via x = ilog2(i), y = i - (1 << x) where i is a 1-based linear index? I've always called it an exponentially segmented array but never been able to find the earliest reference in the literature or what the canonical name for it is; it feels basic enough that it should be in Knuth.
