The common solution is to hold size of subtree in the nodes in addition to the v... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		kilotaras on May 18, 2019 \| parent \| context \| favorite \| on: Using Rust to Scale Elixir for 11M Concurrent User... The common solution is to hold size of subtree in the nodes in addition to the value a.k.a treap with implicit keys.

pornel on May 18, 2019 | [–]

But at this point you're adding even more bookkeeping and implementation complexity just to use a data structure that's not ideal in the first place (for performance, sequential memory layout is better than chasing pointers).

foobarqwertz on May 18, 2019 | [–]

I propose a challenge: Provide the interface for the datastructure and the test tool.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact