Searched defs:root_ (Results 1 - 9 of 9) sorted by relevance

/external/embunit/src/
H A DTestRunner.c43 static Test* root_; variable
57 stdimpl_print(Test_name(root_));
90 root_ = test;
/external/chromium/base/
H A Dlinked_list.h137 // list (root_.next() will point back to the start of the list,
138 // and root_->previous() wraps around to the end of the list).
139 LinkedList() : root_(&root_, &root_) {}
143 e->InsertBefore(&root_);
147 return root_.next();
151 return root_.previous();
155 return &root_;
159 LinkNode<T> root_; member in class:base::LinkedList
[all...]
H A Dnss_util.cc81 NSSInitSingleton() : root_(NULL) {
138 root_ = InitDefaultRootCerts();
143 if (root_) {
144 SECMOD_UnloadUserModule(root_);
145 SECMOD_DestroyModule(root_);
146 root_ = NULL;
159 SECMODModule *root_; member in class:__anon763::NSSInitSingleton
/external/v8/benchmarks/
H A Dsplay.js140 SplayTree.prototype.root_ = null;
147 return !this.root_;
161 this.root_ = new SplayTree.Node(key, value);
167 if (this.root_.key == key) {
171 if (key > this.root_.key) {
172 node.left = this.root_;
173 node.right = this.root_.right;
174 this.root_.right = null;
176 node.right = this.root_;
177 node.left = this.root_
[all...]
/external/webkit/SunSpider/tests/v8-v4/
H A Dv8-splay.js135 SplayTree.prototype.root_ = null;
142 return !this.root_;
156 this.root_ = new SplayTree.Node(key, value);
162 if (this.root_.key == key) {
166 if (key > this.root_.key) {
167 node.left = this.root_;
168 node.right = this.root_.right;
169 this.root_.right = null;
171 node.right = this.root_;
172 node.left = this.root_
[all...]
/external/v8/src/
H A Dzone.h224 ZoneSplayTree() : root_(NULL) { }
253 bool is_empty() { return root_ == NULL; }
299 Node* root_; member in class:v8::internal::ZoneSplayTree
/external/v8/tools/
H A Dsplaytree.js53 goog.structs.SplayTree.prototype.root_ = null;
60 return !this.root_;
75 this.root_ = new goog.structs.SplayTree.Node(key, value);
81 if (this.root_.key == key) {
85 if (key > this.root_.key) {
86 node.left = this.root_;
87 node.right = this.root_.right;
88 this.root_.right = null;
90 node.right = this.root_;
91 node.left = this.root_
[all...]
/external/webkit/JavaScriptCore/wtf/
H A DTCPageMap.h116 Leaf* root_[ROOT_LENGTH]; // Pointers to 32 child nodes member in class:TCMalloc_PageMap2
124 memset(root_, 0, sizeof(root_));
131 return root_[i1]->values[i2];
138 root_[i1]->values[i2] = v;
146 if (root_[i1] == NULL) {
150 root_[i1] = leaf;
169 if (!root_[i])
172 Leaf* l = reader(reinterpret_cast<Leaf*>(root_[i]));
181 if (root_[
210 Node* root_; // Root of radix tree member in class:TCMalloc_PageMap3
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dreplace.h115 : CacheImpl<A>(opts), opts_(opts), root_(kNoLabel) {
125 root_(impl.root_) {
199 depfst.SetStart(root_ - 1);
200 depfst.SetFinal(root_ - 1, Weight::One());
207 root_ = (nonterminal > 0) ? nonterminal : 1;
224 const Fst<A>* fst = fst_array_[root_];
230 StateId start = FindState(StateTuple(prefix, root_, fst_start));
504 Label root_; member in class:fst::ReplaceFstImpl

Completed in 399 milliseconds