|
68
|
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.servlet;
|
|
|
24
|
|
|
25 import java.util.Map;
|
|
|
26 import java.util.Collections;
|
|
|
27 import fschmidt.db.util.WeakCacheMap;
|
|
|
28
|
|
|
29
|
|
|
30 public final class MemCache implements HttpCache {
|
|
|
31 private final HttpCache cache;
|
|
|
32 private final Map<String,Long> map = Collections.synchronizedMap(new WeakCacheMap<String,Long>());
|
|
|
33
|
|
|
34 public MemCache(HttpCache cache) {
|
|
|
35 this.cache = cache;
|
|
|
36 }
|
|
|
37
|
|
|
38 public long[] lastModifieds(String[] modifyingEvents) {
|
|
|
39 long[] rtn = new long[modifyingEvents.length];
|
|
|
40 int[] missed = new int[modifyingEvents.length];
|
|
|
41 int nMissed = 0;
|
|
|
42 for( int i=0; i<modifyingEvents.length; i++ ) {
|
|
|
43 Object modifyingEvent = modifyingEvents[i];
|
|
|
44 Long r = map.get(modifyingEvent);
|
|
|
45 if( r!=null ) {
|
|
|
46 rtn[i] = r.longValue();
|
|
|
47 } else {
|
|
|
48 missed[nMissed++] = i;
|
|
|
49 }
|
|
|
50 }
|
|
|
51 if( nMissed > 0 ) {
|
|
|
52 String[] aS = new String[nMissed];
|
|
|
53 for( int i=0; i<nMissed; i++ ) {
|
|
|
54 aS[i] = modifyingEvents[missed[i]];
|
|
|
55 }
|
|
|
56 long[] aL = cache.lastModifieds(aS);
|
|
|
57 for( int i=0; i<nMissed; i++ ) {
|
|
|
58 int iMissed = missed[i];
|
|
|
59 long lastModified = aL[i];
|
|
|
60 rtn[iMissed] = lastModified;
|
|
|
61 map.put(modifyingEvents[iMissed],new Long(lastModified));
|
|
|
62 }
|
|
|
63 }
|
|
|
64 return rtn;
|
|
|
65 }
|
|
|
66
|
|
|
67 public void modified(String modifyingEvent) {
|
|
|
68 cache.modified(modifyingEvent);
|
|
|
69 map.remove(modifyingEvent);
|
|
|
70 }
|
|
|
71
|
|
|
72 public void clear() {
|
|
|
73 cache.clear();
|
|
|
74 map.clear();
|
|
|
75 }
|
|
|
76
|
|
|
77 }
|
