Clover coverage report - groovy - 1.0-beta-8
Coverage timestamp: Fri Dec 17 2004 14:55:55 GMT
file stats: LOC: 147   Methods: 11
NCLOC: 71   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
ListExpression.java 0% 0% 0% 0%
coverage
 1   
 /*
 2   
  $Id: ListExpression.java,v 1.3 2004/07/10 03:31:37 bran 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 org.codehaus.groovy.ast.expr;
 47   
 
 48   
 import java.util.ArrayList;
 49   
 import java.util.Iterator;
 50   
 import java.util.List;
 51   
 
 52   
 import org.codehaus.groovy.ast.GroovyCodeVisitor;
 53   
 import org.codehaus.groovy.classgen.AsmClassGenerator2;
 54   
 
 55   
 /**
 56   
  * Represents a list expression [1, 2, 3] which creates a mutable List
 57   
  * 
 58   
  * @author <a href="mailto:james@coredevelopers.net">James Strachan</a>
 59   
  * @version $Revision: 1.3 $
 60   
  */
 61   
 public class ListExpression extends Expression {
 62   
     private List expressions;
 63   
 
 64  0
     public ListExpression() {
 65  0
         this(new ArrayList());
 66   
     }
 67   
     
 68  0
     public ListExpression(List expressions) {
 69  0
         this.expressions = expressions;
 70   
         //
 71   
     }
 72   
     
 73  0
     public void addExpression(Expression expression) {
 74  0
         expressions.add(expression);
 75   
     }
 76   
     
 77  0
     public List getExpressions() {
 78  0
         return expressions;
 79   
     }
 80   
 
 81  0
     public void visit(GroovyCodeVisitor visitor) {
 82  0
         visitor.visitListExpression(this);
 83   
     }
 84   
 
 85  0
     public Expression transformExpression(ExpressionTransformer transformer) {
 86  0
         return new ListExpression(transformExpressions(getExpressions(), transformer));
 87   
     }
 88   
 
 89  0
     protected void resolveType(AsmClassGenerator2 resolver) {
 90  0
         for (int i = 0; i < expressions.size(); i++) {
 91  0
             Expression expression = (Expression) expressions.get(i);
 92  0
             expression.resolve(resolver);
 93   
         }
 94  0
         super.setTypeClass(List.class);
 95   
     }
 96   
 
 97  0
     public Expression getExpression(int i) {
 98  0
         return (Expression) expressions.get(i);
 99   
     }
 100   
 
 101  0
     public String getText() {
 102  0
         StringBuffer buffer = new StringBuffer("[");
 103  0
         boolean first = true;
 104  0
         for (Iterator iter = expressions.iterator(); iter.hasNext(); ) {
 105  0
             if (first) {
 106  0
                 first = false;
 107   
             }
 108   
             else {
 109  0
                 buffer.append(", ");
 110   
             }
 111   
             
 112  0
             buffer.append(((Expression)iter.next()).getText());
 113   
         }
 114  0
         buffer.append("]");
 115  0
         return buffer.toString();
 116   
     }
 117   
 
 118  0
     public String toString() {
 119  0
         return super.toString() + expressions;
 120   
     }
 121   
 
 122   
     /**
 123   
      * return the common element type of all the element
 124   
      * @return
 125   
      */
 126  0
     public Class getComponentTypeClass() {
 127  0
         boolean first = true;
 128  0
         Class cls = null;
 129   
 
 130  0
         for (Iterator iter = expressions.iterator(); iter.hasNext(); ) {
 131  0
             Expression exp = (Expression) iter.next();
 132  0
             if (cls == null) {
 133  0
                 cls = exp.getTypeClass();
 134   
             }
 135   
             else {
 136  0
                 if (cls != exp.getTypeClass()) {
 137   
                     // a heterogenous list
 138  0
                     return null;
 139   
                 }
 140   
             }
 141   
         }
 142  0
         return cls;
 143   
     }
 144   
 
 145   
 
 146   
 }
 147