Skip to content

Remove start attribute from ZSTree. #95

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed

Remove start attribute from ZSTree. #95

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 6 additions & 9 deletions core/src/main/java/com/github/gumtreediff/matchers/optimal/zs/ZsMatcher.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -176,8 +176,6 @@ private double getUpdateCost(ITree n1, ITree n2) {

private static final class ZsTree {

private int start; // internal array position of leafmost leaf descendant of the root node

private int nodeCount; // number of nodes

private int leafCount;
Expand All @@ -189,11 +187,10 @@ private static final class ZsTree {
private int[] kr;

private ZsTree(ITree t) {
this.start = 0;
this.nodeCount = t.getSize();
this.leafCount = 0;
this.llds = new int[start + nodeCount];
this.labels = new ITree[start + nodeCount];
this.llds = new int[nodeCount];
this.labels = new ITree[nodeCount];

int idx = 1;
Map<ITree,Integer> tmpData = new HashMap<>();
Expand All @@ -210,13 +207,13 @@ private ZsTree(ITree t) {
}

public void setITree(int i, ITree tree) {
labels[i + start - 1] = tree;
labels[i - 1] = tree;
if (nodeCount < i)
nodeCount = i;
}

public void setLld(int i, int lld) {
llds[i + start - 1] = lld + start - 1;
llds[i - 1] = lld - 1;
if (nodeCount < i)
nodeCount = i;
}
Expand All @@ -226,11 +223,11 @@ public boolean isLeaf(int i) {
}

public int lld(int i) {
return llds[i + start - 1] - start + 1;
return llds[i - 1] + 1;
}

public ITree tree(int i) {
return labels[i + start - 1];
return labels[i - 1];
}

public void setKeyRoots() {
Expand Down