Paolo Redaelli5 strutture dati strane (ma utili) nell’informatica (“5 Strange (but useful) Data Structures in Computer Science”).
Let’s look at five weird data structures that will help you when the arrays and hashmaps of this world aren’t enough.
- B-Tree Self-Balancing. We do have AVL-Trees which are self-balancing but are all-in-memory trees.
- Radix tree
- Rope, yes, we definitively have them
- Bloom filter (also explained here)
- Cuckoo hashing
Do we have it in Liberty Eiffel? ROPE is part of the standard library. The other are “futura agenda”, i.e. “things that must be done in the future”, at least when speaking of LibertyEiffel