Clover coverage report - groovy - 1.0-beta-6
Coverage timestamp: Thu Jul 15 2004 13:18:22 BST
file stats: LOC: 241   Methods: 23
NCLOC: 161   Classes: 1
30 day Evaluation Version distributed via the Maven Jar Repository. Clover is not free. You have 30 days to evaluate it. Please visit http://www.thecortex.net/clover to obtain a licensed version of Clover
 
 Source file Conditionals Statements Methods TOTAL
IntRange.java 0% 0% 0% 0%
coverage
 1   
 /*
 2   
  $Id: IntRange.java,v 1.10 2004/01/25 16:21:37 jstrachan Exp $
 3   
 
 4   
  Copyright 2003 (C) James Strachan and Bob Mcwhirter. All Rights Reserved.
 5   
 
 6   
  Redistribution and use of this software and associated documentation
 7   
  ("Software"), with or without modification, are permitted provided
 8   
  that the following conditions are met:
 9   
 
 10   
  1. Redistributions of source code must retain copyright
 11   
     statements and notices.  Redistributions must also contain a
 12   
     copy of this document.
 13   
 
 14   
  2. Redistributions in binary form must reproduce the
 15   
     above copyright notice, this list of conditions and the
 16   
     following disclaimer in the documentation and/or other
 17   
     materials provided with the distribution.
 18   
 
 19   
  3. The name "groovy" must not be used to endorse or promote
 20   
     products derived from this Software without prior written
 21   
     permission of The Codehaus.  For written permission,
 22   
     please contact info@codehaus.org.
 23   
 
 24   
  4. Products derived from this Software may not be called "groovy"
 25   
     nor may "groovy" appear in their names without prior written
 26   
     permission of The Codehaus. "groovy" is a registered
 27   
     trademark of The Codehaus.
 28   
 
 29   
  5. Due credit should be given to The Codehaus -
 30   
     http://groovy.codehaus.org/
 31   
 
 32   
  THIS SOFTWARE IS PROVIDED BY THE CODEHAUS AND CONTRIBUTORS
 33   
  ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT
 34   
  NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
 35   
  FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
 36   
  THE CODEHAUS OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
 37   
  INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 38   
  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 39   
  SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 40   
  HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
 41   
  STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 42   
  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 43   
  OF THE POSSIBILITY OF SUCH DAMAGE.
 44   
 
 45   
  */
 46   
 package groovy.lang;
 47   
 
 48   
 import java.util.AbstractList;
 49   
 import java.util.Iterator;
 50   
 import java.util.List;
 51   
 
 52   
 import org.codehaus.groovy.runtime.InvokerHelper;
 53   
 import org.codehaus.groovy.runtime.IteratorClosureAdapter;
 54   
 
 55   
 /**
 56   
  * Represents a list of Integer objects from a specified int up to and including
 57   
  * a given and to.
 58   
  * 
 59   
  * @author <a href="mailto:james@coredevelopers.net">James Strachan</a>
 60   
  * @version $Revision: 1.10 $
 61   
  */
 62   
 public class IntRange extends AbstractList implements Range {
 63   
 
 64   
     private int from;
 65   
     private int to;
 66   
     private boolean reverse;
 67   
 
 68  0
     public IntRange(int from, int to) {
 69  0
         if (from > to) {
 70  0
             this.from = to;
 71  0
             this.to = from;
 72  0
             this.reverse = true;
 73   
         }
 74   
         else {
 75  0
             this.from = from;
 76  0
             this.to = to;
 77   
         }
 78   
     }
 79   
 
 80  0
     protected IntRange(int from, int to, boolean reverse) {
 81  0
         this.from = from;
 82  0
         this.to = to;
 83  0
         this.reverse = reverse;
 84   
     }
 85   
 
 86  0
     public boolean equals(Object that) {
 87  0
         if (that instanceof IntRange) {
 88  0
             return equals((IntRange) that);
 89   
         }
 90  0
         else if (that instanceof List) {
 91  0
             return equals((List) that);
 92   
         }
 93  0
         return false;
 94   
     }
 95   
 
 96  0
     public boolean equals(List that) {
 97  0
         int size = size();
 98  0
         if (that.size() == size) {
 99  0
             for (int i = 0; i < size; i++) {
 100  0
                 if (!InvokerHelper.compareEqual(get(i), that.get(i))) {
 101  0
                     return false;
 102   
                 }
 103   
             }
 104  0
             return true;
 105   
         }
 106  0
         return false;
 107   
     }
 108   
 
 109  0
     public boolean equals(IntRange that) {
 110  0
         return this.reverse == that.reverse && this.from == that.from && this.to == that.to;
 111   
     }
 112   
 
 113  0
     public Comparable getFrom() {
 114  0
         return new Integer(from);
 115   
     }
 116   
 
 117  0
     public Comparable getTo() {
 118  0
         return new Integer(to);
 119   
     }
 120   
 
 121  0
     public int getFromInt() {
 122  0
         return from;
 123   
     }
 124   
 
 125  0
     public int getToInt() {
 126  0
         return to;
 127   
     }
 128   
 
 129  0
     public boolean isReverse() {
 130  0
         return reverse;
 131   
     }
 132   
 
 133  0
     public Object get(int index) {
 134  0
         if (index < 0) {
 135  0
             throw new IndexOutOfBoundsException("Index: " + index + " should not be negative");
 136   
         }
 137  0
         if (index >= size()) {
 138  0
             throw new IndexOutOfBoundsException("Index: " + index + " too big for range: " + this);
 139   
         }
 140  0
         int value = (reverse) ? to - index : index + from;
 141  0
         return new Integer(value);
 142   
     }
 143   
 
 144  0
     public int size() {
 145  0
         return to - from + 1;
 146   
     }
 147   
 
 148  0
     public int hashCode() {
 149  0
         return from ^ to + (reverse ? 1 : 0);
 150   
     }
 151   
 
 152  0
     public Iterator iterator() {
 153  0
         return new Iterator() {
 154   
             int index = 0;
 155   
             int size = size();
 156  0
             int value = (reverse) ? to : from;
 157   
 
 158  0
             public boolean hasNext() {
 159  0
                 return index < size;
 160   
             }
 161   
 
 162  0
             public Object next() {
 163  0
                 if (index++ > 0) {
 164  0
                     if (index > size) {
 165  0
                         return null;
 166   
                     }
 167   
                     else {
 168  0
                         if (reverse) {
 169  0
                             --value;
 170   
                         }
 171   
                         else {
 172  0
                             ++value;
 173   
                         }
 174   
                     }
 175   
                 }
 176  0
                 return new Integer(value);
 177   
             }
 178   
 
 179  0
             public void remove() {
 180  0
                 IntRange.this.remove(index);
 181   
             }
 182   
         };
 183   
     }
 184   
 
 185  0
     public List subList(int fromIndex, int toIndex) {
 186  0
         if (fromIndex < 0) {
 187  0
             throw new IndexOutOfBoundsException("fromIndex = " + fromIndex);
 188   
         }
 189  0
         if (toIndex > size()) {
 190  0
             throw new IndexOutOfBoundsException("toIndex = " + toIndex);
 191   
         }
 192  0
         if (fromIndex > toIndex) {
 193  0
             throw new IllegalArgumentException("fromIndex(" + fromIndex + ") > toIndex(" + toIndex + ")");
 194   
         }
 195  0
         return new IntRange(fromIndex + this.from, toIndex + this.from - 1, reverse);
 196   
     }
 197   
 
 198  0
     public String toString() {
 199  0
         return (reverse) ? "" + to + ".." + from : "" + from + ".." + to;
 200   
     }
 201   
     
 202  0
     public String inspect() {
 203  0
         return toString();
 204   
     }
 205   
     
 206  0
     public boolean contains(Object value) {
 207  0
         if (value instanceof Integer) {
 208  0
             Integer integer = (Integer) value;
 209  0
             int i = integer.intValue();
 210  0
             return i >= from && i <= to;
 211   
         }
 212  0
         return false;
 213   
     }
 214   
 
 215  0
     public void step(int step, Closure closure) {
 216  0
         if (reverse) {
 217  0
             step = -step;
 218   
         }
 219  0
         if (step >= 0) {
 220  0
             int value = from;
 221  0
             while (value <= to) {
 222  0
                 closure.call(new Integer(value));
 223  0
                 value = value + step;
 224   
             }
 225   
         }
 226   
         else {
 227  0
             int value = to;
 228  0
             while (value >= from) {
 229  0
                 closure.call(new Integer(value));
 230  0
                 value = value + step;
 231   
             }
 232   
         }
 233   
     }
 234   
 
 235  0
     public List step(int step) {
 236  0
         IteratorClosureAdapter adapter = new IteratorClosureAdapter(this);
 237  0
         step(step, adapter);
 238  0
         return adapter.asList();
 239   
     }
 240   
 }
 241