Package haikuvm.bench.from.darjeeling.testvm.classes

Examples of haikuvm.bench.from.darjeeling.testvm.classes.TreeNode

63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
    synchronized(lock)
    {
            Darjeeling.assertTrue(testBase+0, true);
            byte numbers[] = new byte[] { 21,6,36,76,7,97,94,30,90,86,13,80,84,79,28,55,36,95,23 };
     
      TreeNode rootNode = new TreeNode(numbers[0]);
     
      for (int i=1; i<numbers.length; i++)
      {
        rootNode.insert(new TreeNode(numbers[i]));
      }
     
      // should leave tree intact since we have a ref to the rootnode
      // in the current frame
      recurseTree(rootNode, (short)0, numbers);
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
85
    byte numbers[] = new byte[] {
        21,  6, 36, 76,  7, 97, 94, 30, 90, 86,
        13, 80, 84, 79, 28, 55, 36, 95, 23, 82
        };   

    TreeNode rootNode = new TreeNode(numbers[0]);
    for (int i=1; i<numbers.length; i++)
    {
      rootNode.insert(new TreeNode(numbers[i]));
    }
   
    // should leave tree intact since we have a ref to the rootnode
    // in the current frame
    System.gc();
View Full Code Here
TOP

Related Classes of haikuvm.bench.from.darjeeling.testvm.classes.TreeNode

  • haikuvm.bench.from.darjeeling.GarbageCollectionTest
  • haikuvm.bench.from.darjeeling.StackUsageTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.