HomeSort by relevance Sort by last modified time
    Searched full:splay (Results 26 - 50 of 133) sorted by null

12 3 4 5 6

  /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_/
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);
splay_tree_.hpp 38 * Contains an implementation class for splay trees.
102 * @brief Splay tree.
176 splay(ins_pair.first.m_p_nd);
229 splay(node_pointer);
insert_fn_imps.hpp 50 splay(ins_pair.first.m_p_nd);
node.hpp 48 /// Node for splay tree.
  /external/curl/lib/
splay.h 33 void *payload; /* data the splay code doesn't care about */
Makefile.inc 48 inet_ntop.c parsedate.c select.c tftp.c splay.c strdup.c socks.c \
67 easyif.h multiif.h parsedate.h tftp.h sockaddr.h splay.h strdup.h \
splay.c 25 #include "splay.h"
37 * Splay using the key i (which may or may not be in the tree.) The starting
  /external/skia/tests/
ColorPrivTest.cpp 14 DEF_TEST(Splay, r) {
  /external/skqp/tests/
ColorPrivTest.cpp 14 DEF_TEST(Splay, r) {
  /external/v8/benchmarks/
run.js 36 load('splay.js');
README.txt 48 The Splay benchmark is a newcomer in version 4. It manipulates a
49 splay tree by adding and removing data nodes, thus exercising the
70 typos in the DeltaBlue implementation. Changed the Splay benchmark to
revisions.html 30 typos in the DeltaBlue implementation. Changed the Splay benchmark to
51 <p>The <i>Splay</i> benchmark is a newcomer in version 4. It
52 manipulates a splay tree by adding and removing data nodes, thus
run.html 16 <script type="text/javascript" src="splay.js"></script>
120 <li><b>Splay</b><br>Data manipulation benchmark that deals with splay trees and exercises the automatic memory management subsystem (<i>394 lines</i>).</li>
  /external/v8/src/zone/
zone.h 14 #include "src/splay-tree.h"
206 // A zone splay tree. The config type parameter encapsulates the
207 // different configurations of a concrete splay tree (see splay-tree.h).
  /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_/
splay_tree_.hpp 38 * Contains an implementation class for splay trees.
102 * @brief Splay tree.
176 splay(ins_pair.first.m_p_nd);
229 splay(node_pointer);
insert_fn_imps.hpp 50 splay(ins_pair.first.m_p_nd);
node.hpp 48 /// Node for splay tree.
  /external/ImageMagick/MagickCore/
nt-base-private.h 24 #include "MagickCore/splay-tree.h"
Android.mk 88 splay-tree.c\
deprecate.c 85 #include "MagickCore/splay-tree.h"
Make.com 101 $call Make splay-tree.c
156 segment, semaphore, shear, signature, splay-tree, static, stream, string, -
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
tree-dump.h 24 #include "splay-tree.h"
  /external/libevent/WIN32-Code/
tree.h 32 * splay trees and red-black trees.
34 * A splay tree is a self-organizing data structure. Every operation
35 * on the tree causes a splay to happen. The splay moves the requested
44 * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
153 /* Main splay operation.
237 /* Splay with either the minimum or the maximum element \
  /external/curl/packages/Symbian/group/
libcurl.mmp 33 select.c vtls/gtls.c vtls/vtls.c tftp.c splay.c strdup.c socks.c \

Completed in 749 milliseconds

12 3 4 5 6