Mercurial Hosting > nabble
comparison src/fschmidt/util/java/TimedCacheMap.java @ 68:00520880ad02
add fschmidt source
| author | Franklin Schmidt <fschmidt@gmail.com> |
|---|---|
| date | Sun, 05 Oct 2025 17:24:15 -0600 |
| parents | |
| children |
comparison
equal
deleted
inserted
replaced
| 67:9d0fefce6985 | 68:00520880ad02 |
|---|---|
| 1 /* | |
| 2 Copyright (c) 2008 Franklin Schmidt <fschmidt@gmail.com> | |
| 3 | |
| 4 Permission is hereby granted, free of charge, to any person obtaining a copy | |
| 5 of this software and associated documentation files (the "Software"), to deal | |
| 6 in the Software without restriction, including without limitation the rights | |
| 7 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
| 8 copies of the Software, and to permit persons to whom the Software is | |
| 9 furnished to do so, subject to the following conditions: | |
| 10 | |
| 11 The above copyright notice and this permission notice shall be included in | |
| 12 all copies or substantial portions of the Software. | |
| 13 | |
| 14 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | |
| 15 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | |
| 16 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | |
| 17 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
| 18 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | |
| 19 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN | |
| 20 THE SOFTWARE. | |
| 21 */ | |
| 22 | |
| 23 package fschmidt.util.java; | |
| 24 | |
| 25 import java.util.Map; | |
| 26 import java.util.LinkedHashMap; | |
| 27 import java.util.Iterator; | |
| 28 import fschmidt.db.util.WeakCacheMap; | |
| 29 | |
| 30 | |
| 31 public class TimedCacheMap<K,V> extends WeakCacheMap<K,V> { | |
| 32 | |
| 33 private static class IdentityRef { | |
| 34 private final Object obj; | |
| 35 | |
| 36 IdentityRef(Object obj) { | |
| 37 this.obj = obj; | |
| 38 } | |
| 39 | |
| 40 public int hashCode() { | |
| 41 return System.identityHashCode(obj); | |
| 42 } | |
| 43 | |
| 44 public boolean equals(Object obj) { | |
| 45 return obj instanceof IdentityRef | |
| 46 && obj==((IdentityRef)obj).obj; | |
| 47 } | |
| 48 } | |
| 49 | |
| 50 private final long timeLimit; | |
| 51 private final Map<IdentityRef,Long> vals = new LinkedHashMap<IdentityRef,Long>(); | |
| 52 | |
| 53 public TimedCacheMap(long timeLimit) { | |
| 54 this.timeLimit = timeLimit; | |
| 55 } | |
| 56 | |
| 57 private void add(V value,long now) { | |
| 58 if( value==null ) | |
| 59 return; | |
| 60 IdentityRef ref = new IdentityRef(value); | |
| 61 vals.remove(ref); | |
| 62 vals.put( ref, now + timeLimit ); | |
| 63 } | |
| 64 | |
| 65 private void sweep(long now) { | |
| 66 for( Iterator<Long> i = vals.values().iterator(); i.hasNext(); ) { | |
| 67 long time = i.next(); | |
| 68 if( time > now ) | |
| 69 return; | |
| 70 i.remove(); | |
| 71 } | |
| 72 } | |
| 73 | |
| 74 public V put(K key, V value) { | |
| 75 long now = System.currentTimeMillis(); | |
| 76 sweep(now); | |
| 77 add(value,now); | |
| 78 return super.put(key,value); | |
| 79 } | |
| 80 | |
| 81 public V get(Object key) { | |
| 82 long now = System.currentTimeMillis(); | |
| 83 V value = super.get(key); | |
| 84 add(value,now); | |
| 85 return value; | |
| 86 } | |
| 87 } |
