HomeSort by relevance Sort by last modified time
    Searched defs:SplayTree (Results 1 - 5 of 5) 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/v8/src/
splay-tree-inl.h 15 SplayTree<Config, Allocator>::~SplayTree() {
22 bool SplayTree<Config, Allocator>::Insert(const Key& key,
47 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) {
62 bool SplayTree<Config, Allocator>::FindInternal(const Key& key) {
71 bool SplayTree<Config, Allocator>::Contains(const Key& key) {
77 bool SplayTree<Config, Allocator>::Find(const Key& key, Locator* locator) {
88 bool SplayTree<Config, Allocator>::FindGreatestLessThan(const Key& key,
112 bool SplayTree<Config, Allocator>::FindLeastGreaterThan(const Key& key,
136 bool SplayTree<Config, Allocator>::FindGreatest(Locator* locator)
    [all...]
splay-tree.h 29 // class SplayTree;
31 class SplayTree {
38 explicit SplayTree(AllocationPolicy allocator = AllocationPolicy())
40 ~SplayTree();
126 friend class SplayTree;
197 DISALLOW_COPY_AND_ASSIGN(SplayTree);

Completed in 227 milliseconds