Home
last modified time | relevance | path

Searched refs:SplayTree (Results 1 – 11 of 11) sorted by relevance

/external/v8/tools/
Dsplaytree.js37 function SplayTree() { class
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);
100 SplayTree.prototype.remove = function(key) {
131 SplayTree.prototype.find = function(key) {
143 SplayTree.prototype.findMin = function() {
158 SplayTree.prototype.findMax = function(opt_startNode) {
[all …]
Dcodemap.js38 this.dynamics_ = new SplayTree();
48 this.statics_ = new SplayTree();
53 this.libraries_ = new SplayTree();
/external/v8/benchmarks/spinning-balls/
Dsplay-tree.js36 function SplayTree() { class
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);
98 SplayTree.prototype.remove = function(key) {
129 SplayTree.prototype.find = function(key) {
141 SplayTree.prototype.findMax = function(opt_startNode) {
157 SplayTree.prototype.findGreatestLessThan = function(key) {
[all …]
Dv.js480 splayTree = new SplayTree();
/external/v8/benchmarks/
Dsplay.js85 splayTree = new SplayTree();
131 function SplayTree() { class
141 SplayTree.prototype.root_ = null;
147 SplayTree.prototype.isEmpty = function() {
160 SplayTree.prototype.insert = function(key, value) {
162 this.root_ = new SplayTree.Node(key, value);
171 var node = new SplayTree.Node(key, value);
193 SplayTree.prototype.remove = function(key) {
224 SplayTree.prototype.find = function(key) {
236 SplayTree.prototype.findMax = function(opt_startNode) {
[all …]
/external/v8/src/
Dsplay-tree-inl.h15 SplayTree<Config, Allocator>::~SplayTree() { in ~SplayTree()
22 bool SplayTree<Config, Allocator>::Insert(const Key& key, in Insert()
47 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) { in InsertInternal()
62 bool SplayTree<Config, Allocator>::FindInternal(const Key& key) { in FindInternal()
71 bool SplayTree<Config, Allocator>::Contains(const Key& key) { in Contains()
77 bool SplayTree<Config, Allocator>::Find(const Key& key, Locator* locator) { in Find()
88 bool SplayTree<Config, Allocator>::FindGreatestLessThan(const Key& key, in FindGreatestLessThan()
112 bool SplayTree<Config, Allocator>::FindLeastGreaterThan(const Key& key, in FindLeastGreaterThan()
136 bool SplayTree<Config, Allocator>::FindGreatest(Locator* locator) { in FindGreatest()
148 bool SplayTree<Config, Allocator>::FindLeast(Locator* locator) { in FindLeast()
[all …]
Dsplay-tree.h31 class SplayTree {
38 explicit SplayTree(AllocationPolicy allocator = AllocationPolicy())
40 ~SplayTree();
126 friend class SplayTree;
197 DISALLOW_COPY_AND_ASSIGN(SplayTree);
Dzone.h230 class ZoneSplayTree final : public SplayTree<Config, ZoneAllocationPolicy> {
233 : SplayTree<Config, ZoneAllocationPolicy>(ZoneAllocationPolicy(zone)) {} in ZoneSplayTree()
238 SplayTree<Config, ZoneAllocationPolicy>::ResetRoot(); in ~ZoneSplayTree()
Dglobals.h431 class SplayTree; variable
Dgdb-jit.cc2000 typedef SplayTree<SplayTreeConfig> CodeMap;
/external/v8/test/mjsunit/tools/
Dsplaytree.js33 var tree = new SplayTree();
41 var tree = new SplayTree();
82 var tree = new SplayTree();
96 var tree = new SplayTree();
106 var tree = new SplayTree();
120 var tree = new SplayTree();
130 var tree = new SplayTree();
140 var tree = new SplayTree();
154 var tree = new SplayTree();