There used to be a TreeCache.putData(Map m, boolean erase) operation at some point which I thought was optimized, but in reality there's only put(Map) and put(K, V) type operations that do merges.
I'm trying to simply store a bunch of associations which should overwrite any existing data, and I'm getting bad performance, since every put() operation forces a read. Even the "clearData" operation forces a read. Any hints?
There is a Node.replaceAll but requires loading the node first. I'd like to see Cache.replaceAll() operation at some point.