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.
33 import java.util.ArrayList;
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) {
54 if (_counter >= _max) {
58 System.out.println("put: remove " + _counter);
61 _cache.add(new Entry(key, value));
63 System.out.println("put: put " + _counter);
66 public synchronized void clear() {
70 public int containsKey(String key) {
71 for (int i = 0; i < _cache.size(); i++) {
72 if ((_cache.get(i) != null) &&
73 ((Entry) _cache.get(i)).getKey().equals(key)) {
81 public int containsValue(Object o) {
82 for (int i = 0; i < _cache.size(); i++) {
83 if ((_cache.get(i) != null) &&
84 ((Entry) _cache.get(i)).getValue().equals(o)) {
92 public Object get(String key) {
93 for (int i = 0; i < _cache.size(); i++) {
94 if ((_cache.get(i) != null) &&
95 (((Entry) _cache.get(i)).getKey(key) != null) &&
96 ((Entry) _cache.get(i)).getKey(key).equals(key)) {
97 System.out.println("test2: " + ((Entry) _cache.get(i)).getKey(key));
99 return ((Entry) _cache.get(i)).getValue();
106 public synchronized boolean remove(String key) {
107 int i = containsKey(key);
124 private class Entry {
126 private Object _value;
128 public Entry(String i_key, Object i_value) {
133 public void put(String i_key, Object i_value) {
138 public Object getValue(String i_key) {
139 if (i_key.equals(_key)) {
146 public Object getValue() {
150 public String getKey(Object i_o) {
151 if (i_o.equals(_value)) {
158 public String getKey() {