mirror of
https://github.com/corda/corda.git
synced 2025-01-06 05:04:20 +00:00
c0d178d5f1
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. |
||
|---|---|---|
| .. | ||
| avian | ||
| java | ||
| sun | ||
| java-io.cpp | ||
| java-lang.cpp | ||
| java-net.cpp | ||
| java-nio.cpp | ||
| java-util-zip.cpp | ||
| java-util.cpp | ||
| jni-util.h | ||
| sockets.cpp | ||
| sockets.h | ||