Searched defs:root_ (Results 1 - 12 of 12) sorted by relevance
| /external/embunit/src/ |
| H A D | TestRunner.c | 43 static Test* root_; variable
57 stdimpl_print(Test_name(root_));
90 root_ = test;
|
| /external/webp/src/utils/ |
| H A D | huffman.h | 41 HuffmanTreeNode* root_; // all the nodes, starting at root. member in struct:HuffmanTree
|
| /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/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/v8/src/ |
| 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
|
| H A D | allocation-tracker.h | 51 AllocationTraceNode* root() { return &root_; }
57 AllocationTraceNode root_; member in class:v8::internal::AllocationTraceTree
|
| H A D | profile-generator.h | 154 ProfileNode* root() const { return root_; }
158 root_->Print(0);
167 ProfileNode* root_; member in class:v8::internal::ProfileTree
|
| H A D | objects.h | 9324 ConsString* root_; member in class:v8::internal::String::FlatContent::ConsStringIteratorOp
|
| /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/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| H A D | BytesTrie.java | 45 pos_=root_=offset;
66 pos_=root_;
97 state.root=root_;
114 if(bytes_==state.bytes && bytes_!=null && root_==state.root) {
217 return nextImpl(root_, inByte);
1062 private int root_; field in class:BytesTrie
|
| H A D | CharsTrie.java | 48 pos_=root_=offset;
69 pos_=root_;
100 state.root=root_;
117 if(chars_==state.chars && chars_!=null && root_==state.root) {
152 return nextImpl(root_, inUnit);
1010 private int root_; field in class:CharsTrie
|
| /external/openfst/src/include/fst/ |
| H A D | replace.h | 404 root_ = (nonterminal > 0) ? nonterminal : 1;
406 SetProperties(ReplaceProperties(inprops, root_ - 1, epsilon_on_replace_,
441 root_(impl.root_) {
469 ReplaceUtil<A> replace_util(fst_array_, nonterminal_hash_, root_);
480 const Fst<A>* fst = fst_array_[root_];
487 StateTuple(prefix, root_, fst_start));
907 Label root_; member in class:fst::ReplaceFstImpl
|
Completed in 961 milliseconds