public void shutdown() { Enumeration<Server> servers = serverMap.values(); while (servers.hasMoreElements()) { Server server = servers.nextElement(); server.close(); } serverMap.clear(); }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }
public void shutdown() { Enumeration<Server> servers = serverMap.values(); while (servers.hasMoreElements()) { Server server = servers.nextElement(); server.close(); } serverMap.clear(); }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }
public synchronized void sort(Comparator<LinkedEntry<K,V>> c) { ArrayList<LinkedEntry<K,V>> list = new ArrayList<LinkedEntry<K,V>>(this.size()); Enumeration<LinkedEntry<K,V>> en = this.entries(); while (en.hasMoreElements()) { LinkedEntry<K,V> n=en.nextElement(); if(n!=null){ list.add(n); } } Collections.sort(list, c); this.clear(); for (int i = 0; i < list.size(); i++) { LinkedEntry<K,V> e = list.get(i); this.put(e.getKey(), e.getValue()); } } }