| Matching Statements |
| File1 Line# |
File2 Line# |
Statement |
| 24 | 6 | protected Node parent |
| 25 | 7 | protected Node[] children |
| 26 | 8 | protected int id |
| 29 | 11 | public SimpleNode(int i) { |
| 30 | 12 | id = i |
| 34 | 16 | this(i) |
| 35 | 17 | parser = p |
| 46 | 20 | public void jjtOpen() { |
| 49 | 23 | public void jjtClose() { |
| 52 | 26 | public void jjtSetParent(Node n) { parent = n |
| 53 | 27 | public Node jjtGetParent() { return parent |
| 55 | 29 | public void jjtAddChild(Node n, int i) { |
| 56 | 30 | if (children == null) { |
| 57 | 31 | children = new Node[i + 1] |
| 58 | 32 | } else if (i >= children.length) { |
| 59 | 33 | Node c[] = new Node[i + 1] |
| 60 | 34 | System.arraycopy(children, 0, c, 0, children.length) |
| 61 | 35 | children = c |
| 63 | 37 | children[i] = n |
| 66 | 40 | public Node jjtGetChild(int i) { |
| 67 | 41 | return children[i] |
| 70 | 44 | public int jjtGetNumChildren() { |
| 71 | 45 | return (children == null) ? 0 : children.length |
82
95
109
134 | 55
77 | if (children != null) { |
83
96
110
135 | 56
78 | for (int i = 0 |
83
96
110
135 | 56
78 | i < children.length |
83
96
110
135 | 56
78 | ++i) { |
84
97
111
136 | 79 | SimpleNode n = (SimpleNode)children[i] |
85
98
112
137 | 80 | if (n != null) { |
| 128 | 70 | public String toString(String prefix) { return prefix + toString() |
| 133 | 75 | public void dump(String prefix) { |
| 138 | 81 | n.dump(prefix + ) |
