| /* |
| $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.AbstractList; |
| import java.util.List; |
| |
| import org.codehaus.groovy.runtime.typehandling.DefaultTypeTransformation; |
| |
| /** |
| * Represents a list of Integer objects from a specified int up to but not including |
| * a given and to. |
| * |
| * @author <a href="mailto:james@coredevelopers.net">James Strachan</a> |
| * @version $Revision$ |
| */ |
| public class Tuple extends AbstractList { |
| |
| private Object[] contents; |
| private int hashCode; |
| |
| public Tuple(Object[] contents) { |
| this.contents = contents; |
| } |
| |
| public Object get(int index) { |
| return contents[index]; |
| } |
| |
| public int size() { |
| return contents.length; |
| } |
| |
| public boolean equals(Object that) { |
| if (that instanceof Tuple) { |
| return equals((Tuple) that); |
| } |
| return false; |
| } |
| |
| public boolean equals(Tuple that) { |
| if (contents.length == that.contents.length) { |
| for (int i = 0; i < contents.length; i++) { |
| if (! DefaultTypeTransformation.compareEqual(this.contents[i], that.contents[i])) { |
| return false; |
| } |
| } |
| return true; |
| } |
| return false; |
| } |
| |
| |
| public int hashCode() { |
| if (hashCode == 0) { |
| for (int i = 0; i < contents.length; i++ ) { |
| Object value = contents[i]; |
| int hash = (value != null) ? value.hashCode() : 0xbabe; |
| hashCode ^= hash; |
| } |
| if (hashCode == 0) { |
| hashCode = 0xbabe; |
| } |
| } |
| return hashCode; |
| } |
| |
| public List subList(int fromIndex, int toIndex) { |
| int size = toIndex - fromIndex; |
| Object[] newContent = new Object[size]; |
| System.arraycopy(contents, fromIndex, newContent, 0, size); |
| return new Tuple(newContent); |
| } |
| } |