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

/external/webrtc/webrtc/modules/audio_processing/transient/
H A Dwpd_tree.h86 rtc::scoped_ptr<rtc::scoped_ptr<WPDNode>[]> nodes_; member in class:webrtc::WPDTree
/external/v8/src/
H A Dfast-accessor-assembler.h91 std::vector<compiler::Node*> nodes_; member in class:v8::internal::FastAccessorAssembler
/external/jsoncpp/include/json/
H A Dreader.h231 Nodes nodes_; member in class:Json::Reader
/external/openfst/src/include/fst/extensions/pdt/
H A Dpdt.h46 // 'nodes_'. Each node represents the top of some stack and is
75 nodes_.push_back(StackNode(-1, -1)); // Tree root.
98 child_id = nodes_.size();
99 nodes_.push_back(StackNode(stack_id, paren_id));
104 const StackNode &node = nodes_[stack_id];
114 return nodes_[stack_id].parent_id;
119 return nodes_[stack_id].paren_id;
140 vector<StackNode> nodes_; member in class:fst::PdtStack
/external/v8/src/compiler/
H A Dinstruction-scheduler.h101 nodes_(scheduler->zone()) {
105 nodes_.push_back(node);
109 return nodes_.empty();
114 ZoneLinkedList<ScheduleGraphNode*> nodes_; member in class:v8::internal::compiler::final::SchedulingQueueBase
H A Dschedule.h79 bool empty() const { return nodes_.empty(); }
80 size_t size() const { return nodes_.size(); }
81 Node* NodeAt(size_t index) { return nodes_[index]; }
82 size_t NodeCount() const { return nodes_.size(); }
84 value_type& front() { return nodes_.front(); }
85 value_type const& front() const { return nodes_.front(); }
88 iterator begin() { return nodes_.begin(); }
89 iterator end() { return nodes_.end(); }
92 const_iterator begin() const { return nodes_.begin(); }
93 const_iterator end() const { return nodes_
163 NodeVector nodes_; // nodes of this block in forward order. member in class:v8::internal::compiler::final
[all...]
H A Dsimplified-lowering.cc236 nodes_(zone),
584 // Process nodes from the collected {nodes_} vector.
585 for (NodeVector::iterator i = nodes_.begin(); i != nodes_.end(); ++i) {
613 nodes_.push_back(node);
618 // for that input node. Add the input to {nodes_} if this is the first time
633 nodes_.push_back(node);
2143 NodeVector nodes_; // collected nodes member in class:v8::internal::compiler::RepresentationSelector
/external/v8/src/profiler/
H A Dsampling-heap-profiler.h27 AllocationProfile() : nodes_() {}
30 return nodes_.size() == 0 ? nullptr : &nodes_.front();
33 std::deque<v8::AllocationProfile::Node>& nodes() { return nodes_; }
36 std::deque<v8::AllocationProfile::Node> nodes_; member in class:v8::internal::AllocationProfile
/external/v8/src/regexp/
H A Dregexp-ast.h254 ZoneList<RegExpTree*>* nodes() { return nodes_; }
257 ZoneList<RegExpTree*>* nodes_; member in class:v8::internal::final

Completed in 149 milliseconds