Clover coverage report - DynamicJava Test Coverage (dynamicjava-20130622-r5436)
Coverage timestamp: Sat Jun 22 2013 03:01:29 CDT
file stats: LOC: 212   Methods: 14
NCLOC: 61   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
ForEachStatement.java 16.7% 44% 35.7% 37.8%
coverage coverage
 1    /*BEGIN_COPYRIGHT_BLOCK
 2    *
 3    * Copyright (c) 2001-2010, JavaPLT group at Rice University (drjava@rice.edu)
 4    * All rights reserved.
 5    *
 6    * Redistribution and use in source and binary forms, with or without
 7    * modification, are permitted provided that the following conditions are met:
 8    * * Redistributions of source code must retain the above copyright
 9    * notice, this list of conditions and the following disclaimer.
 10    * * Redistributions in binary form must reproduce the above copyright
 11    * notice, this list of conditions and the following disclaimer in the
 12    * documentation and/or other materials provided with the distribution.
 13    * * Neither the names of DrJava, the JavaPLT group, Rice University, nor the
 14    * names of its contributors may be used to endorse or promote products
 15    * derived from this software without specific prior written permission.
 16    *
 17    * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 18    * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 19    * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 20    * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 21    * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 22    * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 23    * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 24    * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 25    * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 26    * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 27    * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 28    *
 29    * This software is Open Source Initiative approved Open Source Software.
 30    * Open Source Initative Approved is a trademark of the Open Source Initiative.
 31    *
 32    * This file is part of DrJava. Download the current version of this project
 33    * from http://www.drjava.org/ or http://sourceforge.net/projects/drjava/
 34    *
 35    * END_COPYRIGHT_BLOCK*/
 36   
 37    /*
 38    * DynamicJava - Copyright (C) 1999-2001
 39    *
 40    * Permission is hereby granted, free of charge, to any person obtaining a
 41    * copy of this software and associated documentation files
 42    * (the "Software"), to deal in the Software without restriction, including
 43    * without limitation the rights to use, copy, modify, merge, publish,
 44    * distribute, sublicense, and/or sell copies of the Software, and to permit
 45    * persons to whom the Software is furnished to do so, subject to the
 46    * following conditions:
 47    * The above copyright notice and this permission notice shall be included
 48    * in all copies or substantial portions of the Software.
 49    *
 50    * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 51    * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 52    * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 53    * IN NO EVENT SHALL DYADE BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 54    * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 55    * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 56    * DEALINGS IN THE SOFTWARE.
 57    *
 58    * Except as contained in this notice, the name of Dyade shall not be
 59    * used in advertising or otherwise to promote the sale, use or other
 60    * dealings in this Software without prior written authorization from
 61    * Dyade.
 62    *
 63    */
 64   
 65    package koala.dynamicjava.tree;
 66   
 67    import java.util.*;
 68   
 69    import koala.dynamicjava.tree.visitor.*;
 70   
 71    /**
 72    * This class represents the foreach statement nodes of the syntax tree
 73    *
 74    */
 75   
 76    public class ForEachStatement extends ForSlashEachStatement implements ContinueTarget {
 77    /**
 78    * The initialization statements
 79    */
 80    private FormalParameter parameter;
 81   
 82    /**
 83    * The update statements
 84    */
 85    private Expression collection;
 86   
 87    /**
 88    * The body of this statement
 89    */
 90    private Node body;
 91   
 92    /**
 93    * The labels
 94    */
 95    private List<String> labels;
 96   
 97   
 98    /*
 99    * The list of variables used for expansion of the foreach node.
 100    */
 101    private List<String> vars;
 102   
 103    /**
 104    * Creates a new for statement
 105    * @exception IllegalArgumentException if body is null
 106    */
 107  0 public ForEachStatement(FormalParameter para, Expression collection, Node body) {
 108  0 this(para, collection, body, SourceInfo.NONE);
 109    }
 110   
 111    /**
 112    * Creates a new for statement
 113    * @param body the body
 114    * @exception IllegalArgumentException if body is null
 115    */
 116  7 public ForEachStatement(FormalParameter para, Expression coll, Node body,
 117    SourceInfo si) {
 118  7 super(si);
 119   
 120  0 if (body == null) throw new IllegalArgumentException("body == null");
 121   
 122  7 parameter = para;
 123  7 collection = coll;
 124  7 this.body = body;
 125  7 labels = new LinkedList<String>();
 126  7 vars = new LinkedList<String>();
 127    }
 128   
 129   
 130  0 public void addVar(String s){
 131  0 vars.add(s);
 132    }
 133   
 134  0 public List<String> getVars(){
 135  0 return vars;
 136    }
 137   
 138    /**
 139    * Gets the initialization statements
 140    */
 141  16 public FormalParameter getParameter() {
 142  16 return parameter;
 143    }
 144   
 145    /**
 146    * Sets the initialization statements
 147    */
 148  0 public void setParameter(FormalParameter l) {
 149  0 parameter = l;
 150    }
 151   
 152    /**
 153    * Gets the condition to evaluate at each loop
 154    */
 155  22 public Expression getCollection() {
 156  22 return collection;
 157    }
 158   
 159    /**
 160    * Sets the condition to evaluate
 161    */
 162  0 public void setCollection(Expression e) {
 163  0 collection = e;
 164    }
 165   
 166    /**
 167    * Returns the body of this statement
 168    */
 169  36 public Node getBody() {
 170  36 return body;
 171    }
 172   
 173    /**
 174    * Sets the body of this statement
 175    * @exception IllegalArgumentException if node is null
 176    */
 177  0 public void setBody(Node node) {
 178  0 if (node == null) throw new IllegalArgumentException("node == null");
 179  0 body = node;
 180    }
 181   
 182    /**
 183    * Adds a label to this statement
 184    * @param label the label to add
 185    * @exception IllegalArgumentException if label is null
 186    */
 187  0 public void addLabel(String label) {
 188  0 if (label == null) throw new IllegalArgumentException("label == null");
 189   
 190  0 labels.add(label);
 191    }
 192   
 193    /**
 194    * Test whether this statement has the given label
 195    * @return true if this statement has the given label
 196    */
 197  0 public boolean hasLabel(String label) {
 198  0 return labels.contains(label);
 199    }
 200   
 201    /**
 202    * Allows a visitor to traverse the tree
 203    * @param visitor the visitor to accept
 204    */
 205  16 public <T> T acceptVisitor(Visitor<T> visitor) {
 206  16 return visitor.visit(this);
 207    }
 208   
 209  0 public String toString(){
 210  0 return "("+getClass().getName()+": "+getParameter()+" "+getCollection()+" "+getBody()+")";
 211    }
 212    }