DynamicJava Test Coverage (dynamicjava-20130622-r5436)

Clover coverage report - DynamicJava Test Coverage (dynamicjava-20130622-r5436)

Coverage timestamp: Sat Jun 22 2013 03:01:29 CDT

FRAMES NO FRAMES

file stats:	LOC:	79		Methods:	8
	NCLOC:	41		Classes:	1

Source file

Conditionals

Statements

Methods

TOTAL

VoidType.java

33.3%

52.9%

62.5%

51.6%

1		package edu.rice.cs.dynamicjava.symbol.type;
2
3		import edu.rice.cs.dynamicjava.symbol.*;
4
5		/**
6		* Class VoidType, a component of the ASTGen-generated composite hierarchy.
7		* Note: null is not allowed as a value for any field.
8		* @version Generated automatically by ASTGen at Sat Jun 22 03:00:38 CDT 2013
9		*/
10		@SuppressWarnings("unused")
11		public class VoidType extends Type {
12
13		/**
14		* Constructs a VoidType.
15		* @throws java.lang.IllegalArgumentException If any parameter to the constructor is null.
16		*/
17	2	public VoidType() {
18	2	super();
19		}
20
21
22	1184	public <RetType> RetType apply(TypeVisitor<RetType> visitor) {
23	1184	return visitor.forVoidType(this);
24		}
25
26	54	public void apply(TypeVisitor_void visitor) {
27	54	visitor.forVoidType(this);
28		}
29
30		/**
31		* Implementation of toString that uses
32		* {@link #output} to generate a nicely tabbed tree.
33		*/
34	0	public java.lang.String toString() {
35	0	java.io.StringWriter w = new java.io.StringWriter();
36	0	walk(new ToStringWalker(w, 2));
37	0	return w.toString();
38		}
39
40		/**
41		* Prints this object out as a nicely tabbed tree.
42		*/
43	0	public void output(java.io.Writer writer) {
44	0	walk(new ToStringWalker(writer, 2));
45		}
46
47		/**
48		* Implementation of equals that is based on the values of the fields of the
49		* object. Thus, two objects created with identical parameters will be equal.
50		*/
51	130	public boolean equals(java.lang.Object obj) {
52	0	if (obj == null) return false;
53	130	if ((obj.getClass() != this.getClass()) \|\| (obj.hashCode() != this.hashCode())) {
54	0	return false;
55		}
56		else {
57	130	VoidType casted = (VoidType) obj;
58	130	return true;
59		}
60		}
61
62
63		/**
64		* Implementation of hashCode that is consistent with equals. The value of
65		* the hashCode is formed by XORing the hashcode of the class object with
66		* the hashcodes of all the fields of the object.
67		*/
68	1	public int generateHashCode() {
69	1	int code = getClass().hashCode();
70	1	return code;
71		}
72
73	0	public void walk(TreeWalker w) {
74	0	if (w.visitNode(this, "VoidType", 0)) {
75	0	w.endNode(this, "VoidType", 0);
76		}
77		}
78
79		}