Clover coverage report - Java Language Levels Test Coverage (javalanglevels-20120305-r5436)
Coverage timestamp: Sun Mar 4 2012 22:02:46 CST
file stats: LOC: 104   Methods: 8
NCLOC: 64   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
NoOpExpression.java 0% 4.7% 25% 6.2%
coverage coverage
 1    package edu.rice.cs.javalanglevels.tree;
 2   
 3    import edu.rice.cs.javalanglevels.SourceInfo;
 4   
 5    /**
 6    * Class NoOpExpression, a component of the JExpressionIF composite hierarchy.
 7    * Note: null is not allowed as a value for any field.
 8    * @version Generated automatically by ASTGen at Sun Mar 04 22:01:28 CST 2012
 9    */
 10    public class NoOpExpression extends BinaryExpression {
 11   
 12    /**
 13    * Constructs a NoOpExpression.
 14    * @throws java.lang.IllegalArgumentException If any parameter to the constructor is null.
 15    */
 16  2 public NoOpExpression(SourceInfo in_sourceInfo, Expression in_left, Expression in_right) {
 17  2 super(in_sourceInfo, in_left, in_right);
 18    }
 19   
 20   
 21  1 public <RetType> RetType visit(JExpressionIFVisitor<RetType> visitor) { return visitor.forNoOpExpression(this); }
 22  0 public void visit(JExpressionIFVisitor_void visitor) { visitor.forNoOpExpression(this); }
 23   
 24    /**
 25    * Implementation of toString that uses
 26    * {@link #output} to generated nicely tabbed tree.
 27    */
 28  0 public java.lang.String toString() {
 29  0 java.io.StringWriter w = new java.io.StringWriter();
 30  0 output(w);
 31  0 return w.toString();
 32    }
 33   
 34    /**
 35    * Prints this object out as a nicely tabbed tree.
 36    */
 37  0 public void output(java.io.Writer writer) {
 38  0 outputHelp(new TabPrintWriter(writer, 2));
 39    }
 40   
 41  0 public void outputHelp(TabPrintWriter writer) {
 42  0 writer.print("NoOpExpression" + ":");
 43  0 writer.indent();
 44   
 45  0 writer.startLine("");
 46  0 writer.print("sourceInfo = ");
 47  0 SourceInfo temp_sourceInfo = getSourceInfo();
 48  0 if (temp_sourceInfo == null) {
 49  0 writer.print("null");
 50    } else {
 51  0 writer.print(temp_sourceInfo);
 52    }
 53   
 54  0 writer.startLine("");
 55  0 writer.print("left = ");
 56  0 Expression temp_left = getLeft();
 57  0 if (temp_left == null) {
 58  0 writer.print("null");
 59    } else {
 60  0 temp_left.outputHelp(writer);
 61    }
 62   
 63  0 writer.startLine("");
 64  0 writer.print("right = ");
 65  0 Expression temp_right = getRight();
 66  0 if (temp_right == null) {
 67  0 writer.print("null");
 68    } else {
 69  0 temp_right.outputHelp(writer);
 70    }
 71  0 writer.unindent();
 72    }
 73   
 74    /**
 75    * Implementation of equals that is based on the values
 76    * of the fields of the object. Thus, two objects
 77    * created with identical parameters will be equal.
 78    */
 79  0 public boolean equals(java.lang.Object obj) {
 80  0 if (obj == null) return false;
 81  0 if ((obj.getClass() != this.getClass()) || (obj.hashCode() != this.hashCode())) {
 82  0 return false;
 83    } else {
 84  0 NoOpExpression casted = (NoOpExpression) obj;
 85  0 if (! (getLeft().equals(casted.getLeft()))) return false;
 86  0 if (! (getRight().equals(casted.getRight()))) return false;
 87  0 return true;
 88    }
 89    }
 90   
 91    /**
 92    * Implementation of hashCode that is consistent with
 93    * equals. The value of the hashCode is formed by
 94    * XORing the hashcode of the class object with
 95    * the hashcodes of all the fields of the object.
 96    */
 97  0 protected int generateHashCode() {
 98  0 int code = getClass().hashCode();
 99  0 code ^= 0;
 100  0 code ^= getLeft().hashCode();
 101  0 code ^= getRight().hashCode();
 102  0 return code;
 103    }
 104    }