/**
* 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.Iterator;
import org.junit.Test;
import static org.junit.Assert.*;
/**
* Tests for TwoQueueBuffer.
*
* @author Antoine Gourlay
*/
public class TwoQueueTest {
private class TestAddClear2Q extends TwoQueueBuffer<Integer, Integer> {
boolean passed;
public TestAddClear2Q(int maxSize) {
super(maxSize);
}
@Override
protected Integer reclaim(Integer id) {
passed = !passed;
return id;
}
@Override
protected void unload(Integer b) {
}
}
@Test
public void testAddClear() {
TestAddClear2Q b = new TestAddClear2Q(10);
int g = b.get(10);
assertEquals(10, g);
assertTrue(b.passed);
b.clear();
assertTrue(b.passed);
b.get(10);
assertFalse(b.passed);
}
private class TestUnload2Q extends TwoQueueBuffer<Integer, Integer> {
int lastUn = -1;
public TestUnload2Q(int maxSize) {
super(maxSize);
}
@Override
protected Integer reclaim(Integer id) {
return id;
}
@Override
protected void unload(Integer b) {
lastUn = b;
}
}
@Test
public void testUnload() {
TestUnload2Q b = new TestUnload2Q(8);
b.get(0);
b.get(1);
assertEquals(-1, b.lastUn);
b.get(8);
assertEquals(0, b.lastUn);
b.get(9);
assertEquals(1, b.lastUn);
}
private class TestComplex2Q extends TwoQueueBuffer<Integer, Integer> {
int lastUn = -1;
int lastRec = -1;
public TestComplex2Q(int maxSize) {
super(maxSize);
}
@Override
protected Integer reclaim(Integer id) {
lastRec = id;
return id;
}
@Override
protected void unload(Integer b) {
lastUn = b;
}
}
@Test
public void testComplex2Q() {
TestComplex2Q b = new TestComplex2Q(8);
// no duplicates
b.get(0);
b.get(1);
b.get(0);
b.get(1);
b.get(0);
b.get(1);
b.get(0);
b.get(1);
b.get(0);
b.get(1);
assertEquals(-1, b.lastUn);
b.clear();
b.get(0);
b.get(1);
// now we start unloading
b.get(2);
assertEquals(2, b.lastRec);
assertEquals(0, b.lastUn);
b.get(1);
assertEquals(2, b.lastRec);
assertEquals(0, b.lastUn);
b.get(3);
assertEquals(3, b.lastRec);
assertEquals(1, b.lastUn);
// now we access one in A1out
// and see it climb back into Am
b.get(0);
assertEquals(0, b.lastRec);
assertEquals(1, b.lastUn);
// now we get it from Am
b.get(0);
// see that nothing changed
assertEquals(0, b.lastRec);
assertEquals(1, b.lastUn);
}
@Test
public void testSize() {
TestComplex2Q b = new TestComplex2Q(8);
assertEquals(0, b.size());
assertTrue(b.isEmpty());
b.get(0);
b.get(1);
assertEquals(2, b.size());
assertFalse(b.isEmpty());
b.get(2);
assertEquals(2, b.size());
// 0 gets back in Am
b.get(0);
assertEquals(3, b.size());
b.get(4);
assertEquals(3, b.size());
}
@Test
public void testRemove() {
TestComplex2Q b = new TestComplex2Q(8);
b.get(0);
b.get(1);
// remove in A1in
assertTrue(b.remove(0));
assertEquals(0, b.lastUn);
assertEquals(1, b.size());
assertFalse(b.remove(0));
b.clear();
b.get(0);
b.get(1);
b.get(2);
b.get(0);
// remove in Am
assertTrue(b.remove(0));
assertEquals(0, b.lastUn);
assertEquals(2, b.size());
assertFalse(b.remove(0));
}
@Test
public void testIterator() {
TestComplex2Q b = new TestComplex2Q(8);
Iterator<DoubleQueueValue<Integer, Integer>> it = b.iterator();
assertFalse(it.hasNext());
b.get(0);
b.get(1);
b.get(2);
b.get(0);
it = b.iterator();
assertTrue(it.hasNext());
boolean flag0 = false;
boolean flag1 = false;
boolean flag2 = false;
while (it.hasNext()) {
DoubleQueueValue<Integer, Integer> n = it.next();
switch (n.key) {
case 0:
if (flag0) {
fail();
}
flag0 = true;
break;
case 1:
if (flag1) {
fail();
}
flag1 = true;
break;
case 2:
if (flag2) {
fail();
}
flag2 = true;
break;
default:
fail();
}
}
assertTrue(flag0);
assertTrue(flag1);
assertTrue(flag2);
b.clear();
it = b.iterator();
assertFalse(it.hasNext());
}
@Test
public void testIteratorRemove() {
TestComplex2Q b = new TestComplex2Q(8);
b.get(0);
b.get(1);
b.get(2);
b.get(0);
b.get(4);
// remove from Am
Iterator<DoubleQueueValue<Integer, Integer>> it = b.iterator();
int i = it.next().key;
it.remove();
assertEquals(i, b.lastUn);
b.get(i);
assertEquals(i, b.lastRec);
// remove from A1int
it = b.iterator();
it.next();
i = it.next().key;
it.remove();
assertEquals(i, b.lastUn);
b.get(i);
assertEquals(i, b.lastRec);
}
}