Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Rice Pastry API
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## rice.p2p.util
Class TimerWeakHashMap<K,V>

    java.lang.Object
      java.util.AbstractMap<K,V>
          java.util.WeakHashMap<K,V>
              rice.p2p.util.TimerWeakHashMap<K,V>

All Implemented Interfaces:
  java.util.Map<K,V>

    public class TimerWeakHashMap<K,V>

extends java.util.WeakHashMap<K,V>

Weak hash map that holds hard link to keys for a minimum time.

Author:
  Jeff Hoye

Nested Class Summary
`static class` | `TimerWeakHashMap.HardLinkTimerTask`

Constructor Summary
`TimerWeakHashMap(Timer t, int delay)`

Method Summary
`V` | `put(K key, V val)`
`void` | `refresh(java.lang.Object key)`
`void` | `refresh(java.lang.Object key, int delay)`

Methods inherited from class java.util.WeakHashMap
`clear, containsKey, containsValue, entrySet, get, isEmpty, keySet, putAll, remove, size, values`

Methods inherited from class java.util.AbstractMap
`clone, equals, hashCode, toString`

Methods inherited from class java.lang.Object
`finalize, getClass, notify, notifyAll, wait, wait, wait`

Methods inherited from interface java.util.Map
`equals, hashCode`

Constructor Detail

### TimerWeakHashMap

    public TimerWeakHashMap(Timer t,
                            int delay)

Method Detail

### put

    public V put(K key,
                 V val)

  Specified by:
    `put` in interface `java.util.Map<K,V>`
  Overrides:
    `put` in class `java.util.WeakHashMap<K,V>`

### refresh

    public void refresh(java.lang.Object key)

### refresh

    public void refresh(java.lang.Object key,
                        int delay)

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Rice Pastry API
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

Copyright © 2001-2005 - Rice Pastry.