Home
last modified time | relevance | path

Searched refs:nodes_ (Results 1 – 25 of 26) sorted by relevance

12

/external/webrtc/webrtc/modules/audio_processing/transient/
Dwpd_tree.cc35 nodes_.reset(new rtc::scoped_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
39 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
56 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
59 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
73 return nodes_[(1 << level) + index].get(); in NodeAt()
82 int update_result = nodes_[1]->set_data(data, data_length); in Update()
102 update_result = nodes_[index_left_child]->Update( in Update()
103 nodes_[index]->data(), nodes_[index]->length()); in Update()
108 update_result = nodes_[index_right_child]->Update( in Update()
109 nodes_[index]->data(), nodes_[index]->length()); in Update()
Dwpd_tree.h86 rtc::scoped_ptr<rtc::scoped_ptr<WPDNode>[]> nodes_; variable
/external/v8/src/compiler/
Dschedule.h79 bool empty() const { return nodes_.empty(); } in empty()
80 size_t size() const { return nodes_.size(); } in size()
81 Node* NodeAt(size_t index) { return nodes_[index]; } in NodeAt()
82 size_t NodeCount() const { return nodes_.size(); } in NodeCount()
84 value_type& front() { return nodes_.front(); } in front()
85 value_type const& front() const { return nodes_.front(); } in front()
88 iterator begin() { return nodes_.begin(); } in begin()
89 iterator end() { return nodes_.end(); } in end()
92 const_iterator begin() const { return nodes_.begin(); } in begin()
93 const_iterator end() const { return nodes_.end(); } in end()
[all …]
Dinstruction-scheduler.cc25 auto candidate = nodes_.end(); in PopBestCandidate()
26 for (auto iterator = nodes_.begin(); iterator != nodes_.end(); ++iterator) { in PopBestCandidate()
30 if ((candidate == nodes_.end()) || CompareNodes(*iterator, *candidate)) { in PopBestCandidate()
36 if (candidate != nodes_.end()) { in PopBestCandidate()
38 nodes_.erase(candidate); in PopBestCandidate()
50 auto candidate = nodes_.begin(); in PopBestCandidate()
52 static_cast<int>(nodes_.size()))); in PopBestCandidate()
54 nodes_.erase(candidate); in PopBestCandidate()
Dinstruction-scheduler.h101 nodes_(scheduler->zone()) { in SchedulingQueueBase()
105 nodes_.push_back(node); in AddNode()
109 return nodes_.empty(); in IsEmpty()
114 ZoneLinkedList<ScheduleGraphNode*> nodes_; variable
Dschedule.cc27 nodes_(zone), in BasicBlock()
53 void BasicBlock::AddNode(Node* node) { nodes_.push_back(node); } in AddNode()
Dsimplified-lowering.cc236 nodes_(zone), in RepresentationSelector()
585 for (NodeVector::iterator i = nodes_.begin(); i != nodes_.end(); ++i) { in Run()
613 nodes_.push_back(node); in EnqueueInitial()
633 nodes_.push_back(node); in EnqueueInput()
2143 NodeVector nodes_; // collected nodes member in v8::internal::compiler::RepresentationSelector
/external/openfst/src/include/fst/extensions/pdt/
Dpdt.h75 nodes_.push_back(StackNode(-1, -1)); // Tree root. in PdtStack()
98 child_id = nodes_.size(); in Find()
99 nodes_.push_back(StackNode(stack_id, paren_id)); in Find()
104 const StackNode &node = nodes_[stack_id]; in Find()
114 return nodes_[stack_id].parent_id; in Pop()
119 return nodes_[stack_id].paren_id; in Top()
140 vector<StackNode> nodes_; variable
/external/v8/src/profiler/
Dsampling-heap-profiler.h27 AllocationProfile() : nodes_() {} in AllocationProfile()
30 return nodes_.size() == 0 ? nullptr : &nodes_.front(); in GetRootNode()
33 std::deque<v8::AllocationProfile::Node>& nodes() { return nodes_; } in nodes()
36 std::deque<v8::AllocationProfile::Node> nodes_;
/external/v8/src/
Dfast-accessor-assembler.cc205 nodes_.push_back(node); in FromRaw()
206 ValueId value = {nodes_.size() - 1}; in FromRaw()
218 CHECK_LT(value.value_id, nodes_.size()); in FromId()
219 CHECK_NOT_NULL(nodes_.at(value.value_id)); in FromId()
220 return nodes_.at(value.value_id); in FromId()
233 nodes_.clear(); in Clear()
Dfast-accessor-assembler.h91 std::vector<compiler::Node*> nodes_; variable
Dglobal-handles.cc434 nodes_[i].Initialize(i, first_free); in PutNodesOnFreeList()
440 return &nodes_[index]; in node_at()
476 Node nodes_[kSize]; member in v8::internal::GlobalHandles::NodeBlock
/external/jsoncpp/src/lib_json/
Djson_reader.cpp126 while (!nodes_.empty()) in parse()
127 nodes_.pop(); in parse()
128 nodes_.push(&root); in parse()
438 nodes_.push(&value); in readObject()
440 nodes_.pop(); in readObject()
474 nodes_.push(&value); in readArray()
476 nodes_.pop(); in readArray()
752 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
/external/jsoncpp/include/json/
Dreader.h231 Nodes nodes_; variable
/external/chromium-trace/catapult/third_party/polymer/components/webcomponentsjs/
DCustomElements.js102 observer.nodes_.forEach(function(node) {
127 this.nodes_ = []; property in anonymousFunction5ed0a8060400.JsMutationObserver
151 this.nodes_.push(target);
156 this.nodes_.forEach(function(node) {
DCustomElements.min.js11 …nodes_.forEach(function(t){var r=v.get(t);r&&r.forEach(function(t){t.observer===e&&t.removeTransie… property
DHTMLImports.min.js11 …nodes_.forEach(function(t){var r=v.get(t);r&&r.forEach(function(t){t.observer===e&&t.removeTransie… property
DHTMLImports.js102 observer.nodes_.forEach(function(node) {
127 this.nodes_ = []; property in anonymousFunction34c704b10400.JsMutationObserver
151 this.nodes_.push(target);
156 this.nodes_.forEach(function(node) {
Dwebcomponents-lite.js657 observer.nodes_.forEach(function(node) {
682 this.nodes_ = []; property in anonymousFunction0b99a9ad0a00.JsMutationObserver
706 this.nodes_.push(target);
711 this.nodes_.forEach(function(node) {
Dwebcomponents-lite.min.js11 …nodes_.forEach(function(t){var n=v.get(t);n&&n.forEach(function(t){t.observer===e&&t.removeTransie… property
Dwebcomponents.js613 for (var i = 0; i < observer.nodes_.length; i++) {
614 var node = observer.nodes_[i];
690 this.nodes_ = []; property in anonymousFunction9fa581921500.MutationObserver
713 this.nodes_.push(target);
717 this.nodes_.forEach(function(node) {
5399 observer.nodes_.forEach(function(node) {
5424 this.nodes_ = []; property in anonymousFunction9fa58192bf00.JsMutationObserver
5448 this.nodes_.push(target);
5453 this.nodes_.forEach(function(node) {
DShadowDOM.min.js11 …nodes_.length;t++){var n=e.nodes_[t],r=f.get(n);if(!r)return;for(var o=0;o<r.length;o++){var i=r[o… property
DShadowDOM.js574 for (var i = 0; i < observer.nodes_.length; i++) {
575 var node = observer.nodes_[i];
651 this.nodes_ = []; property in anonymousFunctionf471d4f41200.MutationObserver
674 this.nodes_.push(target);
678 this.nodes_.forEach(function(node) {
/external/v8/src/regexp/
Dregexp-ast.h254 ZoneList<RegExpTree*>* nodes() { return nodes_; } in nodes()
257 ZoneList<RegExpTree*>* nodes_;
Dregexp-ast.cc322 : nodes_(nodes) { in RegExpAlternative()

12