What's your favorite data structure and why? inb4 >Depends

>>62244381
Vector of structs

Hashtables/dictionaries

>>62244381
rbtree

>>62244416
Why do you like red/black trees?

quadtrees are pretty neat imo

>>62244381
Any persistent balanced binary tree, treap is simple and fast, they are the fucking best

>>62244545
This

>>62244381

B+ trees because database fag.

skip list

An enum with a string and an integer

>>62244411
this++

>>62244381

Hashed Map/Set always feels nice to use even though I use them too much.

>>62244381
All kinds of trees but I'm into acceleration structures for path tracing so I'd say Bounding Volume Hierarchies

vEB tree

>>62245805

this#

>>62245891
You are an idiot

>>62244381
double ended queues, they solve so many problems with multithreading

Multimap. Comfy af

>>62244381
Merkle DAGs

Dictionaries with dictionaries with dictionaries
Fight me

>>62244381

ring buffer

relational database

xor list
also this >>62246374

Just simple arrays

map

pojos

Intel™ ringbus® :^)

Kademlia routed DHT

quadtree

>>62244381
Hash array mapped trie

File: mods-are-gay.png (52KB, 613x410px) Image search: [Google]

52KB, 613x410px

>>62244381
This thread is going to get deleted fast. Pic related.

>>62244488
>Why do you like red/black trees?
Can implement dictionaries / hashmaps with them with reasonable memory usage to CPU usage trade-off.

>>62246441
xorlists are neat

Doubly linked list, especially on devices with no MMU :^)

Depends on what I'm doing.

>>62247695
>no MMU
Wouldn't that imply a flat address space (aka direct physical memory access)?

Wouldn't that also imply that you can just reserve part of your RAM to your data structure and just calculate offsets, rather than having to dereference a list pointer every time?