Haaaaa, sooo -- turns out @mafintosh's data structures designed for Dat actually work really well for all sorts of data in arrays! (no surprise)
Messing around with a mempool design, and using a tree index to keep track of internals seems prettty good!https://github.com/datrs/tree-index …
-
Show this thread
-
The idea is that if you have a vec of objects, and want to keep track of whether: A: your pool needs to grow / have space left B: which index to find an unused object at Using a bitmap-tree / tree-index will actually do these things *super fast*.
1 reply 0 retweets 1 likeShow this thread -
Y'all! -- I figured something out that's kind of computer-sciency! Now just need to figure out how to make to make this thread-safe? (and probably lose all performance in the process lmaooo)
1 reply 0 retweets 2 likesShow this thread -
Anyway. I think there's some very interesting unexplored space here.
1 reply 0 retweets 2 likesShow this thread -
Replying to @yoshuawuyts
https://github.com/mafintosh/value-sort … - should be fun to impl in rust
2 replies 1 retweet 1 like -
Oh yeah, for sure. But like in 50 lines! 
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.