You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Pair.java 1.6KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051
  1. /*
  2. * Javassist, a Java-bytecode translator toolkit.
  3. * Copyright (C) 1999-2003 Shigeru Chiba. All Rights Reserved.
  4. *
  5. * The contents of this file are subject to the Mozilla Public License Version
  6. * 1.1 (the "License"); you may not use this file except in compliance with
  7. * the License. Alternatively, the contents of this file may be used under
  8. * the terms of the GNU Lesser General Public License Version 2.1 or later.
  9. *
  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. package javassist.compiler.ast;
  16. import javassist.compiler.CompileError;
  17. /**
  18. * A node of a a binary tree. This class provides concrete methods
  19. * overriding abstract methods in ASTree.
  20. */
  21. public class Pair extends ASTree {
  22. protected ASTree left, right;
  23. public Pair(ASTree _left, ASTree _right) {
  24. left = _left;
  25. right = _right;
  26. }
  27. public void accept(Visitor v) throws CompileError { v.atPair(this); }
  28. public String toString() {
  29. StringBuffer sbuf = new StringBuffer();
  30. sbuf.append("(<Pair> ");
  31. sbuf.append(left == null ? "<null>" : left.toString());
  32. sbuf.append(" . ");
  33. sbuf.append(right == null ? "<null>" : right.toString());
  34. sbuf.append(')');
  35. return sbuf.toString();
  36. }
  37. public ASTree getLeft() { return left; }
  38. public ASTree getRight() { return right; }
  39. public void setLeft(ASTree _left) { left = _left; }
  40. public void setRight(ASTree _right) { right = _right; }
  41. }