I
data structures.
I especially love learning about real world use cases of data structures.
What’s your favorite data structure (bonus if it’s something you’ve coded in real life to solve a fun problem). 
-
-
Replying to @copyconstruct
Probably a level-compressed suffix trie. It's so versatile. Implemented it a few times for CIDR matching in routing or ACL tables. Then used it for string matching - often faster than a hash table! Reverse a domain and you can use one for efficient SSL or DNS wildcards.
4 replies 4 retweets 68 likes -
Replying to @colmmacc @copyconstruct
I use it sometimes to show that hashes are not O(1) but are O(N) in the space of the input, whereas a trie can be O(log N) ... ala
@hashbreaker. I consider "hashes are O(1)" the CS equivalent of the widely wrong "This is how wings generate lift" meme.5 replies 2 retweets 27 likes -
This Tweet is unavailable.
You can pack a trie like a b-tree for cache efficiency, and pipeline pre-fetching at least has a shot with a tree access. Hashes have no cache locality or predictability But you're right, and it depends on the data set and the problem.
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.