From 0ed2c1124cf1b9e49a2ec1fa0126a8df09f9e758 Mon Sep 17 00:00:00 2001
From: Andrew Branson <andrew.branson@cern.ch>
Date: Tue, 7 Oct 2014 09:18:11 +0200
Subject: Repackage to org.cristalise

---
 .../java/com/c2kernel/utils/TransientCache.java    | 149 ---------------------
 1 file changed, 149 deletions(-)
 delete mode 100644 src/main/java/com/c2kernel/utils/TransientCache.java

(limited to 'src/main/java/com/c2kernel/utils/TransientCache.java')

diff --git a/src/main/java/com/c2kernel/utils/TransientCache.java b/src/main/java/com/c2kernel/utils/TransientCache.java
deleted file mode 100644
index fc5f4de..0000000
--- a/src/main/java/com/c2kernel/utils/TransientCache.java
+++ /dev/null
@@ -1,149 +0,0 @@
-/**
- * This file is part of the CRISTAL-iSE kernel.
- * Copyright (c) 2001-2014 The CRISTAL Consortium. All rights reserved.
- *
- * This library is free software; you can redistribute it and/or modify it
- * under the terms of the GNU Lesser General Public License as published
- * by the Free Software Foundation; either version 3 of the License, or (at
- * your option) any later version.
- *
- * This library is distributed in the hope that it will be useful, but WITHOUT
- * ANY WARRANTY; with out even the implied warranty of MERCHANTABILITY or
- * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
- * License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with this library; if not, write to the Free Software Foundation,
- * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
- *
- * http://www.fsf.org/licensing/licenses/lgpl.html
- */
-package com.c2kernel.utils;
-import java.lang.ref.Reference;
-import java.util.AbstractMap;
-import java.util.AbstractSet;
-import java.util.Hashtable;
-import java.util.Iterator;
-import java.util.Map;
-import java.util.Set;
-/**************************************************************************
- * TransientCache - Uses transient references to allow unused entries to be
- * reaped by the java garbage collector.
- *
- * $Revision: 1.1 $
- * $Date: 2004/04/20 09:37:02 $
- *
- * Copyright (C) 2003 CERN - European Organization for Nuclear Research
- * All rights reserved.
- **************************************************************************/
-public abstract class TransientCache<K, V> extends AbstractMap<K, V> {
-
-    private Map<K, Reference<V>> map = new Hashtable<K, Reference<V>>();
-
-    @Override
-	public synchronized Set<Entry<K, V>> entrySet() {
-        Map<K, V> newMap = new Hashtable<K,V>();
-        Iterator<Entry<K, Reference<V>>> iter = map.entrySet().iterator();
-        while (iter.hasNext()) {
-        	Entry<K, Reference<V>> me = iter.next();
-            Reference<V> ref = me.getValue();
-            V o = ref.get();
-            if (o == null) {
-                // Delete cleared reference
-                iter.remove();
-            } else {
-                // Copy out interior object
-                newMap.put(me.getKey(), o);
-            }
-        }
-        // Return set of interior objects
-        return newMap.entrySet();
-    }
-
-    @Override
-	public synchronized V put(K key, V value) {
-        Reference<V> ref = makeReference(value);
-        ref = map.put(key, ref);
-        if (ref != null)
-            return (ref.get());
-        return null;
-    }
-
-    public abstract Reference<V> makeReference(Object value);
-
-    @Override
-	public V remove(Object key) {
-        Iterator<Entry<K, Reference<V>>> i = map.entrySet().iterator();
-        Entry<K, Reference<V>> correctEntry = null;
-        if (key == null) {
-            while (correctEntry == null && i.hasNext()) {
-                Entry<K, Reference<V>> e = i.next();
-                if (e.getKey() == null)
-                    correctEntry = e;
-            }
-        } else {
-            while (correctEntry == null && i.hasNext()) {
-            	Entry<K, Reference<V>> e = i.next();
-                if (key.equals(e.getKey()))
-                    correctEntry = e;
-            }
-        }
-        V oldValue = null;
-        if (correctEntry != null) {
-            Reference<V> correctReference = correctEntry.getValue();
-            oldValue = correctReference.get();
-            i.remove();
-        }
-        return oldValue;
-    }
-    /**
-     *
-     */
-    @Override
-	public void clear() {
-        map.entrySet().clear();
-    }
-
-    private transient Set<K> keySet = null;
-
-    @Override
-	public Set<K> keySet() {
-        if (keySet == null) {
-            keySet = new AbstractSet<K>() {
-            @Override
-			public Iterator<K> iterator() {
-                return new Iterator<K>() {
-                private Iterator<Entry<K, Reference<V>>> i = map.entrySet().iterator();
-
-                @Override
-				public boolean hasNext() {
-                    return i.hasNext();
-                }
-
-                @Override
-				public K next() {
-                    return i.next().getKey();
-                }
-
-                @Override
-				public void remove() {
-                    i.remove();
-                }
-                        };
-            }
-
-            @Override
-			public int size() {
-                return TransientCache.this.size();
-            }
-
-            @Override
-			public boolean contains(Object k) {
-                return TransientCache.this.containsKey(k);
-            }
-            };
-        }
-        return keySet;
-        }
-
-}
-- 
cgit v1.2.3