projects
/
org.ibex.core.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
move JS's Hashtable to JS.O
[org.ibex.core.git]
/
src
/
org
/
ibex
/
util
/
BalancedTree.java
diff --git
a/src/org/ibex/util/BalancedTree.java
b/src/org/ibex/util/BalancedTree.java
index
3fd04d8
..
24c474d
100644
(file)
--- a/
src/org/ibex/util/BalancedTree.java
+++ b/
src/org/ibex/util/BalancedTree.java
@@
-25,8
+25,6
@@
public class BalancedTree {
private int cached_index = -1;
private int cached_slot = -1;
private int cached_index = -1;
private int cached_slot = -1;
- private FinalizationHelper fh;
-
// Public API //////////////////////////////////////////////////////////////////////////
/** the number of elements in the tree */
// Public API //////////////////////////////////////////////////////////////////////////
/** the number of elements in the tree */
@@
-47,7
+45,6
@@
public class BalancedTree {
if (root != 0) {
insert(index, arg, root, 0, false, false);
} else {
if (root != 0) {
insert(index, arg, root, 0, false, false);
} else {
- if(fh == null) fh = new FinalizationHelper(this);
root = arg;
left[arg] = right[arg] = parent[arg] = 0;
size[arg] = 1;
root = arg;
left[arg] = right[arg] = parent[arg] = 0;
size[arg] = 1;
@@
-425,12
+422,8
@@
public class BalancedTree {
return slot;
}
}
return slot;
}
}
-
- static class FinalizationHelper {
- private BalancedTree bt;
- FinalizationHelper(BalancedTree bt) { this.bt = bt; }
- protected void finalize() { bt.clear(); }
- }
+
+ protected void finalize() { clear(); }
// Debugging ///////////////////////////////////////////////////////////////////////////
// Debugging ///////////////////////////////////////////////////////////////////////////
@@
-487,7
+480,7
@@
public class BalancedTree {
}
}
}
}
- public static void main(String[] args) {
+ /*public static void main(String[] args) {
BalancedTree t = new BalancedTree();
for(int i=0;i<args.length;i++)
t.insertNode(i,args[i]);
BalancedTree t = new BalancedTree();
for(int i=0;i<args.length;i++)
t.insertNode(i,args[i]);
@@
-498,5
+491,5
@@
public class BalancedTree {
for(int n = t.rightmost(t.root); n != 0; n = t.prev(n)) {
System.err.println("Prev: " + n);
}
for(int n = t.rightmost(t.root); n != 0; n = t.prev(n)) {
System.err.println("Prev: " + n);
}
- }
+ }*/
}
}