@Override public void remove(T obj) { cache.remove(obj) ; }
@Override synchronized public void remove(T obj) { cache.remove(obj) ; }
@Override public void remove(T obj) { cache.remove(obj) ; }
@Override synchronized public void remove(T obj) { cache.remove(obj) ; }
@Override synchronized public void remove(T obj) { cache.remove(obj) ; }
@Override public void remove(T obj) { cache.remove(obj) ; }
/** Update the Node->NodeId caches */ private void cacheUpdate(Node node, NodeId id) { if ( node == null ) return ; // synchronized is further out. // The "notPresent" cache is used to note whether a node // is known not to exist. // This must be specially handled later if the node is added. if ( NodeId.isDoesNotExist(id) ) { if ( notPresent != null ) notPresent.add(node) ; return ; } if ( id == NodeId.NodeIdAny ) { Log.warn(this, "Attempt to cache NodeIdAny - ignored") ; return ; } if ( node2id_Cache != null ) node2id_Cache.put(node, id) ; if ( id2node_Cache != null ) id2node_Cache.put(id, node) ; // Remove if previously marked "not present" if ( notPresent != null && notPresent.contains(node) ) notPresent.remove(node) ; } // ----
/** Update the Node->NodeId caches */ private void cacheUpdate(Node node, NodeId id) { if ( node == null ) return ; // synchronized is further out. // The "notPresent" cache is used to note whether a node // is known not to exist. // This must be specially handled later if the node is added. if ( NodeId.isDoesNotExist(id) ) { if ( notPresent != null ) notPresent.add(node) ; return ; } if ( id == NodeId.NodeIdAny ) { Log.warn(this, "Attempt to cache NodeIdAny - ignored") ; return ; } if ( node2id_Cache != null ) node2id_Cache.put(node, id) ; if ( id2node_Cache != null ) id2node_Cache.put(id, node) ; // Remove if previously marked "not present" if ( notPresent != null && notPresent.contains(node) ) notPresent.remove(node) ; }