Home
last modified time | relevance | path

Searched refs:elements_ (Results 1 – 8 of 8) sorted by relevance

/external/protobuf/src/google/protobuf/
Drepeated_field.cc48 void** old_elements = elements_; in Reserve()
51 elements_ = new void*[total_size_]; in Reserve()
53 memcpy(elements_, old_elements, allocated_size_ * sizeof(elements_[0])); in Reserve()
60 void** swap_elements = elements_; in Swap()
65 elements_ = other->elements_; in Swap()
70 other->elements_ = swap_elements; in Swap()
Drepeated_field.h201 Element* elements_; variable
296 elements_[i - num] = elements_[i]; in CloseGap()
342 void** elements_; variable
581 : elements_(NULL), in RepeatedField()
588 : elements_(NULL), in RepeatedField()
597 : elements_(NULL), in RepeatedField()
615 delete [] elements_; in ~RepeatedField()
644 elements_[current_size_++] = value; in AddAlreadyReserved()
650 return &elements_[current_size_++]; in AddAlreadyReserved()
658 std::fill(&elements_[current_size_], &elements_[new_size], value); in Resize()
[all …]
/external/v8/src/heap/
Dgc-tracer.h21 const_iterator() : index_(0), elements_(NULL) {} in const_iterator()
24 : index_(index), elements_(elements) {} in const_iterator()
27 return elements_ == rhs.elements_ && index_ == rhs.index_;
31 return elements_ != rhs.elements_ || index_ != rhs.index_;
34 operator const T*() const { return elements_ + index_; }
36 const T* operator->() const { return elements_ + index_; }
38 const T& operator*() const { return elements_[index_]; }
52 const T* elements_; variable
61 const_iterator begin() const { return const_iterator(begin_, elements_); } in begin()
62 const_iterator end() const { return const_iterator(end_, elements_); } in end()
[all …]
/external/v8/src/
Dkey-accumulator.cc19 for (size_t i = 0; i < elements_.size(); i++) { in ~KeyAccumulator()
20 delete elements_[i]; in ~KeyAccumulator()
51 } else if (level < elements_.size()) { in GetKeys()
53 std::vector<uint32_t>* elements = elements_[level]; in GetKeys()
146 for (size_t i = 1; i < elements_.size(); i++) { in AddIntegerKey()
147 if (AccumulatorHasKey(elements_[i - 1], key)) return false; in AddIntegerKey()
149 elements_.back()->push_back(key); in AddIntegerKey()
284 auto last_level = elements_.back(); in SortCurrentElementsListRemoveDuplicates()
296 if (elements_.empty()) return; in SortCurrentElementsList()
297 auto element_keys = elements_.back(); in SortCurrentElementsList()
[all …]
Dkey-accumulator.h66 std::vector<std::vector<uint32_t>*> elements_; variable
/external/webrtc/webrtc/modules/audio_processing/beamformer/
Dmatrix.h120 T* const* elements() { return &elements_[0]; } in elements()
121 const T* const* elements() const { return &elements_[0]; } in elements()
128 trace += elements_[i][i]; in Trace()
287 ss << elements_[i][j] << " "; in ToString()
308 elements_.resize(num_rows_); in Resize()
311 elements_[i] = &data_[i * num_columns_]; in Resize()
329 std::vector<T*> elements_; variable
341 elements_[i][j] = src[j][i]; in Transpose()
358 elements_[row][col] = cur_element; in Multiply()
/external/v8/src/crankshaft/
Dhydrogen-bch.cc85 Element* at(int index) const { return &(elements_.at(index)); } in at()
122 for (int i = 0; i < elements_.length(); i++) { in CheckHoistability()
179 elements_(graph->blocks()->length(), graph->zone()) { in InductionVariableBlocksTable()
183 elements_.Add(element, graph->zone()); in InductionVariableBlocksTable()
366 ZoneList<Element> elements_; member in v8::internal::BASE_EMBEDDED
/external/v8/src/regexp/
Dregexp-ast.h339 explicit RegExpText(Zone* zone) : elements_(2, zone), length_(0) {} in RegExpText()
349 elements_.Add(elm, zone); in AddElement()
352 ZoneList<TextElement>* elements() { return &elements_; } in elements()
355 ZoneList<TextElement> elements_;