01: /*
02: * Javassist, a Java-bytecode translator toolkit.
03: * Copyright (C) 1999-2006 Shigeru Chiba. All Rights Reserved.
04: *
05: * The contents of this file are subject to the Mozilla Public License Version
06: * 1.1 (the "License"); you may not use this file except in compliance with
07: * the License. Alternatively, the contents of this file may be used under
08: * the terms of the GNU Lesser General Public License Version 2.1 or later.
09: *
10: * Software distributed under the License is distributed on an "AS IS" basis,
11: * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12: * for the specific language governing rights and limitations under the
13: * License.
14: */
15:
16: package javassist.compiler.ast;
17:
18: import javassist.compiler.CompileError;
19:
20: /**
21: * A node of a a binary tree. This class provides concrete methods
22: * overriding abstract methods in ASTree.
23: */
24: public class Pair extends ASTree {
25: protected ASTree left, right;
26:
27: public Pair(ASTree _left, ASTree _right) {
28: left = _left;
29: right = _right;
30: }
31:
32: public void accept(Visitor v) throws CompileError {
33: v.atPair(this );
34: }
35:
36: public String toString() {
37: StringBuffer sbuf = new StringBuffer();
38: sbuf.append("(<Pair> ");
39: sbuf.append(left == null ? "<null>" : left.toString());
40: sbuf.append(" . ");
41: sbuf.append(right == null ? "<null>" : right.toString());
42: sbuf.append(')');
43: return sbuf.toString();
44: }
45:
46: public ASTree getLeft() {
47: return left;
48: }
49:
50: public ASTree getRight() {
51: return right;
52: }
53:
54: public void setLeft(ASTree _left) {
55: left = _left;
56: }
57:
58: public void setRight(ASTree _right) {
59: right = _right;
60: }
61: }
|