1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
package com.c2kernel.utils;
import java.lang.ref.*;
import java.util.*;
/**************************************************************************
* TransientCache - Uses transient references to allow unused entries to be
* reaped by the java garbage collector.
*
* $Revision: 1.1 $
* $Date: 2004/04/20 09:37:02 $
*
* Copyright (C) 2003 CERN - European Organization for Nuclear Research
* All rights reserved.
**************************************************************************/
public abstract class TransientCache<K, V> extends AbstractMap<K, V> {
private Map<K, Reference<V>> map = new Hashtable<K, Reference<V>>();
public synchronized Set<Entry<K, V>> entrySet() {
Map<K, V> newMap = new Hashtable<K,V>();
Iterator<Entry<K, Reference<V>>> iter = map.entrySet().iterator();
while (iter.hasNext()) {
Entry<K, Reference<V>> me = iter.next();
Reference<V> ref = me.getValue();
V o = ref.get();
if (o == null) {
// Delete cleared reference
iter.remove();
} else {
// Copy out interior object
newMap.put(me.getKey(), o);
}
}
// Return set of interior objects
return newMap.entrySet();
}
public synchronized V put(K key, V value) {
Reference<V> ref = makeReference(value);
ref = (Reference<V>)map.put(key, ref);
if (ref != null)
return (ref.get());
return null;
}
public abstract Reference<V> makeReference(Object value);
public V remove(Object key) {
Iterator<Entry<K, Reference<V>>> i = map.entrySet().iterator();
Entry<K, Reference<V>> correctEntry = null;
if (key == null) {
while (correctEntry == null && i.hasNext()) {
Entry<K, Reference<V>> e = i.next();
if (e.getKey() == null)
correctEntry = e;
}
} else {
while (correctEntry == null && i.hasNext()) {
Entry<K, Reference<V>> e = i.next();
if (key.equals(e.getKey()))
correctEntry = e;
}
}
V oldValue = null;
if (correctEntry != null) {
Reference<V> correctReference = correctEntry.getValue();
oldValue = correctReference.get();
i.remove();
}
return oldValue;
}
/**
*
*/
public void clear() {
map.entrySet().clear();
}
private transient Set<K> keySet = null;
public Set<K> keySet() {
if (keySet == null) {
keySet = new AbstractSet<K>() {
public Iterator<K> iterator() {
return new Iterator<K>() {
private Iterator<Entry<K, Reference<V>>> i = map.entrySet().iterator();
public boolean hasNext() {
return i.hasNext();
}
public K next() {
return i.next().getKey();
}
public void remove() {
i.remove();
}
};
}
public int size() {
return TransientCache.this.size();
}
public boolean contains(Object k) {
return TransientCache.this.containsKey(k);
}
};
}
return keySet;
}
}
|
