/**
* OrbisGIS is a java GIS application dedicated to research in GIScience.
* OrbisGIS is developed by the GIS group of the DECIDE team of the
* Lab-STICC CNRS laboratory, see <http://www.lab-sticc.fr/>.
*
* The GIS group of the DECIDE team is located at :
*
* Laboratoire Lab-STICC – CNRS UMR 6285
* Equipe DECIDE
* UNIVERSITÉ DE BRETAGNE-SUD
* Institut Universitaire de Technologie de Vannes
* 8, Rue Montaigne - BP 561 56017 Vannes Cedex
*
* OrbisGIS is distributed under GPL 3 license.
*
* Copyright (C) 2007-2014 CNRS (IRSTV FR CNRS 2488)
* Copyright (C) 2015-2017 CNRS (Lab-STICC UMR CNRS 6285)
*
* This file is part of OrbisGIS.
*
* OrbisGIS is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* OrbisGIS is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along with
* OrbisGIS. If not, see <http://www.gnu.org/licenses/>.
*
* For more information, please consult: <http://www.orbisgis.org/>
* or contact directly:
* info_at_ orbisgis.org
*/
package org.orbisgis.commons.collections.twoqueue;
import java.util.HashMap;
import java.util.Map;
/**
* Special FIFO Linked Queue for use by {@link TwoQueueBuffer}.
*
* @param <I> the key
* @param <B> the value
* @author Antoine Gourlay
*/
final class TwoQueueA1out<I, B> {
private Map<I, SingleQueueValue<I>> map;
private SingleQueueValue<I> newest;
private int maxSize;
TwoQueueA1out(int maxSize) {
this.maxSize = maxSize;
map = new HashMap<I, SingleQueueValue<I>>(maxSize);
}
int size() {
return map.size();
}
boolean isEmpty() {
return map.isEmpty();
}
boolean containsKey(I key) {
return map.containsKey(key);
}
boolean retrieve(I key) {
final SingleQueueValue<I> get = map.remove(key);
return remove(get);
}
void put(I key) {
final SingleQueueValue<I> q = new SingleQueueValue<I>(key);
map.put(q.key, q);
insert(q);
}
private boolean remove(SingleQueueValue<I> v) {
if (v != null) {
if (map.isEmpty()) {
newest = null;
} else {
newest = v.next;
newest.previous = v.previous;
newest.previous.next = newest;
}
return true;
} else {
return false;
}
}
private void insert(SingleQueueValue<I> v) {
trimOldest();
if (newest != null) {
v.previous = newest.previous;
v.next = newest;
v.previous.next = v;
newest.previous = v;
} else {
v.next = v;
v.previous = v;
}
newest = v;
}
private void trimOldest() {
if (map.size() == maxSize + 1) {
map.remove(newest.previous.key);
newest.previous = newest.previous.previous;
newest.previous.next = newest;
}
}
void clear() {
map.clear();
newest = null;
}
private static class SingleQueueValue<I> {
I key;
SingleQueueValue<I> next;
SingleQueueValue<I> previous;
SingleQueueValue(I key) {
this.key = key;
}
}
}