undefined | Better HN

0 pointskfrzcode1y ago0 comments

Could you separate out the data structure, i.e. keep your BTreeMap<u32, u32> for intervals, but add a Vec<u32> for available slots. Update both on insert/remove, then for range queries use the Vec<u32>?

Sorry if this is dumb I'm a> not a rustian and b> not really a computer scientist lol

0 comments

1 comments · 1 top-level

grovesNL1y ago

Definitely possible! I tried doing something similar which stored the ranges in a single `Vec<(u32, u32)>` but found the performance a bit worse than just using the ordered map.

j / k navigate · click thread line to collapse