2 * Copyright (C) 2001, 2002 The Mir-coders group
4 * This file is part of Mir.
6 * Mir is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * Mir is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with Mir; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 * In addition, as a special exception, The Mir-coders gives permission to link
21 * the code of this program with the com.oreilly.servlet library, any library
22 * licensed under the Apache Software License, The Sun (tm) Java Advanced
23 * Imaging library (JAI), The Sun JIMI library (or with modified versions of
24 * the above that use the same license as the above), and distribute linked
25 * combinations including the two. You must obey the GNU General Public
26 * License in all respects for all of the code used other than the above
27 * mentioned libraries. If you modify this file, you may extend this exception
28 * to your version of the file, but you are not obligated to do so. If you do
29 * not wish to do so, delete this exception statement from your version.
36 public class DatabaseCache {
37 private final ArrayList _cache;
39 private final int _max;
41 public DatabaseCache(int i_max){
44 _cache = new ArrayList(_max);
47 public DatabaseCache(){
50 _cache = new ArrayList(_max);
53 public synchronized void put(String key, Object value){
58 System.out.println("put: remove " + _counter);
60 _cache.add(new Entry(key,value));
62 System.out.println("put: put " + _counter);
65 public synchronized void clear(){
69 public int containsKey(String key){
70 for(int i = 0; i<_cache.size(); i++){
71 if( _cache.get(i)!=null && ((Entry)_cache.get(i)).getKey().equals(key) )
77 public int containsValue(Object o){
78 for(int i = 0; i<_cache.size(); i++){
79 if( _cache.get(i)!=null && ((Entry)_cache.get(i)).getValue().equals(o) )
85 public Object get(String key){
86 for(int i = 0; i<_cache.size(); i++){
87 if( _cache.get(i) != null &&
88 ((Entry)_cache.get(i)).getKey(key) != null &&
89 ((Entry)_cache.get(i)).getKey(key).equals(key) ) {
90 System.out.println("test2: "+((Entry)_cache.get(i)).getKey(key));
91 return ((Entry)_cache.get(i)).getValue();
97 public synchronized boolean remove(String key){
98 int i = containsKey(key);
112 private class Entry {
114 private Object _value;
116 public Entry(String i_key, Object i_value){
121 public void put(String i_key, Object i_value){
126 public Object getValue(String i_key){
127 if(i_key.equals(_key)){
134 public Object getValue(){
138 public String getKey(Object i_o){
139 if(i_o.equals(_value)){
146 public String getKey(){