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

12

/external/perfetto/src/ftrace_reader/
H A Dftrace_procfs.h108 const std::string root_; member in class:perfetto::FtraceProcfs
/external/pdfium/core/fpdfapi/parser/
H A Dcpdf_object_avail.h48 MaybeOwned<const CPDF_Object> root_; member in class:CPDF_ObjectAvail
/external/tensorflow/tensorflow/core/profiler/internal/
H A Dtfprof_op.h70 std::unique_ptr<OpNode> root_; member in class:tensorflow::tfprof::TFOp
H A Dtfprof_scope.h43 : TFShow(ckpt_reader), root_(nullptr) {}
69 ScopeNode* root_; member in class:tensorflow::tfprof::TFScope
H A Dtfprof_code.h88 std::unique_ptr<CodeNode> root_; member in class:tensorflow::tfprof::TFCode
H A Dtfprof_graph.h46 : TFShow(ckpt_reader), root_(nullptr) {}
80 GraphNode* root_; member in class:tensorflow::tfprof::TFGraph
/external/libchrome/base/containers/
H A Dlinked_list.h145 // 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/pdfium/xfa/fxfa/parser/
H A Dcxfa_nodeiteratortemplate_unittest.cpp61 root_ = pdfium::MakeUnique<Node>(nullptr);
62 child1_ = pdfium::MakeUnique<Node>(root_.get());
63 child2_ = pdfium::MakeUnique<Node>(root_.get());
73 Node* root() const { return root_.get(); }
85 std::unique_ptr<Node> root_; member in class:CXFA_NodeIteratorTemplateTest
/external/v8/benchmarks/spinning-balls/
H A Dsplay-tree.js46 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 Dsplay.js141 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/crankshaft/
H A Dtyping.h46 FunctionLiteral* root_; member in class:v8::internal::final
/external/v8/src/
H A Dsplay-tree.h39 : 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/tools/
H A Dsplaytree.js47 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/webrtc/webrtc/modules/rtp_rtcp/source/
H A Dvp8_partition_aggregator.h128 PartitionTreeNode* root_; member in class:webrtc::Vp8PartitionAggregator
/external/gemmlowp/profiling/
H A Dprofiler.h174 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/protobuf/csharp/src/Google.Protobuf/WellKnownTypes/
H A DApi.cs727 root_ = other.root_;
749 private string root_ = ""; field in class:Google.Protobuf.WellKnownTypes.Mixin
755 get { return root_; }
757 root_ = pb::ProtoPreconditions.CheckNotNull(value, "value");
/external/protobuf/src/google/protobuf/util/internal/
H A Ddefault_value_objectwriter.h226 // Writes the root_ node to ow_ and resets the root_ and current_ pointer to
256 google::protobuf::scoped_ptr<Node> root_; member in class:google::protobuf::util::converter::DefaultValueObjectWriter
257 // The stack to hold the path of Nodes from current_ to root_;
/external/tensorflow/tensorflow/compiler/xla/
H A Dshape_tree.h122 root_ = other.root_;
171 return iterator(&root_, /*iterate_leaves_only=*/false,
179 return const_iterator(&root_, /*iterate_leaves_only=*/false,
189 return iterator(&root_, /*iterate_leaves_only=*/false,
197 return const_iterator(&root_, /*iterate_leaves_only=*/false,
208 return iterator(&root_, /*iterate_leaves_only=*/true, /*reverse=*/false);
215 return const_iterator(&root_, /*iterate_leaves_only=*/true,
231 return iterator(&root_, /*iterate_leaves_only=*/true, /*reverse=*/true);
238 return const_iterator(&root_, /*iterate_leaves_onl
310 Node root_; member in class:xla::ShapeTree
604 root_, &index) member in namespace:xla
[all...]
/external/v8/src/profiler/
H A Dallocation-tracker.h60 AllocationTraceNode* root() { return &root_; }
66 AllocationTraceNode root_; member in class:v8::internal::AllocationTraceTree
/external/protobuf/src/google/protobuf/util/
H A Dfield_mask_util.cc197 if (root_.children.empty()) {
200 MergeMessage(&root_, source, options, destination);
236 Node root_; member in class:google::protobuf::util::__anon19110::FieldMaskTree
252 MergeToFieldMask("", &root_, mask);
278 Node* node = &root_;
280 if (!new_branch && node != &root_ && node->children.empty()) {
304 const Node* node = &root_;
307 if (node != &root_) {
/external/tensorflow/tensorflow/cc/gradients/
H A Dmath_grad_test.cc574 MathGradTest() : root_(Scope::NewRootScope().WithDevice("/cpu:0")) {}
578 TF_ASSERT_OK(root_.status());
586 Placeholder(root_, DataTypeToEnum<T>::v(), Placeholder::Shape(x_shape));
588 Placeholder(root_, DataTypeToEnum<T>::v(), Placeholder::Shape(y_shape));
591 z = BatchMatMul(root_, x, y, BatchMatMul::AdjX(t_x).AdjY(t_y));
593 z = MatMul(root_, x, y, MatMul::TransposeA(t_x).TransposeB(t_y));
598 root_, {x, y}, {x_shape, y_shape}, {z}, {z_shape}, &max_error)));
644 Scope root_; member in class:tensorflow::__anon25356::MathGradTest
/external/icu/android_icu4j/src/main/java/android/icu/util/
H A DBytesTrie.java47 pos_=root_=offset;
66 pos_=root_;
94 state.root=root_;
110 if(bytes_==state.bytes && bytes_!=null && root_==state.root) {
203 return nextImpl(root_, inByte);
1033 private int root_; field in class:BytesTrie
H A DCharsTrie.java50 pos_=root_=offset;
69 pos_=root_;
97 state.root=root_;
113 if(chars_==state.chars && chars_!=null && root_==state.root) {
146 return nextImpl(root_, inUnit);
990 private int root_; field in class:CharsTrie
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DBytesTrie.java47 pos_=root_=offset;
68 pos_=root_;
99 state.root=root_;
116 if(bytes_==state.bytes && bytes_!=null && root_==state.root) {
219 return nextImpl(root_, inByte);
1068 private int root_; field in class:BytesTrie
H A DCharsTrie.java50 pos_=root_=offset;
71 pos_=root_;
102 state.root=root_;
119 if(chars_==state.chars && chars_!=null && root_==state.root) {
154 return nextImpl(root_, inUnit);
1016 private int root_; field in class:CharsTrie

Completed in 628 milliseconds

12