title: Modern data structures
body: <p>I just realized all the data structures I regularly use are really old and really simple. Linked lists, hash tables, trees, and even the more complex variants such as VLists or RBTrees are all pretty old inventions.</p>
  
  <p>Most of them were conceived for a serial, single CPU world and require adapting to work in parallel environments.</p>
  
  <p>What kind of newer, better data structures do we have? Why are they not widely used?</p>
  
  <p>I understand using a plain old linked list if you have to <em>implement</em> it and prefer the simplicity, but having huge STLs and piles of third party libraries like <em>Guava</em> or <em>Boost</em>, why am I still placing locks around hashes?</p>
  
  <p>Don't we have potentially standard, hard-proven modern data structures that can actually <em>replace</em> the trusty old-timers?</p>