/** Method that allows subclasses (SortedMap) to redefine * order of entries. * @param map the map (Object, Node) * @return collection of (Entry) */ Collection<? extends Entry> createEntries(java.util.Map<T,Node> map) { List<ME> l = new LinkedList<ME>(); for (java.util.Map.Entry<T,Node> e : map.entrySet()) { l.add(new ME(e.getKey(), e.getValue())); } return l; }
/** Method that allows subclasses (SortedMap) to redefine * order of entries. * @param map the map (Object, Node) * @return collection of (Entry) */ @Override Collection<? extends Entry> createEntries(java.util.Map<T,Node> map) { // SME objects use natural ordering Set<ME> l = new TreeSet<ME>(new SMComparator()); for (java.util.Map.Entry<T,Node> e : map.entrySet()) { l.add(new ME(e.getKey(), e.getValue())); } return l; }
/** Method that allows subclasses (SortedMap) to redefine * order of entries. * @param map the map (Object, Node) * @return collection of (Entry) */ Collection createEntries (java.util.Map map) { LinkedList l = new LinkedList (); Iterator it = map.entrySet ().iterator (); while (it.hasNext ()) { java.util.Map.Entry e = (java.util.Map.Entry)it.next (); l.add (new ME ( e.getKey (), (Node)e.getValue () )); } return l; }
/** Method that allows subclasses (SortedMap) to redefine * order of entries. * @param map the map (Object, Node) * @return collection of (Entry) */ Collection createEntries (java.util.Map map) { // SME objects use natural ordering TreeSet l = new TreeSet (new SMComparator ()); Iterator it = map.entrySet ().iterator (); while (it.hasNext ()) { java.util.Map.Entry e = (java.util.Map.Entry)it.next (); l.add (new ME ( e.getKey (), (Node)e.getValue () )); } return l; }
/** Method that allows subclasses (SortedMap) to redefine * order of entries. * @param map the map (Object, Node) * @return collection of (Entry) */ Collection createEntries (java.util.Map map) { // SME objects use natural ordering TreeSet l = new TreeSet (new SMComparator ()); Iterator it = map.entrySet ().iterator (); while (it.hasNext ()) { java.util.Map.Entry e = (java.util.Map.Entry)it.next (); l.add (new ME ( e.getKey (), (Node)e.getValue () )); } return l; }
/** Method that allows subclasses (SortedMap) to redefine * order of entries. * @param map the map (Object, Node) * @return collection of (Entry) */ Collection createEntries (java.util.Map map) { LinkedList l = new LinkedList (); Iterator it = map.entrySet ().iterator (); while (it.hasNext ()) { java.util.Map.Entry e = (java.util.Map.Entry)it.next (); l.add (new ME ( e.getKey (), (Node)e.getValue () )); } return l; }
/** Allows subclasses that directly modifies the * map with nodes to synchronize the state of the children. * This method should be called under * MUTEX.writeAccess. * * @param key the key that should be refreshed */ final void refreshKeyImpl (Object key) { this.refreshEntry (new ME (key, null)); }
/** Allows subclasses that directly modifies the * map with nodes to synchronize the state of the children. * This method should be called under * MUTEX.writeAccess. * * @param key the key that should be refreshed */ final void refreshKeyImpl (Object key) { this.refreshEntry (new ME (key, null)); }
/** Allows subclasses that directly modifies the * map with nodes to synchronize the state of the children. * This method should be called under * MUTEX.writeAccess. * * @param key the key that should be refreshed */ final void refreshKeyImpl(T key) { entrySupport().refreshEntry(new ME(key, null)); }