"genman" wrote :
| 1. Have Node.removeChild() return true if the node was removed
|
Need to think about how big an impact this will have on the interceptor chain since this
calls remove(Fqn).
"genman" wrote :
| 2. Add a Node.size() or Node.dataSize() to count basically getData().size(). The
problem (in terms of efficiency) is that getData() makes a copy.
| 3. Node.putIfAbsent() should be consistent with ConcurrentMap, and return Object.
Consider adding other methods of ConcurrentMap.
| 4. Change Node.put to Node.putAll to be consistent with Map.putAll().
|
Makes sense. I've added the APIs and basic impl's, which we can revise/refactor
over time.
"genman" wrote :
| I'm working on a Node -> Map adaptor, sort of a poor man's PojoCache, and
find these basic methods missing.
An interesting idea; I'd like to see a separate thread on this though so we can
discuss
View the original post :
http://www.jboss.com/index.html?module=bb&op=viewtopic&p=4003733#...
Reply to the post :
http://www.jboss.com/index.html?module=bb&op=posting&mode=reply&a...