What is the closest to ConcurrentHashMap and NavigableMap in Java?

TheFlyingFiddle theflyingfiddle at gmail.com
Thu Nov 14 10:28:45 PST 2013


On Thursday, 14 November 2013 at 18:08:22 UTC, Jacek 
Furmankiewicz wrote:
> So how do existing D applications (especially the high perf 
> ones in let's say the financial sector) deal with having some 
> part of the data in memory and keeping it in sync with the DB 
> source?

Good question. I have no idea.

> is there a different idiom or approach in D?

Well in D the prefered way (or recommended according to TDPL) to 
do concurrent sharing of resources is to share resources via 
message passing.

So in this case a single thread would be responsible for the 
caching of data in memory and other threads would ask this thread 
for data through message passing.

If this way is faster/better then javas ConcurrentHashMap i am 
not sure.





More information about the Digitalmars-d-learn mailing list