HomeSort by relevance Sort by last modified time
    Searched refs:splay (Results 1 - 5 of 5) sorted by null

  /external/clang/test/CXX/expr/expr.post/expr.ref/
p3.cpp 6 void splay( ) function in struct:Node
15 return n.splay();
  /external/v8/benchmarks/
splay.js 32 // used for old nodes. Because of the way splay trees work, the engine
36 var Splay = new BenchmarkSuite('Splay', 81491, [
37 new Benchmark("Splay", SplayRun, SplaySetup, SplayTearDown)
92 // used by the splay tree no matter how we exit the
97 // Verify that the splay tree has the right size.
100 throw new Error("Splay tree has wrong size");
103 // Verify that the splay tree has sorted, unique keys.
106 throw new Error("Splay tree not sorted");
113 // Replace a few nodes in the splay tree
    [all...]
run.js 36 load('splay.js');
  /external/v8/benchmarks/spinning-balls/
splay-tree.js 29 * Constructs a Splay tree. A splay tree is a self-balancing binary
70 // Splay on the key to move the last node on the search path for
112 // Splay to make sure that the new root has an empty right child.
161 // Splay on the key to move the node with the given key or the last
189 * Perform the splay operation for the given key. Moves the node with
195 * @param {number} key Key to splay the tree on.
261 * Constructs a Splay tree node.
  /external/v8/tools/
splaytree.js 30 * Constructs a Splay tree. A splay tree is a self-balancing binary
72 // Splay on the key to move the last node on the search path for
114 // Splay to make sure that the new root has an empty right child.
178 // Splay on the key to move the node with the given key or the last
215 * Perform the splay operation for the given key. Moves the node with
221 * @param {number} key Key to splay the tree on.
307 * Constructs a Splay tree node.

Completed in 794 milliseconds