| /external/opencv3/3rdparty/libwebp/utils/ |
| huffman.h | 33 HuffmanTreeNode* root_; // all the nodes, starting at root. member in struct:HuffmanTree
|
| /external/v8/src/ast/ |
| ast-expression-visitor.h | 42 Expression* root_; member in class:v8::internal::AstExpressionVisitor
|
| /system/connectivity/shill/dhcp/ |
| dhcp_provider.h | 136 base::FilePath root_; member in class:shill::DHCPProvider
|
| dhcp_config.h | 110 base::FilePath root() const { return root_; }
214 base::FilePath root_; member in class:shill::DHCPConfig
|
| /external/libchrome/base/containers/ |
| 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/v8/src/crankshaft/ |
| typing.h | 41 FunctionLiteral* root_; member in class:v8::internal::AstTyper
|
| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| vp8_partition_aggregator.h | 128 PartitionTreeNode* root_; member in class:webrtc::Vp8PartitionAggregator
|
| /external/gemmlowp/profiling/ |
| 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/v8/benchmarks/spinning-balls/ |
| 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_.left
[all...] |
| /external/v8/benchmarks/ |
| 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_.left
[all...] |
| /external/v8/src/ |
| 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
|
| typing-asm.h | 69 FunctionLiteral* root_; member in class:v8::internal::AsmTyper
|
| /external/v8/tools/ |
| 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_.left
[all...] |
| /art/runtime/ |
| gc_root.h | 177 mirror::CompressedReference<mirror::Object>* roots[1] = { &root_ };
190 return &root_;
195 return root_.IsNull();
201 // Root visitors take pointers to root_ and place them in CompressedReference** arrays. We use a
204 mutable mirror::CompressedReference<mirror::Object> root_; member in class:art::GcRoot
|
| /external/v8/src/profiler/ |
| allocation-tracker.h | 60 AllocationTraceNode* root() { return &root_; }
66 AllocationTraceNode root_; member in class:v8::internal::AllocationTraceTree
|
| profile-generator.h | 196 ProfileNode* root() const { return root_; }
201 root_->Print(0);
212 ProfileNode* root_; member in class:v8::internal::ProfileTree
|
| /system/update_engine/ |
| omaha_request_params.h | 326 // When reading files, prepend root_ to the paths. Useful for testing.
327 std::string root_; member in class:chromeos_update_engine::OmahaRequestParams
|
| /build/kati/ |
| find.cc | 714 const DirentNode* r = root_->FindDir(d);
731 root_.reset(ConstructDirectoryTree(""));
937 unique_ptr<DirentNode> root_; member in class:__anon1261::FindEmulatorImpl
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| BytesTrie.java | 45 pos_=root_=offset;
64 pos_=root_;
92 state.root=root_;
108 if(bytes_==state.bytes && bytes_!=null && root_==state.root) {
201 return nextImpl(root_, inByte);
1027 private int root_; field in class:BytesTrie
[all...] |
| CharsTrie.java | 48 pos_=root_=offset;
67 pos_=root_;
95 state.root=root_;
111 if(chars_==state.chars && chars_!=null && root_==state.root) {
144 return nextImpl(root_, inUnit);
984 private int root_; field in class:CharsTrie
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| 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
[all...] |
| 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
[all...] |
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/ |
| api.pb.h | 424 ::google::protobuf::internal::ArenaStringPtr root_; member in class:google::protobuf::Mixin
[all...] |
| /external/libchrome/crypto/ |
| nss_util.cc | 685 root_(NULL) {
722 root_ = InitDefaultRootCerts();
771 root_ = InitDefaultRootCerts();
790 if (root_) {
791 SECMOD_UnloadUserModule(root_);
792 SECMOD_DestroyModule(root_);
793 root_ = NULL;
857 SECMODModule* root_; member in class:crypto::__anon15329::NSSInitSingleton
[all...] |
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| kmeans_index.h | 348 : dataset_(inputData), index_params_(params), root_(NULL), indices_(NULL), distance_(d)
390 if (root_ != NULL) {
391 free_centers(root_);
443 root_ = pool_.allocate<KMeansNode>();
444 computeNodeStatistics(root_, indices_, (int)size_);
445 computeClustering(root_, indices_, (int)size_, branching_,0);
457 save_tree(stream, root_);
473 if (root_!=NULL) {
474 free_centers(root_);
476 load_tree(stream, root_);
1142 KMeansNodePtr root_; member in class:cvflann::KMeansIndex
[all...] |
