HomeSort by relevance Sort by last modified time
    Searched defs:SplayTree (Results 1 - 8 of 8) sorted by null

  /external/v8/tools/
splaytree.js 37 function SplayTree() {
44 * @type {SplayTree.Node}
47 SplayTree.prototype.root_ = null;
53 SplayTree.prototype.isEmpty = function() {
67 SplayTree.prototype.insert = function(key, value) {
69 this.root_ = new SplayTree.Node(key, value);
78 var node = new SplayTree.Node(key, value);
98 * @return {SplayTree.Node} The removed node.
100 SplayTree.prototype.remove = function(key) {
129 * @return {SplayTree.Node} Node having the specified key
    [all...]
  /external/v8/benchmarks/spinning-balls/
splay-tree.js 36 function SplayTree() {
43 * @type {SplayTree.Node}
46 SplayTree.prototype.root_ = null;
52 SplayTree.prototype.isEmpty = function() {
65 SplayTree.prototype.insert = function(key, value) {
67 this.root_ = new SplayTree.Node(key, value);
76 var node = new SplayTree.Node(key, value);
96 * @return {SplayTree.Node} The removed node.
98 SplayTree.prototype.remove = function(key) {
127 * @return {SplayTree.Node} Node having the specified key
    [all...]
  /external/v8/benchmarks/
splay.js 46 var splayTree = null;
76 } while (splayTree.find(key) != null);
78 splayTree.insert(key, payload);
85 splayTree = new SplayTree();
94 var keys = splayTree.exportKeys();
95 splayTree = null;
116 var greatest = splayTree.findGreatestLessThan(key);
117 if (greatest == null) splayTree.remove(key);
118 else splayTree.remove(greatest.key)
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
v8-splay.js 41 var splayTree = null;
71 } while (splayTree.find(key) != null);
73 splayTree.insert(key, payload);
80 splayTree = new SplayTree();
89 var keys = splayTree.exportKeys();
90 splayTree = null;
111 var greatest = splayTree.findGreatestLessThan(key);
112 if (greatest == null) splayTree.remove(key);
113 else splayTree.remove(greatest.key)
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
v8-splay.js 41 var splayTree = null;
71 } while (splayTree.find(key) != null);
72 splayTree.insert(key, GeneratePayloadTree(kSplayTreePayloadDepth, key));
79 splayTree = new SplayTree();
88 var keys = splayTree.exportKeys();
89 splayTree = null;
110 var greatest = splayTree.findGreatestLessThan(key);
111 if (greatest == null) splayTree.remove(key);
112 else splayTree.remove(greatest.key)
    [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
v8-splay.js 41 var splayTree = null;
71 } while (splayTree.find(key) != null);
72 splayTree.insert(key, GeneratePayloadTree(kSplayTreePayloadDepth, key));
79 splayTree = new SplayTree();
88 var keys = splayTree.exportKeys();
89 splayTree = null;
110 var greatest = splayTree.findGreatestLessThan(key);
111 if (greatest == null) splayTree.remove(key);
112 else splayTree.remove(greatest.key)
    [all...]
  /external/v8/src/
splay-tree.h 52 // class SplayTree;
54 class SplayTree {
61 SplayTree() : root_(NULL) { }
62 ~SplayTree();
128 friend class SplayTree;
198 DISALLOW_COPY_AND_ASSIGN(SplayTree);
splay-tree-inl.h 38 SplayTree<Config, Allocator>::~SplayTree() {
45 bool SplayTree<Config, Allocator>::Insert(const Key& key, Locator* locator) {
69 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) {
84 bool SplayTree<Config, Allocator>::FindInternal(const Key& key) {
93 bool SplayTree<Config, Allocator>::Find(const Key& key, Locator* locator) {
104 bool SplayTree<Config, Allocator>::FindGreatestLessThan(const Key& key,
128 bool SplayTree<Config, Allocator>::FindLeastGreaterThan(const Key& key,
152 bool SplayTree<Config, Allocator>::FindGreatest(Locator* locator) {
164 bool SplayTree<Config, Allocator>::FindLeast(Locator* locator)
    [all...]

Completed in 127 milliseconds