/external/v8/benchmarks/spinning-balls/ |
H A D | splay-tree.js | 46 SplayTree.prototype.root_ = null; 53 return !this.root_; 67 this.root_ = new SplayTree.Node(key, value); 73 if (this.root_.key == key) { 77 if (key > this.root_.key) { 78 node.left = this.root_; 79 node.right = this.root_.right; 80 this.root_.right = null; 82 node.right = this.root_; 83 node.left = this.root_ [all...] |
/external/v8/tools/ |
H A D | splaytree.js | 47 SplayTree.prototype.root_ = null; 54 return !this.root_; 69 this.root_ = new SplayTree.Node(key, value); 75 if (this.root_.key == key) { 79 if (key > this.root_.key) { 80 node.left = this.root_; 81 node.right = this.root_.right; 82 this.root_.right = null; 84 node.right = this.root_; 85 node.left = this.root_ [all...] |
/external/v8/src/ |
H A D | splay-tree-inl.h | 26 root_ = new(allocator_) Node(key, Config::NoValue()); 32 int cmp = Config::Compare(key, root_->key_); 34 locator->bind(root_); 41 locator->bind(root_); 49 node->left_ = root_; 50 node->right_ = root_->right_; 51 root_->right_ = NULL; 53 node->right_ = root_; 54 node->left_ = root_->left_; 55 root_ [all...] |
H A D | splay-tree.h | 39 : root_(NULL), allocator_(allocator) {} 92 bool is_empty() { return root_ == NULL; } 154 void ResetRoot() { root_ = NULL; } 157 // Search for a node with a given key. If found, root_ points 161 // Inserts a node assuming that root_ is already set up. 164 // Removes root_ node. 194 Node* root_; member in class:v8::internal::SplayTree
|
/external/v8/benchmarks/ |
H A D | splay.js | 141 SplayTree.prototype.root_ = null; 148 return !this.root_; 162 this.root_ = new SplayTree.Node(key, value); 168 if (this.root_.key == key) { 172 if (key > this.root_.key) { 173 node.left = this.root_; 174 node.right = this.root_.right; 175 this.root_.right = null; 177 node.right = this.root_; 178 node.left = this.root_ [all...] |
/external/libchrome/base/containers/ |
H A D | linked_list.h | 145 // list (root_.next() will point back to the start of the list, 146 // and root_->previous() wraps around to the end of the list). 147 LinkedList() : root_(&root_, &root_) {} 151 e->InsertBefore(&root_); 155 return root_.next(); 159 return root_.previous(); 163 return &root_; 169 LinkNode<T> root_; member in class:base::LinkedList [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
H A D | AST.stg | 283 var root_<treeLevel>:<ASTLabelType> = <ASTLabelType>(adaptor.nil()); 286 adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>); 299 adaptor.addChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n> 304 adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode());<\n> 309 adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode());<\n> 314 root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(stream_<label>.nextNode(), root_<treeLevel>));<\n> 322 root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLeve [all...] |
H A D | ASTTreeParser.stg | 72 var root_<treeLevel>:<ASTLabelType> = <ASTLabelType>(adaptor.nil()); 96 adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>); 123 adaptor.addChild(root_<treeLevel>, <label>_tree); 148 root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(<label>_tree, root_<treeLevel>)); 166 adaptor.addChild(root_<treeLevel>, <label>_tree); 186 adaptor.addChild(root_<treeLevel>, <label>_tree); 212 root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(<label>_tree, root_<treeLeve [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
H A D | AST.stg | 310 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil(); 313 adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>); 327 adaptor.AddChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n> 332 adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n> 337 adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n> 342 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n> 350 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLeve [all...] |
H A D | ASTTreeParser.stg | 74 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil(); 98 adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>); 125 adaptor.AddChild(root_<treeLevel>, <label>_tree); 150 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>); 168 adaptor.AddChild(root_<treeLevel>, <label>_tree); 188 adaptor.AddChild(root_<treeLevel>, <label>_tree); 214 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLeve [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
H A D | AST.stg | 308 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil(); 311 adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>); 325 adaptor.AddChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n> 330 adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n> 335 adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n> 340 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n> 348 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLeve [all...] |
H A D | ASTTreeParser.stg | 75 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil(); 99 adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>); 126 adaptor.AddChild(root_<treeLevel>, <label>_tree); 151 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>); 169 adaptor.AddChild(root_<treeLevel>, <label>_tree); 189 adaptor.AddChild(root_<treeLevel>, <label>_tree); 215 root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLeve [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
H A D | AST.stg | 283 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.nil(); 286 adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>); 299 adaptor.addChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n> 304 adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode());<\n> 309 adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode());<\n> 314 root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(stream_<label>.nextNode(), root_<treeLevel>);<\n> 322 root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLeve [all...] |
H A D | ASTTreeParser.stg | 71 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.nil(); 95 adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>); 122 adaptor.addChild(root_<treeLevel>, <label>_tree); 147 root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_<treeLevel>); 165 adaptor.addChild(root_<treeLevel>, <label>_tree); 185 adaptor.addChild(root_<treeLevel>, <label>_tree); 211 root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_<treeLeve [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
H A D | AST.stg | 282 var root_<treeLevel> = this.adaptor.nil(); 285 this.adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>); 298 this.adaptor.addChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n> 303 this.adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode());<\n> 308 this.adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode());<\n> 313 root_<treeLevel> = this.adaptor.becomeRoot(stream_<label>.nextNode(), root_<treeLevel>);<\n> 321 root_<treeLevel> = this.adaptor.becomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLeve [all...] |
H A D | ASTTreeParser.stg | 44 var root_<treeLevel> = this.adaptor.nil(); 68 this.adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>); 95 this.adaptor.addChild(root_<treeLevel>, <label>_tree); 120 root_<treeLevel> = this.adaptor.becomeRoot(<label>_tree, root_<treeLevel>); 143 this.adaptor.addChild(root_<treeLevel>, <label>_tree); 169 root_<treeLevel> = this.adaptor.becomeRoot(<label>_tree, root_<treeLevel>); 184 this.adaptor.addChild(root_<treeLeve [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
H A D | AST.stg | 438 <ASTLabelType> *root_<treeLevel> = (<ASTLabelType> *)[[[treeAdaptor class] newEmptyTree] retain]; 441 [treeAdaptor addChild:root_<treeLevel> toTree:root_<enclosingTreeLevel>]; 455 [treeAdaptor addChild:<createRewriteNodeFromElement(...)> toTree:root_<treeLevel>];<\n> 460 [treeAdaptor addChild:[stream_<label> nextNode] toTree:root_<treeLevel>];<\n> 465 [treeAdaptor addChild:[stream_<label> nextNode] toTree:root_<treeLevel>];<\n> 470 root_<treeLevel> = (<ASTLabelType> *)[treeAdaptor becomeRoot:[stream_<label> nextNode] old:root_<treeLevel>];<\n> 478 root_<treeLevel> = (<ASTLabelType> *)[treeAdaptor becomeRoot:<createRewriteNodeFromElement(...)> old:root_<treeLeve [all...] |
H A D | ASTTreeParser.stg | 117 <ASTLabelType> *root_<treeLevel> = [[[treeAdaptor class] newEmptyTree] retain]; 141 [treeAdaptor addChild:root_<treeLevel> toTree:root_<enclosingTreeLevel>]; 170 [treeAdaptor addChild:<label>_tree toTree:root_<treeLevel>]; 197 root_<treeLevel> = (<ASTLabelType> *)[treeAdaptor becomeRoot:<label>_tree old:root_<treeLevel>]; 217 [adaptor addChild:<label>_tree toTree:root_<treeLevel>]; 238 [adaptor addChild:<label>_tree toTree:root_<treeLevel>]; 267 root_<treeLevel> = (<ASTLabelType> *)[adaptor becomeRoot:<label>_tree old:root_<treeLeve [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
H A D | AST.stg | 314 root_<treeLevel> = self._adaptor.nil() 317 self._adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>)<\n> 329 self._adaptor.addChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>)<\n> 334 self._adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode())<\n> 339 self._adaptor.addChild(root_<treeLevel>, stream_<label>.nextNode())<\n> 344 root_<treeLevel> = self._adaptor.becomeRoot(stream_<label>.nextNode(), root_<treeLevel>)<\n> 352 root_<treeLevel> = self._adaptor.becomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLeve [all...] |
H A D | ASTTreeParser.stg | 79 root_<treeLevel> = self._adaptor.nil()<\n> 106 self._adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>)<\n> 133 self._adaptor.addChild(root_<treeLevel>, <label>_tree) 160 root_<treeLevel> = self._adaptor.becomeRoot(<label>_tree, root_<treeLevel>) 178 self._adaptor.addChild(root_<treeLevel>, <label>_tree) 199 self._adaptor.addChild(root_<treeLevel>, <label>_tree) 224 root_<treeLevel> = self._adaptor.becomeRoot(<label>_tree, root_<treeLeve [all...] |
/external/gemmlowp/profiling/ |
H A D | profiler.h | 174 Node root_; member in class:gemmlowp::ProfileTreeView 181 printf("%.2f%% %s\n", 100.0f * node->weight / root_.weight, node->label); 211 AddStackToNode(stack, &root_, 0); 223 node == &root_ ? "other (outside of any label)" : "other"; 229 void AddOtherNodes() { AddOtherChildrenToNode(&root_); } 238 void Sort() { SortNode(&root_); } 253 static_cast<int>(root_.weight)); 254 PrintNode(&root_, 0);
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
H A D | ASTTreeParser.stg | 82 <ASTLabelType> root_<treeLevel>; 87 root_<treeLevel> = (<ASTLabelType>)(ADAPTOR->nilNode(ADAPTOR)); 112 ADAPTOR->addChild(ADAPTOR, root_<enclosingTreeLevel>, root_<treeLevel>); 139 ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, <label>_tree); 165 root_<treeLevel> = (<ASTLabelType>)ADAPTOR->becomeRoot(ADAPTOR, <label>_tree, root_<treeLevel>); 183 ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, <label>_tree); 203 ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, <label>_tree); 229 root_<treeLeve [all...] |
H A D | AST.stg | 427 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)(ADAPTOR->nilNode(ADAPTOR)); 430 ADAPTOR->addChild(ADAPTOR, root_<enclosingTreeLevel>, root_<treeLevel>); 443 ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n> 448 ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, stream_<label> == NULL ? NULL : stream_<label>->nextNode(stream_<label>));<\n> 453 ADAPTOR->addChild(ADAPTOR, root_<treeLevel>, stream_<label> == NULL ? NULL : stream_<label>->nextNode(stream_<label>));<\n> 458 root_<treeLevel> = (<ASTLabelType>)(ADAPTOR->becomeRootToken(ADAPTOR, stream_<label> == NULL ? NULL : stream_<label>->nextToken(stream_<label>), root_<treeLevel>));<\n> 466 root_<treeLevel> = (<ASTLabelType>)(ADAPTOR->becomeRoot(ADAPTOR, <createRewriteNodeFromElement(...)>, root_<treeLeve [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
H A D | ASTTreeParser.stg | 73 <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.nil(); 97 adaptor.addChild(root_<enclosingTreeLevel>, root_<treeLevel>); 124 adaptor.addChild(root_<treeLevel>, <label>_tree); 149 root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_<treeLevel>); 172 adaptor.addChild(root_<treeLevel>, <label>_tree); 198 root_<treeLevel> = (<ASTLabelType>)adaptor.becomeRoot(<label>_tree, root_<treeLevel>); 213 adaptor.addChild(root_<treeLeve [all...] |
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator.cc | 148 : root_(NULL), 160 root_ = PartitionTreeNode::CreateRootNode(size_vector_, num_partitions_); 165 delete root_; 169 assert(root_); 172 root_->set_min_parent_size(min_size); 173 root_->set_max_parent_size(max_size); 179 assert(root_); 181 PartitionTreeNode* opt = root_->GetOptimalNode(max_size, penalty);
|