News for hackers. Stuff that matters.

A comment on Using Rust to Scale Elixir for 11M Concurrent Users (2019). Parent comment

Re:Using Rust to Scale Elixir for 11M Concurrent Users (2019) by jhgg on Tuesday November 10, 2020 @09:38PM (#25054954)
We needed to support arbitrary index access into the sorted set - which is why stdlib btree map doesn't work.
[ Parent | on HN ]
Re:Using Rust to Scale Elixir for 11M Concurrent Users (2019) by c0deb0t on Tuesday November 10, 2020 @09:54PM (#25055040)
For binary trees, indexing can be done by saving the subtree size of each node and doing a sort of binary search. Not sure if this is fast for B-trees that have more than 2 children nodes, though.
[ Parent | on HN ]
Re:Using Rust to Scale Elixir for 11M Concurrent Users (2019) by Lichtso on Wednesday November 11, 2020 @12:50AM (#25055857)
Do you mean OSTs?

https://en.wikipedia.org/wiki/Order_statistic_tree

[ Parent | on HN ]
Re:Using Rust to Scale Elixir for 11M Concurrent Users (2019) by ntonozzi on Wednesday November 11, 2020 @12:57PM (#25060832)
Oh, that makes sense. I like the solution you arrived at!
[ Parent | on HN ]