Author: trustin
Date: Sun Mar 9 23:01:46 2008
New Revision: 635442
URL: http://svn.apache.org/viewvc?rev=635442&view=rev
Log:
Added a test case for CircularQueue
Added:
mina/trunk/core/src/test/java/org/apache/mina/util/CircularQueueTest.java
(with props)
Added: mina/trunk/core/src/test/java/org/apache/mina/util/CircularQueueTest.java
URL:
http://svn.apache.org/viewvc/mina/trunk/core/src/test/java/org/apache/mina/util/CircularQueueTest.java?rev=635442&view=auto
==============================================================================
--- mina/trunk/core/src/test/java/org/apache/mina/util/CircularQueueTest.java
(added)
+++ mina/trunk/core/src/test/java/org/apache/mina/util/CircularQueueTest.java
Sun Mar 9 23:01:46 2008
@@ -0,0 +1,208 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing,
+ * software distributed under the License is distributed on an
+ * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+ * KIND, either express or implied. See the License for the
+ * specific language governing permissions and limitations
+ * under the License.
+ *
+ */
+package org.apache.mina.util;
+
+import java.util.Iterator;
+
+import junit.framework.Assert;
+import junit.framework.TestCase;
+
+/**
+ * Tests [EMAIL PROTECTED] Queue}
+ *
+ * @author The Apache Directory Project ([EMAIL PROTECTED])
+ * @version $Rev$, $Date$
+ */
+public class CircularQueueTest extends TestCase {
+ private int pushCount;
+
+ private int popCount;
+
+ public void setUp() {
+ pushCount = 0;
+ popCount = 0;
+ }
+
+ public void testRotation() {
+ CircularQueue<Integer> q = new CircularQueue<Integer>(); //
DEFAULT_CAPACITY = 4
+ testRotation0(q);
+ }
+
+ public void testExpandingRotation() {
+ CircularQueue<Integer> q = new CircularQueue<Integer>(); //
DEFAULT_CAPACITY = 4
+ for (int i = 0; i < 10; i++) {
+ testRotation0(q);
+
+ // make expansion happen
+ int oldCapacity = q.capacity();
+ for (int j = q.capacity(); j >= 0; j--) {
+ q.offer(new Integer(++pushCount));
+ }
+
+ Assert.assertTrue(q.capacity() > oldCapacity);
+ testRotation0(q);
+ }
+ }
+
+ private void testRotation0(CircularQueue<Integer> q) {
+ for (int i = 0; i < q.capacity() * 7 / 4; i++) {
+ q.offer(new Integer(++pushCount));
+ Assert.assertEquals(++popCount, q.poll().intValue());
+ }
+ }
+
+ public void testRandomAddOnQueue() {
+ CircularQueue<Integer> q = new CircularQueue<Integer>();
+ // Create a queue with 5 elements and capacity 8;
+ for (int i = 0; i < 5; i++) {
+ q.offer(new Integer(i));
+ }
+
+ q.add(0, new Integer(100));
+ q.add(3, new Integer(200));
+ q.add(7, new Integer(300));
+
+ Iterator<Integer> i = q.iterator();
+ Assert.assertEquals(8, q.size());
+ Assert.assertEquals(new Integer(100), i.next());
+ Assert.assertEquals(new Integer(0), i.next());
+ Assert.assertEquals(new Integer(1), i.next());
+ Assert.assertEquals(new Integer(200), i.next());
+ Assert.assertEquals(new Integer(2), i.next());
+ Assert.assertEquals(new Integer(3), i.next());
+ Assert.assertEquals(new Integer(4), i.next());
+ Assert.assertEquals(new Integer(300), i.next());
+
+ try {
+ i.next();
+ Assert.fail();
+ } catch (Exception e) {
+ // OK
+ }
+ }
+
+ public void testRandomAddOnRotatedQueue() {
+ CircularQueue<Integer> q = getRotatedQueue();
+
+ q.add(0, new Integer(100)); // addFirst
+ q.add(2, new Integer(200));
+ q.add(4, new Integer(300));
+ q.add(10, new Integer(400));
+ q.add(12, new Integer(500)); // addLast
+
+ Iterator<Integer> i = q.iterator();
+ Assert.assertEquals(13, q.size());
+ Assert.assertEquals(new Integer(100), i.next());
+ Assert.assertEquals(new Integer(0), i.next());
+ Assert.assertEquals(new Integer(200), i.next());
+ Assert.assertEquals(new Integer(1), i.next());
+ Assert.assertEquals(new Integer(300), i.next());
+ Assert.assertEquals(new Integer(2), i.next());
+ Assert.assertEquals(new Integer(3), i.next());
+ Assert.assertEquals(new Integer(4), i.next());
+ Assert.assertEquals(new Integer(5), i.next());
+ Assert.assertEquals(new Integer(6), i.next());
+ Assert.assertEquals(new Integer(400), i.next());
+ Assert.assertEquals(new Integer(7), i.next());
+ Assert.assertEquals(new Integer(500), i.next());
+
+ try {
+ i.next();
+ Assert.fail();
+ } catch (Exception e) {
+ // OK
+ }
+ }
+
+ public void testRandomRemoveOnQueue() {
+ CircularQueue<Integer> q = new CircularQueue<Integer>();
+
+ // Create a queue with 5 elements and capacity 8;
+ for (int i = 0; i < 5; i++) {
+ q.offer(new Integer(i));
+ }
+
+ q.remove(0);
+ q.remove(2);
+ q.remove(2);
+
+ Iterator<Integer> i = q.iterator();
+ Assert.assertEquals(2, q.size());
+ Assert.assertEquals(new Integer(1), i.next());
+ Assert.assertEquals(new Integer(2), i.next());
+
+ try {
+ i.next();
+ Assert.fail();
+ } catch (Exception e) {
+ // OK
+ }
+ }
+
+ public void testRandomRemoveOnRotatedQueue() {
+ CircularQueue<Integer> q = getRotatedQueue();
+
+ q.remove(0); // removeFirst
+ q.remove(2); // removeLast in the first half
+ q.remove(2); // removeFirst in the first half
+ q.remove(4); // removeLast
+
+ Iterator<Integer> i = q.iterator();
+ Assert.assertEquals(4, q.size());
+ Assert.assertEquals(new Integer(1), i.next());
+ Assert.assertEquals(new Integer(2), i.next());
+ Assert.assertEquals(new Integer(5), i.next());
+ Assert.assertEquals(new Integer(6), i.next());
+
+ try {
+ i.next();
+ Assert.fail();
+ } catch (Exception e) {
+ // OK
+ }
+ }
+
+ private CircularQueue<Integer> getRotatedQueue() {
+ CircularQueue<Integer> q = new CircularQueue<Integer>();
+
+ // Ensure capacity: 16
+ for (int i = 0; i < 16; i++) {
+ q.offer(new Integer(-1));
+ }
+ q.clear();
+
+ // Rotate it
+ for (int i = 0; i < 12; i++) {
+ q.offer(new Integer(-1));
+ q.poll();
+ }
+
+ // Now push items
+ for (int i = 0; i < 8; i++) {
+ q.offer(new Integer(i));
+ }
+
+ return q;
+ }
+
+ public static void main(String[] args) {
+ junit.textui.TestRunner.run(CircularQueueTest.class);
+ }
+}
Propchange:
mina/trunk/core/src/test/java/org/apache/mina/util/CircularQueueTest.java
------------------------------------------------------------------------------
svn:eol-style = native
Propchange:
mina/trunk/core/src/test/java/org/apache/mina/util/CircularQueueTest.java
------------------------------------------------------------------------------
svn:keywords = Rev Date
