| /* |
| $Id$ |
| |
| Copyright 2003 (C) James Strachan and Bob Mcwhirter. All Rights Reserved. |
| |
| Redistribution and use of this software and associated documentation |
| ("Software"), with or without modification, are permitted provided |
| that the following conditions are met: |
| |
| 1. Redistributions of source code must retain copyright |
| statements and notices. Redistributions must also contain a |
| copy of this document. |
| |
| 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 name "groovy" must not be used to endorse or promote |
| products derived from this Software without prior written |
| permission of The Codehaus. For written permission, |
| please contact info@codehaus.org. |
| |
| 4. Products derived from this Software may not be called "groovy" |
| nor may "groovy" appear in their names without prior written |
| permission of The Codehaus. "groovy" is a registered |
| trademark of The Codehaus. |
| |
| 5. Due credit should be given to The Codehaus - |
| http://groovy.codehaus.org/ |
| |
| THIS SOFTWARE IS PROVIDED BY THE CODEHAUS AND CONTRIBUTORS |
| ``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 CODEHAUS 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. |
| |
| */ |
| package groovy.lang; |
| |
| import java.util.List; |
| |
| import junit.framework.TestCase; |
| |
| /** |
| * @author James Strachan |
| * @version $Revision$ |
| */ |
| public class TupleTest extends TestCase { |
| |
| Object[] data = { "a", "b", "c" }; |
| Tuple t = new Tuple(data); |
| |
| public void testSize() { |
| assertEquals("Size of " + t, 3, t.size()); |
| |
| assertEquals("get(0)", "a", t.get(0)); |
| assertEquals("get(1)", "b", t.get(1)); |
| } |
| |
| public void testGetOutOfTuple() { |
| try { |
| t.get(-1); |
| fail("Should have thrown IndexOut"); |
| } |
| catch (IndexOutOfBoundsException e) { |
| // worked |
| } |
| try { |
| t.get(10); |
| fail("Should have thrown IndexOut"); |
| } |
| catch (IndexOutOfBoundsException e) { |
| // worked |
| } |
| |
| } |
| |
| public void testContains() { |
| assertTrue("contains a", t.contains("a")); |
| assertTrue("contains b", t.contains("b")); |
| } |
| |
| public void testSubList() { |
| List s = t.subList(1, 2); |
| |
| assertTrue("is a Tuple", s instanceof Tuple); |
| |
| assertEquals("size", 1, s.size()); |
| } |
| |
| public void testHashCodeAndEquals() { |
| Tuple a = new Tuple(new Object[] { "a", "b", "c" }); |
| Tuple b = new Tuple(new Object[] { "a", "b", "c" }); |
| Tuple c = new Tuple(new Object[] { "d", "b", "c" }); |
| |
| assertEquals("hashcode", a.hashCode(), b.hashCode()); |
| assertTrue("hashcode", a.hashCode() != c.hashCode()); |
| |
| assertEquals("a and b", a, b); |
| assertFalse("a != c", a.equals(c)); |
| } |
| |
| public void testIterator() { |
| } |
| |
| } |