1 // Copyright 2003 Adam Megacz, see the COPYING file for licensing [GPL]
4 // FEATURE: private void intersection() { }
5 // FEATURE: private void union() { }
6 // FEATURE: private void subset() { }
7 // FEATURE: grow if we run out of slots
10 /** a weight-balanced tree with fake leaves */
11 public class BalancedTree {
14 // Instance Variables ///////////////////////////////////////////////////////////////////
16 private int root = 0; ///< the slot of the root element
18 private int cached_index = -1;
19 private int cached_slot = -1;
21 // Public API //////////////////////////////////////////////////////////////////////////
23 /** the number of elements in the tree */
24 public final int treeSize() { return root == 0 ? 0 : size[root]; }
26 /** clamps index to [0..treeSize()] and inserts object o *before* the specified index */
27 public final void insertNode(int index, Object o) {
28 cached_slot = cached_index = -1;
29 if (index < 0) index = 0;
30 if (index > treeSize()) index = treeSize();
31 int arg = allocateSlot(o);
32 if (root != 0) { insert(index, arg, root, 0, false, false); return; }
39 /** clamps index to [0..treeSize()-1] and replaces the object at that index with object o */
40 public final void replaceNode(int index, Object o) {
41 cached_slot = cached_index = -1;
42 if (index < 0) index = 0;
43 if (index > treeSize()) index = treeSize() - 1;
44 int arg = allocateSlot(o);
45 if (root != 0) { insert(index, arg, root, 0, true, false); return; }
51 /** returns the index of o; runs in O((log n)^2) time unless cache hit */
52 public final int indexNode(Object o) {
53 if (cached_slot != -1 && objects[cached_slot] == o) return cached_index;
55 int slot = getSlot(o, o.hashCode() ^ this.hashCode());
56 int parent = -1 * left[leftmost(slot)];
57 if (parent == 0) return size(left[slot]); // we are on the far left edge
59 // all nodes after parent and before us are in our left subtree
60 return size(left[slot]) + indexNode(objects[parent]) + 1;
63 /** returns the object at index; runs in O(log n) time unless cache hit */
64 public final Object getNode(int index) {
65 if (index == cached_index) return objects[cached_slot];
67 if (cached_index != -1) {
68 int distance = Math.abs(index - cached_index);
69 // if the in-order distance between the cached node and the
70 // target node is less than log(n), it's probably faster to
72 if ((distance < 16) && ((2 << distance) < treeSize())) {
73 while(cached_index > index) { cached_slot = prev(cached_slot); cached_index--; }
74 while(cached_index < index) { cached_slot = next(cached_slot); cached_index++; }
75 return objects[cached_slot];
80 cached_slot = get(index, root);
81 return objects[cached_slot];
84 /** deletes the object at index, returning the deleted object */
85 public final Object deleteNode(int index) {
86 cached_slot = cached_index = -1;
87 int del = delete(index, root, 0);
88 left[del] = right[del] = size[del] = 0;
89 Object ret = objects[del];
95 // Node Data /////////////////////////////////////////////////////////////////////////
97 private final static int NUM_SLOTS = 64 * 1024;
100 * Every object inserted into *any* tree gets a "slot" in this
101 * array. The slot is determined by hashcode modulo the length of
102 * the array, with quadradic probing to resolve collisions. NOTE
103 * that the "slot" of a node is NOT the same as its index.
104 * Furthermore, if an object is inserted into multiple trees, that
105 * object will have multiple slots.
107 private static Object[] objects = new Object[NUM_SLOTS];
109 /// These two arrays hold the left and right children of each
110 /// slot; in other words, left[x] is the *slot* of the left child
111 /// of the node in slot x.
113 /// If x has no left child, then left[x] is -1 multiplied by the
114 /// slot of the node that precedes x; if x is the first node, then
115 /// left[x] is 0. The right[] array works the same way.
117 private static int[] left = new int[NUM_SLOTS];
118 private static int[] right = new int[NUM_SLOTS];
120 ///< the number of descendants of this node *including the node itself*
121 private static int[] size = new int[NUM_SLOTS];
124 // Slot Management //////////////////////////////////////////////////////////////////////
126 /** returns the slot holding object o; use null to allocate a new slot */
127 private int getSlot(Object o, int hash) {
128 // FIXME: check for full table
129 int dest = Math.abs(hash) % objects.length;
133 while (objects[dest] != o) {
134 if (dest == 0) dest++;
135 dest = Math.abs((odest + (plus ? 1 : -1) * tries * tries) % objects.length);
142 /** allocates a new slot */
143 private int allocateSlot(Object o) {
144 // we XOR with our own hashcode so that we don't get tons of
145 // collisions when a single Object is inserted into multiple
147 int slot = getSlot(null, o.hashCode() ^ this.hashCode());
154 // Helpers /////////////////////////////////////////////////////////////////////////
156 private final int leftmost(int slot) { return left[slot] <= 0 ? slot : leftmost(left[slot]); }
157 private final int rightmost(int slot) { return right[slot] <= 0 ? slot : rightmost(right[slot]); }
158 private final int next(int slot) { return right[slot] <= 0 ? -1 * right[slot] : leftmost(right[slot]); }
159 private final int prev(int slot) { return left[slot] <= 0 ? -1 * left[slot] : rightmost(left[slot]); }
160 private final int size(int slot) { return slot <= 0 ? 0 : size[slot]; }
163 // Rotation and Balancing /////////////////////////////////////////////////////////////
172 // FIXME might be doing too much work here
173 private void rotate(boolean toTheLeft, int b, int parent) {
174 int[] left = toTheLeft ? BalancedTree.left : BalancedTree.right;
175 int[] right = toTheLeft ? BalancedTree.right : BalancedTree.left;
178 if (d <= 0) throw new Error("rotation error");
181 if (parent == 0) root = d;
182 else if (left[parent] == b) left[parent] = d;
183 else if (right[parent] == b) right[parent] = d;
184 else throw new Error("rotate called with invalid parent");
189 private void balance(int slot, int parent) {
190 if (slot <= 0) return;
191 size[slot] = 1 + size(left[slot]) + size(right[slot]);
192 if (size(left[slot]) - 1 > 2 * size(right[slot])) rotate(false, slot, parent);
193 else if (size(left[slot]) * 2 < size(right[slot]) - 1) rotate(true, slot, parent);
198 // Insert /////////////////////////////////////////////////////////////////////////
200 private void insert(int index, int arg, int slot, int parent, boolean replace, boolean wentLeft) {
201 int diff = slot <= 0 ? 0 : index - size(left[slot]);
202 if (slot > 0 && diff != 0) {
203 if (diff < 0) insert(index, arg, left[slot], slot, replace, true);
204 else insert(index - size(left[slot]) - 1, arg, right[slot], slot, replace, false);
205 balance(slot, parent);
209 if (size[arg] != 0) throw new Error("double insertion");
213 objects[slot] = objects[arg];
215 left[arg] = right[arg] = size[arg] = 0;
217 // since we already clamped the index
218 throw new Error("this should never happen");
222 // we become the child of a former leaf
224 int[] left = wentLeft ? BalancedTree.left : BalancedTree.right;
225 int[] right = wentLeft ? BalancedTree.right : BalancedTree.left;
228 right[arg] = -1 * parent;
229 balance(arg, parent);
231 // we take the place of a preexisting node
233 left[arg] = left[slot]; // steal slot's left subtree
234 left[slot] = -1 * arg;
235 right[arg] = slot; // make slot our right subtree
240 (left[parent] == slot ? left : right)[parent] = arg;
242 balance(arg, parent);
248 // Retrieval //////////////////////////////////////////////////////////////////////
250 private int get(int index, int slot) {
251 int diff = index - size(left[slot]);
252 if (diff > 0) return get(diff - 1, right[slot]);
253 else if (diff < 0) return get(index, left[slot]);
258 // Deletion //////////////////////////////////////////////////////////////////////
260 private int delete(int index, int slot, int parent) {
261 int diff = index - size(left[slot]);
263 int ret = delete(index, left[slot], slot);
264 balance(slot, parent);
267 } else if (diff > 0) {
268 int ret = delete(diff - 1, right[slot], slot);
269 balance(slot, parent);
272 // we found the node to delete
275 // fast path: it has no children
276 if (left[slot] <= 0 && right[slot] <= 0) {
277 if (parent == 0) root = 0;
279 int[] side = left[parent] == slot ? left : right;
280 side[parent] = side[slot]; // fix parent's pointer
283 // fast path: it has no left child, so we replace it with its right child
284 } else if (left[slot] <= 0) {
285 if (parent == 0) root = right[slot];
286 else (left[parent] == slot ? left : right)[parent] = right[slot]; // fix parent's pointer
287 if (right[slot] > 0) left[leftmost(right[slot])] = left[slot]; // fix our successor-leaf's fake right ptr
288 balance(right[slot], parent);
290 // fast path; it has no right child, so we replace it with its left child
291 } else if (right[slot] <= 0) {
292 if (parent == 0) root = left[slot];
293 else (left[parent] == slot ? left : right)[parent] = left[slot]; // fix parent's pointer
294 if (left[slot] > 0) right[rightmost(left[slot])] = right[slot]; // fix our successor-leaf's fake right ptr
295 balance(left[slot], parent);
297 // node to be deleted has two children, so we replace it with its left child's rightmost descendant
299 int left_childs_rightmost = delete(size(left[slot]) - 1, left[slot], slot);
300 left[left_childs_rightmost] = left[slot];
301 left[left_childs_rightmost] = right[slot];
302 if (parent == 0) root = left_childs_rightmost;
303 else (left[parent] == slot ? left : right)[parent] = left_childs_rightmost; // fix parent's pointer
304 balance(left_childs_rightmost, parent);