4 ms·
Is anyone else surprised at the straightforward collections implementations? From reading this site (and leetcode interviews) I expected to find advanced data s
by CurriedLambda 3y ago
Is anyone else surprised at the straightforward collections implementations? From reading this site (and leetcode interviews) I expected to find advanced data structures under the hood. This is not a negative comment, I'm pro Mojo, just wondering who the heck is using the fancy stuff we get quizzed on in interviews if not stdlib devs.
- vineyardmike 3y agoThey're used only as needed. Which is to say, rarely. Eg. A database might store its index in a B-Tree, or other "similar" data structure. For example, you can see RocksDB using "fancy" structure to store its data [0]. [0] https://github.com/facebook/rocksdb https://github.com/facebook/rocksdb