1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
/* LabeledBinaryTree.java
* =========================================================================
* This file is part of the GrInvIn project - http://www.grinvin.org
*
* Copyright (C) 2005-2008 Universiteit Gent
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* A copy of the GNU General Public License can be found in the file
* LICENSE.txt provided with the source distribution of this program (see
* the META-INF directory in the source jar). This license can also be
* found on the GNU website at http://www.gnu.org/licenses/gpl.html.
*
* If you did not receive a copy of the GNU General Public License along
* with this program, contact the lead developer, or write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301, USA.
*/
package org.grinvin.conjecture.engine.apengine;
import org.grinvin.conjecture.engine.apengine.Operators.Operator;
/**
* A binary tree that can be labeled.
*/
public class LabeledBinaryTree extends BinaryTree {
//
public Operator[] operators;
public LabeledBinaryTree(int unaryOperators, int binaryOperators) {
super(unaryOperators, binaryOperators);
operators = new Operator[(unaryOperators + (2 * binaryOperators) + 1) * 2];
}
private LabeledBinaryTree(int[] newcontents, int firstfreeposition, int unaryCount, int binaryCount, Operator[] newoperators ) {
super(newcontents, firstfreeposition, unaryCount, binaryCount);
operators = new Operator[newoperators.length];
System.arraycopy(newoperators, 0, operators, 0, newoperators.length);
}
//
public LabeledBinaryTree clone() {
return new LabeledBinaryTree(contents, firstfreepos, unaryCount, binaryCount, operators);
}
//
protected String toString(int parent) {
if (operators[parent] != null) {
String[] args = new String[childCount(parent)];
int[] children = children(parent);
for (int i=0; i < childCount(parent); i++) {
args[i] = toString(children[i]);
}
return "(" + operators[parent].renderString(args) + ")";
} else { // unlabeled node
return super.toString(parent);
}
}
/**
* Label the node at position {@code pos} with {@link Operator} {@code op}.
*/
public final void labelNode(int pos, Operator op) {
operators[pos] = op;
}
}
|
