Joel Dice c0d178d5f1 implement ConcurrentHashMap and AtomicReferenceArray
This is the simplest possible ConcurrentHashMap I could come up with
that works and is actually concurrent in the way one would expect.
It's pretty unconventional, being based on a persistent red-black
tree, and not particularly memory-efficient or cache-friendly.  I
think this is a good place to start, though, and it should perform
reasonably well for most workloads.  Patches for a more efficient
implementation are welcome!

I also implemented AtomicReferenceArray, since I was using it in my
first, naive attempt to implement ConcurrentHashMap.

I had to do a bit of refactoring, including moving some non-standard
stuff from java.util.Collections to avian.Data so I could make it
available to code outside the java.util package, which is why I had to
modify several unrelated files.
2014-03-12 10:44:24 -06:00
..
2013-07-05 14:36:16 -06:00
2014-02-25 21:33:08 -07:00
2012-06-06 12:58:24 -06:00
2014-02-25 20:34:03 -07:00
2014-02-25 20:34:03 -07:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-03-04 11:09:59 -07:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2014-03-10 08:51:00 -06:00
2011-02-26 12:45:22 -07:00
2013-07-02 20:52:38 -06:00
2013-07-02 20:52:38 -06:00
2013-11-06 09:07:58 -06:00
2013-07-02 20:52:38 -06:00
2013-07-28 10:39:55 -03:00