private V getValue(ENTRY<K, V> e) { if (e == null) return null; if (e.isExpired()) { remove(e.key); return null; } return e.value; }
public synchronized V removeFirst() { if (isEmpty()) return null; return remove(header.link_next.key); }
private V getValue(ENTRY<K, V> e) { if (e == null) return null; if (e.isExpired()) { remove(e.key); return null; } return e.value; }
public synchronized V removeFirst() { if (isEmpty()) return null; return remove(header.link_next.key); }
private V getValue(ENTRY<K, V> e) { if (e == null) return null; if (e.isExpired()) { remove(e.key); return null; } return e.value; }
public synchronized V removeLast() { if (isEmpty()) return null; return remove(header.link_prev.key); }
public synchronized V removeFirst() { if (isEmpty()) return null; return remove(header.link_next.key); }
public synchronized V removeFirst() { if (isEmpty()) return null; return remove(header.link_next.key); }
private V getValue(ENTRY<K, V> e) { if (e == null) return null; if (e.isExpired()) { remove(e.key); return null; } return e.value; }
public synchronized V removeLast() { if (isEmpty()) return null; return remove(header.link_prev.key); }
public synchronized V removeFirst() { if (isEmpty()) return null; return remove(header.link_next.key); }
public synchronized V removeLast() { if (isEmpty()) return null; return remove(header.link_prev.key); }
public synchronized V removeLast() { if (isEmpty()) return null; return remove(header.link_prev.key); }
private V getValue(ENTRY<K, V> e) { if (e == null) return null; if (e.isExpired()) { remove(e.key); return null; } return e.value; }
public synchronized V removeLast() { if (isEmpty()) return null; return remove(header.link_prev.key); }
public void close(String date) { try { Enumeration<BKey> en = readCache.keys(); while (en.hasMoreElements()) { BKey k = en.nextElement(); if (date.equals(k.date)) { readCache.remove(k); } } } catch (Throwable t) { t.printStackTrace(); } } }
public void clearExpiredItems() { try { ArrayList<K> delete = new ArrayList<K>(); Enumeration<CacheTable.ENTRY<K, V>> en = this.entries(); while (en.hasMoreElements()) { ENTRY e = en.nextElement(); if (e.isExpired()) { delete.add((K) e.getKey()); } } for (int i = 0; i < delete.size(); i++) { remove(delete.get(i)); } } catch (Throwable t) { t.printStackTrace(); } }
public void clearExpiredItems() { try { ArrayList<K> delete = new ArrayList<K>(); Enumeration<CacheTable.ENTRY<K, V>> en = this.entries(); while (en.hasMoreElements()) { ENTRY e = en.nextElement(); if (e.isExpired()) { delete.add((K) e.getKey()); } } for (int i = 0; i < delete.size(); i++) { remove(delete.get(i)); } } catch (Throwable t) { t.printStackTrace(); } }
private ENTRY<K, V> getEntry(K key) { if (key == null) return null; ENTRY<K, V> tab[] = table; int index = hash(key) % tab.length; for (ENTRY<K, V> e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { if (e.isExpired()) { remove(e.getKey()); return null; } else { return e; } } } return null; }
private ENTRY<K, V> getEntry(K key) { if (key == null) return null; ENTRY<K, V> tab[] = table; int index = hash(key) % tab.length; for (ENTRY<K, V> e = tab[index]; e != null; e = e.next) { if (CompareUtil.equals(e.key, key)) { if (e.isExpired()) { remove(e.getKey()); return null; } else { return e; } } } return null; }