Lines Matching defs:trees
79 private static long actuallyMut = 0; // pointer mutations in old trees
85 private static TreeNode[] trees;
86 private static int where = 0; // roving index into trees
167 // Allocates approximately size megabytes of trees and stores
172 trees = new TreeNode[ntrees];
174 System.err.println("Allocating " + ntrees + " trees.");
177 trees[i] = makeTree(treeHeight);
186 // Confirms that all trees are balanced and have the correct height.
189 int ntrees = trees.length;
191 TreeNode t = trees[i];
238 // System.out.println("In oldGenAlloc, doing " + full + " full trees "
241 trees[where++] = makeTree(treeHeight);
242 if (where == trees.length) where = 0;
247 replaceTree(trees[where++], newTree);
248 if (where == trees.length) where = 0;
260 int index1 = rnd.nextInt(trees.length);
261 int index2 = rnd.nextInt(trees.length);
264 TreeNode tn1 = trees[index1];
265 TreeNode tn2 = trees[index2];