Add TreeBidiMap implementation

git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/proper/collections/trunk@131339 13f79535-47bb-0310-9956-ffa450edef68

src/test/org/apache/commons/collections/TestAll.java

@@ -1,5 +1,5 @@
 /*
- * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/TestAll.java,v 1.52 2003/10/31 01:26:25 scolebourne Exp $
+ * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/TestAll.java,v 1.53 2003/11/08 18:52:51 scolebourne Exp $
  * ====================================================================
  *
  * The Apache Software License, Version 1.1
@@ -64,7 +64,7 @@ import junit.framework.TestSuite;
 /**
  * Entry point for all Collections package tests.
  * 
- * @version $Revision: 1.52 $ $Date: 2003/10/31 01:26:25 $
+ * @version $Revision: 1.53 $ $Date: 2003/11/08 18:52:51 $
  * 
  * @author Rodney Waldhoff
  * @author Stephen Colebourne
@@ -115,6 +115,7 @@ public class TestAll extends TestCase {
         suite.addTest(TestSequencedHashMap.suite());
         suite.addTest(TestStaticBucketMap.suite());
         suite.addTest(TestTreeBag.suite());
+        suite.addTest(TestTreeBidiMap.suite());
         suite.addTest(TestUnboundedFifoBuffer.suite());
         suite.addTest(TestEnumerationUtils.suite());
         return suite;

src/test/org/apache/commons/collections/TestTreeBidiMap.java

@@ -0,0 +1,214 @@
+/*
+ * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/Attic/TestTreeBidiMap.java,v 1.1 2003/11/08 18:52:51 scolebourne Exp $
+ * ====================================================================
+ *
+ * The Apache Software License, Version 1.1
+ *
+ * Copyright (c) 2001-2003 The Apache Software Foundation.  All rights
+ * reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in
+ *    the documentation and/or other materials provided with the
+ *    distribution.
+ *
+ * 3. The end-user documentation included with the redistribution, if
+ *    any, must include the following acknowledgement:
+ *       "This product includes software developed by the
+ *        Apache Software Foundation (http://www.apache.org/)."
+ *    Alternately, this acknowledgement may appear in the software itself,
+ *    if and wherever such third-party acknowledgements normally appear.
+ *
+ * 4. The names "The Jakarta Project", "Commons", and "Apache Software
+ *    Foundation" must not be used to endorse or promote products derived
+ *    from this software without prior written permission. For written
+ *    permission, please contact apache@apache.org.
+ *
+ * 5. Products derived from this software may not be called "Apache"
+ *    nor may "Apache" appear in their names without prior written
+ *    permission of the Apache Software Foundation.
+ *
+ * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
+ * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
+ * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
+ * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ * ====================================================================
+ *
+ * This software consists of voluntary contributions made by many
+ * individuals on behalf of the Apache Software Foundation.  For more
+ * information on the Apache Software Foundation, please see
+ * <http://www.apache.org/>.
+ *
+ */
+package org.apache.commons.collections;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Iterator;
+import java.util.List;
+import java.util.Map;
+import java.util.NoSuchElementException;
+import java.util.TreeMap;
+
+import junit.framework.Test;
+import junit.textui.TestRunner;
+
+/**
+ * JUnit tests.
+ * 
+ * @version $Revision: 1.1 $ $Date: 2003/11/08 18:52:51 $
+ * 
+ * @author Stephen Colebourne
+ */
+public class TestTreeBidiMap extends AbstractTestBidiMap {
+
+    public static void main(String[] args) {
+        TestRunner.run(suite());
+    }
+    
+    public static Test suite() {
+        return BulkTest.makeSuite(TestTreeBidiMap.class);
+    }
+
+    public TestTreeBidiMap(String testName) {
+        super(testName);
+    }
+
+    protected BidiMap makeEmptyBidiMap() {
+        return new TreeBidiMap();
+    }
+    
+    protected Map makeConfirmedMap() {
+        return new TreeMap();
+    }
+
+    /**
+     * Override to prevent infinite recursion of tests.
+     */
+    protected String[] ignoredTests() {
+        return new String[] {"TestTreeBidiMap.bulkTestInverseMap.bulkTestInverseMap"};
+    }
+    
+    protected boolean isAllowNullKey() {
+        return false;
+    }
+    
+    protected boolean isAllowNullValue() {
+        return false;
+    }
+    
+    protected boolean isSetValueSupported() {
+        return false;
+    }
+    
+    public void testFirstKey() {
+        TreeBidiMap bidi = (TreeBidiMap) makeEmptyMap();
+        try {
+            bidi.firstKey();
+            fail();
+        } catch (NoSuchElementException ex) {}
+        
+        resetFull();
+        bidi = (TreeBidiMap) map;
+        Object confirmedFirst = confirmed.keySet().iterator().next();
+        assertEquals(confirmedFirst, bidi.firstKey());
+    }
+    
+    public void testLastKey() {
+        TreeBidiMap bidi = (TreeBidiMap) makeEmptyMap();
+        try {
+            bidi.lastKey();
+            fail();
+        } catch (NoSuchElementException ex) {}
+        
+        resetFull();
+        bidi = (TreeBidiMap) map;
+        Object confirmedLast = null;
+        for (Iterator it = confirmed.keySet().iterator(); it.hasNext();) {
+            confirmedLast = it.next();
+        }
+        assertEquals(confirmedLast, bidi.lastKey());
+    }
+    
+    public void testNextKey() {
+        TreeBidiMap bidi = (TreeBidiMap) makeEmptyMap();
+        try {
+            bidi.nextKey(null);
+            fail();
+        } catch (NullPointerException ex) {}
+        try {
+            bidi.nextKey(new Object());
+            fail();
+        } catch (ClassCastException ex) {}
+        
+        resetFull();
+        bidi = (TreeBidiMap) map;
+        Iterator it = confirmed.keySet().iterator();
+        Object confirmedLast = it.next();
+        while (it.hasNext()) {
+            Object confirmedObject = it.next();
+            assertEquals(confirmedObject, bidi.nextKey(confirmedLast));
+            confirmedLast = confirmedObject;
+        }
+        assertEquals(null, bidi.nextKey(confirmedLast));
+        
+        try {
+            bidi.nextKey(null);
+            fail();
+        } catch (NullPointerException ex) {}
+        try {
+            bidi.nextKey(new Object());
+            fail();
+        } catch (ClassCastException ex) {}
+    }
+    
+    public void testPreviousKey() {
+        TreeBidiMap bidi = (TreeBidiMap) makeEmptyMap();
+        try {
+            bidi.previousKey(null);
+            fail();
+        } catch (NullPointerException ex) {}
+        try {
+            bidi.previousKey(new Object());
+            fail();
+        } catch (ClassCastException ex) {}
+        
+        resetFull();
+        bidi = (TreeBidiMap) map;
+        List list = new ArrayList(confirmed.keySet());
+        Collections.reverse(list);
+        Iterator it = list.iterator();
+        Object confirmedLast = it.next();
+        while (it.hasNext()) {
+            Object confirmedObject = it.next();
+            assertEquals(confirmedObject, bidi.previousKey(confirmedLast));
+            confirmedLast = confirmedObject;
+        }
+        assertEquals(null, bidi.previousKey(confirmedLast));
+        
+        try {
+            bidi.previousKey(null);
+            fail();
+        } catch (NullPointerException ex) {}
+        try {
+            bidi.previousKey(new Object());
+            fail();
+        } catch (ClassCastException ex) {}
+    }
+    
+}