Searched refs:findGreatestLessThan (Results 1 – 12 of 12) sorted by relevance
141 assertEquals(null, tree.findGreatestLessThan(10));145 assertEquals('right', tree.findGreatestLessThan(10).value);146 assertEquals('right', tree.findGreatestLessThan(7).value);147 assertEquals('root', tree.findGreatestLessThan(6).value);148 assertEquals('left', tree.findGreatestLessThan(4).value);149 assertEquals(null, tree.findGreatestLessThan(2));
155 var node = tree.findGreatestLessThan(addr);177 var node = tree.findGreatestLessThan(addr);
174 SplayTree.prototype.findGreatestLessThan = function(key) { method in SplayTree
139 var node = tree.findGreatestLessThan(addr);161 var node = tree.findGreatestLessThan(addr);
156 SplayTree.prototype.findGreatestLessThan = function(key) { method in SplayTree
110 var greatest = splayTree.findGreatestLessThan(key);231 SplayTree.prototype.findGreatestLessThan = function(key) { method in SplayTree
111 var greatest = splayTree.findGreatestLessThan(key);247 SplayTree.prototype.findGreatestLessThan = function(key) { method in SplayTree
116 var greatest = splayTree.findGreatestLessThan(key);252 SplayTree.prototype.findGreatestLessThan = function(key) { method in SplayTree
157 SplayTree.prototype.findGreatestLessThan = function(key) { method in SplayTree
184 var greatest = splayTree.findGreatestLessThan(key);
315 for(c=c||this.root_;c.right;)c=c.right;return c};d.prototype.findGreatestLessThan=function(c){if(th… method in d320 …findGreatestLessThan(e);if(!g)break;e=g.key;g=e+g.value.size;e<b&&a<g&&d.push(e);e-=1}a=0;for(b=d.…