OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:splay
(Results
1 - 25
of
147
) sorted by null
1
2
3
4
5
6
/external/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/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/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/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/
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/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/importer/v8/
splaytree.js
7
* @fileoverview
Splay
tree used by CodeMap.
11
* Constructs a
Splay
tree. A
splay
tree is a self-balancing binary
53
//
Splay
on the key to move the last node on the search path for
95
//
Splay
to make sure that the new root has an empty right child.
160
//
Splay
on the key to move the node with the given key or the last
198
* Perform the
splay
operation for the given key. Moves the node with
204
* @param {number} key Key to
splay
the tree on.
290
* 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.
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/splay_tree_/
erase_fn_imps.hpp
112
splay
(p_nd);
135
splay
(p_target_r);
find_fn_imps.hpp
48
splay
(p_found);
59
const_cast<PB_DS_CLASS_C_DEC* >(this)->
splay
(p_found);
split_join_fn_imps.hpp
57
other.
splay
(p_target_r);
95
splay
(p_upper_bound);
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/splay_tree_/
erase_fn_imps.hpp
112
splay
(p_nd);
135
splay
(p_target_r);
find_fn_imps.hpp
48
splay
(p_found);
59
const_cast<PB_DS_CLASS_C_DEC* >(this)->
splay
(p_found);
split_join_fn_imps.hpp
57
other.
splay
(p_target_r);
95
splay
(p_upper_bound);
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/splay_tree_/
erase_fn_imps.hpp
112
splay
(p_nd);
135
splay
(p_target_r);
Completed in 4313 milliseconds
1
2
3
4
5
6