| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
| LIST | 7 v8-splay
|
| v8-splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
86 // used by the splay tree no matter how we exit the
91 // Verify that the splay tree has the right size.
94 throw new Error("Splay tree has wrong size");
97 // Verify that the splay tree has sorted, unique keys.
100 throw new Error("Splay tree not sorted");
107 // Replace a few nodes in the splay tree.
118 * Constructs a Splay tree. A splay tree is a self-balancing binary
159 // Splay on the key to move the last node on the search path fo
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
| LIST | 7 v8-splay
|
| v8-splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
86 // used by the splay tree no matter how we exit the
91 // Verify that the splay tree has the right size.
94 throw new Error("Splay tree has wrong size");
97 // Verify that the splay tree has sorted, unique keys.
100 throw new Error("Splay tree not sorted");
107 // Replace a few nodes in the splay tree.
118 * Constructs a Splay tree. A splay tree is a self-balancing binary
159 // Splay on the key to move the last node on the search path fo
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
| LIST | 7 v8-splay
|
| v8-splay.js | 32 // used for old nodes. Because of the way splay trees work, the engine
87 // used by the splay tree no matter how we exit the
92 // Verify that the splay tree has the right size.
95 throw new Error("Splay tree has wrong size");
98 // Verify that the splay tree has sorted, unique keys.
101 throw new Error("Splay tree not sorted");
108 // Replace a few nodes in the splay tree.
119 * Constructs a Splay tree. A splay tree is a self-balancing binary
160 // Splay on the key to move the last node on the search path fo
[all...] |
| /external/clang/test/CXX/expr/expr.post/expr.ref/ |
| p3.cpp | 6 void splay( ) function in struct:Node
15 return n.splay();
|
| /external/chromium_org/v8/benchmarks/spinning-balls/ |
| index.html | 8 <script type="text/javascript" src="splay-tree.js"></script>
|
| 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/benchmarks/spinning-balls/ |
| index.html | 8 <script type="text/javascript" src="splay-tree.js"></script>
|
| 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.
|
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| 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...] |
| /external/chromium_org/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...] |
| /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...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| splay-tree.h | 1 /* A splay-tree datatype.
23 /* For an easily readable description of splay-trees, see:
28 The major feature of splay trees is that all basic tree operations
68 /* The type of a function which compares two splay-tree keys. The
85 the second is a data pointer the splay tree functions pass through
91 memory to be freed; the latter is a data pointer the splay tree
95 /* The nodes in the splay tree. */
108 /* The splay tree itself. */
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| splay-tree.h | 1 /* A splay-tree datatype.
23 /* For an easily readable description of splay-trees, see:
28 The major feature of splay trees is that all basic tree operations
68 /* The type of a function which compares two splay-tree keys. The
85 the second is a data pointer the splay tree functions pass through
91 memory to be freed; the latter is a data pointer the splay tree
95 /* The nodes in the splay tree. */
108 /* The splay tree itself. */
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| splay-tree.h | 1 /* A splay-tree datatype.
23 /* For an easily readable description of splay-trees, see:
28 The major feature of splay trees is that all basic tree operations
68 /* The type of a function which compares two splay-tree keys. The
85 the second is a data pointer the splay tree functions pass through
91 memory to be freed; the latter is a data pointer the splay tree
95 /* The nodes in the splay tree. */
108 /* The splay tree itself. */
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| splay-tree.h | 1 /* A splay-tree datatype.
23 /* For an easily readable description of splay-trees, see:
28 The major feature of splay trees is that all basic tree operations
68 /* The type of a function which compares two splay-tree keys. The
85 the second is a data pointer the splay tree functions pass through
91 memory to be freed; the latter is a data pointer the splay tree
95 /* The nodes in the splay tree. */
108 /* The splay tree itself. */
|
| /external/chromium_org/v8/src/ |
| splay-tree-inl.h | 31 #include "splay-tree.h"
51 // Splay on the key to move the last node on the search path
53 Splay(key);
88 Splay(key);
115 // Splay on the key to move the node with the given key or the last
117 Splay(key);
139 // Splay on the key to move the node with the given key or the last
141 Splay(key);
189 Splay(new_key);
223 // Splay to make sure that the new root has an empty right child
[all...] |
| /external/v8/src/ |
| splay-tree-inl.h | 31 #include "splay-tree.h"
50 // Splay on the key to move the last node on the search path
52 Splay(key);
87 Splay(key);
108 // Splay on the key to move the node with the given key or the last
110 Splay(key);
132 // Splay on the key to move the node with the given key or the last
134 Splay(key);
182 Splay(new_key);
216 // Splay to make sure that the new root has an empty right child
[all...] |
| splay-tree.h | 37 // A splay tree. The config type parameter encapsulates the different
38 // configurations of a concrete splay tree:
101 // Perform the splay operation for the given key. Moves the node with
105 void Splay(const Key& key);
|
| /external/chromium-trace/trace-viewer/src/tracing/importer/v8/ |
| splaytree.js | 8 * @fileoverview Splay tree used by CodeMap.
12 * Constructs a Splay tree. A splay tree is a self-balancing binary
54 // Splay on the key to move the last node on the search path for
96 // 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
199 * Perform the splay operation for the given key. Moves the node with
205 * @param {number} key Key to splay the tree on.
291 * Constructs a Splay tree node.
|
| /external/chromium_org/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.
|
| /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.
|
| /external/skia/tests/ |
| ColorPrivTest.cpp | 8 DEF_TEST(Splay, r) {
|
