-
*
- Extend this class and implement a constructor/instantiator that accepts a MultiCacheManager and a group name. *
- Implement the {@link #send send} method. *
- Have your communications layer call {@link #receive receive} upon receipt of a cache notification. *
null, then any object cached at the given key is removed from the cache.
*/
public void put(Serializable key,
Object object) {
if (object == null) {
clear(key);
} else {
TStampObject tobj = new TStampObject();
tobj.object = object;
tobj.time = System.currentTimeMillis() + timeout;
cache.put(key, tobj);
setDeadline(tobj.time);
log.debug("Put " + type + " #" + key + " in to cache.");
}
}
public Object get(Serializable key) {
TStampObject tobj = (TStampObject) cache.get(key);
if (tobj != null) {
log.debug("Got " + type + " #" + key + " from cache.");
tobj.time = System.currentTimeMillis() + timeout;
return tobj.object;
} else {
return null;
}
}
public Object clear(Serializable key) {
log.debug("Cleared " + type + " #" + key + " from cache.");
return cache.remove(key);
}
public void clearAll() {
log.debug("Cleared entire " + type + " cache.");
cache.clear();
}
//// Timer methods
private synchronized void setDeadline(long time) {
if (time < deadline) {
deadline = time;
notify();
}
}
public void run() {
while (running) {
try {
synchronized (this) {
long now = System.currentTimeMillis();
long waitTime = deadline - now;
if (waitTime > 0) {
wait(waitTime);
}
}
} catch (Exception e) {
log.error(e);
}
trimQueue();
}
}
private void trimQueue() {
log.debug("Waking up.");
Object key = cache.getFirstKey();
TStampObject tobj = (TStampObject) cache.get(key);
if (tobj != null) {
long now = System.currentTimeMillis();
while ((tobj != null) && (tobj.time <= now)) {
cache.remove(key);
log.debug("Timed out object with key '" + key + "'.");
key = cache.getFirstKey();
tobj = (TStampObject) cache.get(key);
}
}
if (tobj != null) {
deadline = tobj.time;
} else {
deadline = Long.MAX_VALUE;
}
log.debug("Sleeping.");
}
} libswarmcache-java-1.0RC2+cvs20071027.orig/src/net/sf/swarmcache/UnboundedLRUMap.java 0000644 0001750 0001750 00000006206 07772352316 027644 0 ustar twerner twerner package net.sf.swarmcache;
import java.util.*;
import org.apache.commons.collections.LRUMap;
import java.io.*;
import org.apache.commons.logging.*;
/**
* An LRUMap that allows an unbounded size.
* This implementation is an amortized O(1) amount slower than the bounded Jakarta Commons LRUMap implementation.
*
* @author John Watkinson
*/
public class UnboundedLRUMap implements Map {
Log log = LogFactory.getLog(this.getClass());
public static final int MINIMUM_SIZE = 100;
private LRUMap map;
int size = MINIMUM_SIZE;
public UnboundedLRUMap() {
map = new LRUMap(size);
}
public void clear() {
// Shrink the map down to minimum size
if (size > MINIMUM_SIZE) {
map = new LRUMap(MINIMUM_SIZE);
size = MINIMUM_SIZE;
} else {
map.clear();
}
}
public boolean containsKey(Object key) {
return map.containsKey(key);
}
public boolean containsValue(Object value) {
return map.containsValue(value);
}
public Set entrySet() {
return map.entrySet();
}
public boolean equals(Object obj) {
return map.equals(((UnboundedLRUMap) obj).map);
}
public int hashCode() {
return map.hashCode();
}
public Object get(Object key) {
return map.get(key);
}
public boolean isEmpty() {
return map.isEmpty();
}
public Set keySet() {
return map.keySet();
}
public Object put(Object key, Object value) {
// See if the "put" is actually a remove
if (value == null) {
if (map.get(key) != null) {
// See if we are using less than %25 of the map
if ((map.size() == size / 4) && (size > MINIMUM_SIZE)) {
// Shrink the map
size = size / 2;
log.debug("Map capacity has shrunk to " + size + ", size is " + (map.size() - 1) + ".");
LRUMap newMap = new LRUMap(size);
newMap.putAll(map);
map = newMap;
}
return map.put(key, value);
} else {
// Nothing to add
return null;
}
}
// Check to see if it will be a replace
if (map.get(key) != null) {
// Just do the replace
return map.put(key, value);
} else {
// Check and see if we have overflowed this map
if (map.size() == size) {
// Make a new map of double size
size = size * 2;
log.debug("Map capacity has grown to " + size + ", size is " + (map.size() + 1) + ".");
LRUMap newMap = new LRUMap(size);
newMap.putAll(map);
map = newMap;
}
return map.put(key, value);
}
}
public void putAll(Map t) {
Iterator keys = t.keySet().iterator();
while (keys.hasNext()) {
Object key = keys.next();
put(key, t.get(key));
}
}
public Object remove(Object key) {
if (map.get(key) != null) {
// Check to see if we have less than %25 utilization
if ((map.size() == size / 4) && (size > MINIMUM_SIZE)) {
// Shrink the map
size = size / 2;
log.debug("Map capacity has shrunk to " + size + ", size is " + (map.size() - 1) + ".");
LRUMap newMap = new LRUMap(size);
newMap.putAll(map);
map = newMap;
}
return map.remove(key);
} else {
// Nothing to remove
return null;
}
}
public int size() {
return map.size();
}
public Collection values() {
return map.values();
}
public Object getFirstKey() {
return map.getFirstKey();
}
} libswarmcache-java-1.0RC2+cvs20071027.orig/src/swarmcache.properties.SAMPLE 0000644 0001750 0001750 00000000267 07737043501 025730 0 ustar twerner twerner # The Multicast IP address that SwarmCache will use for communication
swarmcache.multicast.ip=231.12.21.132
# The maximum number of objects in the LRU cache
swarmcache.lru.size=10000
libswarmcache-java-1.0RC2+cvs20071027.orig/web/ 0000755 0001750 0001750 00000000000 10711726365 020500 5 ustar twerner twerner libswarmcache-java-1.0RC2+cvs20071027.orig/web/img/ 0000755 0001750 0001750 00000000000 10711726365 021254 5 ustar twerner twerner libswarmcache-java-1.0RC2+cvs20071027.orig/web/img/swarm.jpg 0000644 0001750 0001750 00000015023 07746407423 023115 0 ustar twerner twerner JFIF d d Ducky < Adobe d
d d !1A"Q2aqB#Rb3$CS4% !1A"Q2aqBRbr3 ? |us1Z-EVuuh55/IeJD-yM ґW1G D}(뼖sJX|+,Mh5!ꆥ^bwaKTyn2R ulԸF%Kķ-@ L,,&{i\ ^җ9D_]+""RO\ HYKj*n4MK-zt=Hx}W./'#@m6"={iT~>4QʀbyK
K\VDƶ^ ATFUi[~dJ 2RIj͊"37:E+Un$T^v0 Reѣ&Ӯï mU-5Ē_Օ3 |~! AjUd^DГîC'2lYķq;(ER]w jGqy'ۧq/g]L+5QPc l84,
"m꺸eu kxRuMWP
#DBZy4rQaĄSa n] VSQ=]VvpDòvp_NN:H384E3#e\,9+APEh]ҕJt%
!- [Mk0p|Vo$j#-Abj?DSW¶Y9F81<J1rLEj
ȩQDS!T"뉔̌m
(*[ҥUӡK̜G8hl(csuWĖ =T][剋蔾)qr"Gơ_K.qTꆔ[ 5 KqB;q:.QU.z
9&=C exI[RB $20nG&:aNo mPתx} @eR1 51½DbjˎT$]=*$B3=7@MȪHc֊KK F1$__pyi8t N">/JN \$ROqP3*E7
J9e6Q ZL>5]n- 9I@}ouٿzw)mR3 Kv\q8^"
G\BکQŧ)U5ن,"P@[aհKY]'jhs"Q$9/r0&cq=
*j=Ij # # C-ĕ)y6@S3[Q5ټw;o uj~zTH 7||u $nS&\%CvTvDd" I'OZ#O:0.Ql ے#_E)KFWUte?%RK'c5ucP:8@oprNb x9 6J[au&|R"YIAqi ct UUGD:EZ4Z(E)hSux q&ƭJzS\RUXԦ /@.1!"7.!U+ n
H/ Y-g9Vw$ c3KUT/Gc"{
bٺvH{.6{?Nlv4gν)Kܾ˹A)#OݽڽݭSpkOm.^,Y_EoMh..uҺ ݴD:x F{ /qD -*jeaEgr EӮGي
 |
|
||||||||||||||||
|
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||||||||||||||||||||||
|
|
||||||||||||||||
|
|