001 package edu.rice.cs.javalanglevels.tree;
002
003 import edu.rice.cs.javalanglevels.SourceInfo;
004
005 /**
006 * Class DivideExpression, a component of the JExpressionIF composite hierarchy.
007 * Note: null is not allowed as a value for any field.
008 * @version Generated automatically by ASTGen at Sun Jun 23 23:00:36 CDT 2013
009 */
010 public class DivideExpression extends NumericBinaryExpression {
011
012 /**
013 * Constructs a DivideExpression.
014 * @throws java.lang.IllegalArgumentException If any parameter to the constructor is null.
015 */
016 public DivideExpression(SourceInfo in_sourceInfo, Expression in_left, Expression in_right) {
017 super(in_sourceInfo, in_left, in_right);
018 }
019
020
021 public <RetType> RetType visit(JExpressionIFVisitor<RetType> visitor) { return visitor.forDivideExpression(this); }
022 public void visit(JExpressionIFVisitor_void visitor) { visitor.forDivideExpression(this); }
023
024 /**
025 * Implementation of toString that uses
026 * {@link #output} to generated nicely tabbed tree.
027 */
028 public java.lang.String toString() {
029 java.io.StringWriter w = new java.io.StringWriter();
030 output(w);
031 return w.toString();
032 }
033
034 /**
035 * Prints this object out as a nicely tabbed tree.
036 */
037 public void output(java.io.Writer writer) {
038 outputHelp(new TabPrintWriter(writer, 2));
039 }
040
041 public void outputHelp(TabPrintWriter writer) {
042 writer.print("DivideExpression" + ":");
043 writer.indent();
044
045 writer.startLine("");
046 writer.print("sourceInfo = ");
047 SourceInfo temp_sourceInfo = getSourceInfo();
048 if (temp_sourceInfo == null) {
049 writer.print("null");
050 } else {
051 writer.print(temp_sourceInfo);
052 }
053
054 writer.startLine("");
055 writer.print("left = ");
056 Expression temp_left = getLeft();
057 if (temp_left == null) {
058 writer.print("null");
059 } else {
060 temp_left.outputHelp(writer);
061 }
062
063 writer.startLine("");
064 writer.print("right = ");
065 Expression temp_right = getRight();
066 if (temp_right == null) {
067 writer.print("null");
068 } else {
069 temp_right.outputHelp(writer);
070 }
071 writer.unindent();
072 }
073
074 /**
075 * Implementation of equals that is based on the values
076 * of the fields of the object. Thus, two objects
077 * created with identical parameters will be equal.
078 */
079 public boolean equals(java.lang.Object obj) {
080 if (obj == null) return false;
081 if ((obj.getClass() != this.getClass()) || (obj.hashCode() != this.hashCode())) {
082 return false;
083 } else {
084 DivideExpression casted = (DivideExpression) obj;
085 if (! (getLeft().equals(casted.getLeft()))) return false;
086 if (! (getRight().equals(casted.getRight()))) return false;
087 return true;
088 }
089 }
090
091 /**
092 * Implementation of hashCode that is consistent with
093 * equals. The value of the hashCode is formed by
094 * XORing the hashcode of the class object with
095 * the hashcodes of all the fields of the object.
096 */
097 protected int generateHashCode() {
098 int code = getClass().hashCode();
099 code ^= 0;
100 code ^= getLeft().hashCode();
101 code ^= getRight().hashCode();
102 return code;
103 }
104 }