/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/ |
v8.json | 13 {"name": "Splay"},
|
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/src/ |
splay-tree-inl.h | 8 #include "src/splay-tree.h" 28 // Splay on the key to move the last node on the search path 30 Splay(key); 65 Splay(key); 92 // Splay on the key to move the node with the given key or the last 94 Splay(key); 116 // Splay on the key to move the node with the given key or the last 118 Splay(key); 166 Splay(new_key); 200 // Splay to make sure that the new root has an empty right child [all...] |
splay-tree.h | 14 // A splay tree. The config type parameter encapsulates the different 15 // configurations of a concrete splay tree: 94 // Perform the splay operation for the given key. Moves the node with 98 void Splay(const Key& key);
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
rotatingtree.h | 3 * Google "splay trees" for the general idea.
|
/external/autotest/server/site_tests/native_Benchmarks/ |
octane.tar.bz2 | |
/external/python/cpython2/Modules/ |
rotatingtree.h | 3 * Google "splay trees" for the general idea.
|
/external/python/cpython3/Modules/ |
rotatingtree.h | 3 * Google "splay trees" for the general idea.
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/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 61 /* The type of a function which compares two splay-tree keys. The 78 the second is a data pointer the splay tree functions pass through 84 memory to be freed; the latter is a data pointer the splay tree 88 /* The nodes in the splay tree. */ 101 /* The splay tree itself. */
|
/toolchain/binutils/binutils-2.27/include/ |
splay-tree.h | 1 /* A splay-tree datatype. 22 /* For an easily readable description of splay-trees, see: 27 The major feature of splay trees is that all basic tree operations 56 /* The type of a function which compares two splay-tree keys. The 73 the second is a data pointer the splay tree functions pass through 79 memory to be freed; the latter is a data pointer the splay tree 83 /* The nodes in the splay tree. */ 96 /* The splay tree itself. */
|
/external/toolchain-utils/crosperf/ |
unittest_keyval_file.txt | 14 {"description": "Splay", "graph": "Splay", "higher_is_better": true, "units": "score", "value": 4425}
|
/toolchain/binutils/binutils-2.27/libiberty/ |
splay-tree.c | 1 /* A splay-tree datatype. 23 /* For an easily readable description of splay-trees, see: 39 #include "splay-tree.h" 136 /* Bottom up splay of key. */ 215 for large trees. Splay trees are worst case O(n) in the depth of 267 /* Allocate a new splay tree, using COMPARE_FN to compare nodes, 269 values. Use xmalloc to allocate the splay tree structure, and any 283 /* Allocate a new splay tree, using COMPARE_FN to compare nodes, 312 This function creates a splay tree that uses two different allocators 317 The splay tree will use @var{compare_fn} to compare nodes [all...] |
/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/ImageMagick/MagickCore/ |
splay-tree.c | 42 % This module implements the standard handy splay-tree methods for storing and 58 #include "MagickCore/splay-tree.h" 140 % AddValueToSplayTree() adds the given key and value to the splay-tree. Both 151 % o splay_tree: the splay-tree info. 238 % BalanceSplayTree() balances the splay-tree. 246 % o splay_tree: the splay-tree info. 320 % CloneSplayTree() clones the splay tree. 329 % o splay_tree: the splay tree. 332 % whenever a key is added to the splay-tree. 335 % whenever a value object is added to the splay-tree [all...] |
nt-feature.h | 23 #include "MagickCore/splay-tree.h"
|
splay-tree.h | 16 MagickCore splay-tree methods.
|
xml-tree-private.h | 22 #include "MagickCore/splay-tree.h"
|
/external/curl/tests/unit/ |
unit1309.c | 24 #include "splay.h" 70 /* number of nodes to add to the splay tree */
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/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-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/splay_tree_/ |
erase_fn_imps.hpp | 112 splay(p_nd); 135 splay(p_target_r);
|