| /external/protobuf/src/google/protobuf/ |
| repeated_field.cc | 48 void** old_elements = elements_;
51 elements_ = new void*[total_size_];
53 memcpy(elements_, old_elements, allocated_size_ * sizeof(elements_[0]));
60 void** swap_elements = elements_;
65 elements_ = other->elements_;
70 other->elements_ = swap_elements;
|
| repeated_field.h | 201 Element* elements_; member in class:google::protobuf::RepeatedField
296 elements_[i - num] = elements_[i];
342 void** elements_; member in class:google::protobuf::internal::RepeatedPtrFieldBase
581 : elements_(NULL),
588 : elements_(NULL),
597 : elements_(NULL),
615 delete [] elements_;
644 elements_[current_size_++] = value;
650 return &elements_[current_size_++]
[all...] |
| /external/v8/src/heap/ |
| gc-tracer.h | 21 const_iterator() : index_(0), elements_(NULL) {}
24 : index_(index), elements_(elements) {}
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_; member in class:v8::internal::RingBuffer::const_iterator
81 T elements_[MAX_SIZE + 1]; member in class:v8::internal::RingBuffer
[all...] |
| /prebuilts/misc/darwin-x86_64/protobuf2.5/include/google/protobuf/ |
| repeated_field.h | 174 Element* elements_; member in class:google::protobuf::RepeatedField
268 elements_[i - num] = elements_[i];
316 void** elements_; member in class:google::protobuf::internal::RepeatedPtrFieldBase
552 : elements_(NULL),
559 : elements_(NULL),
568 : elements_(NULL),
578 delete [] elements_;
602 elements_[current_size_++] = value;
608 return &elements_[current_size_++]
[all...] |
| /prebuilts/misc/linux-x86_64/protobuf2.5/include/google/protobuf/ |
| repeated_field.h | 174 Element* elements_; member in class:google::protobuf::RepeatedField
268 elements_[i - num] = elements_[i];
316 void** elements_; member in class:google::protobuf::internal::RepeatedPtrFieldBase
552 : elements_(NULL),
559 : elements_(NULL),
568 : elements_(NULL),
578 delete [] elements_;
602 elements_[current_size_++] = value;
608 return &elements_[current_size_++]
[all...] |
| /prebuilts/misc/windows/protobuf2.5/include/google/protobuf/ |
| repeated_field.h | 174 Element* elements_; member in class:google::protobuf::RepeatedField
268 elements_[i - num] = elements_[i];
316 void** elements_; member in class:google::protobuf::internal::RepeatedPtrFieldBase
552 : elements_(NULL),
559 : elements_(NULL),
568 : elements_(NULL),
578 delete [] elements_;
602 elements_[current_size_++] = value;
608 return &elements_[current_size_++]
[all...] |
| /prebuilts/tools/linux-x86_64/protoc/include/google/protobuf/ |
| repeated_field.h | 174 Element* elements_; member in class:google::protobuf::RepeatedField
268 elements_[i - num] = elements_[i];
316 void** elements_; member in class:google::protobuf::internal::RepeatedPtrFieldBase
552 : elements_(NULL),
559 : elements_(NULL),
568 : elements_(NULL),
578 delete [] elements_;
602 elements_[current_size_++] = value;
608 return &elements_[current_size_++]
[all...] |
| /external/v8/src/ |
| key-accumulator.cc | 19 for (size_t i = 0; i < elements_.size(); i++) {
20 delete elements_[i];
35 // in |elements_| to deduce the number of keys to take from the
48 // properties from a proxy, hence we skip the integer keys in |elements_|
51 } else if (level < elements_.size()) {
53 std::vector<uint32_t>* elements = elements_[level];
146 for (size_t i = 1; i < elements_.size(); i++) {
147 if (AccumulatorHasKey(elements_[i - 1], key)) return false;
149 elements_.back()->push_back(key);
284 auto last_level = elements_.back()
[all...] |
| key-accumulator.h | 23 // in |elements_| into sorted lists per prototype level. String keys are
49 // |levelLengths_| and adding a new list to |elements_|.
51 // Sort the integer indices in the last list in |elements_|
65 // |elements_| contains the sorted element keys (indices) per level.
66 std::vector<std::vector<uint32_t>*> elements_; member in class:v8::internal::BASE_EMBEDDED
|
| /external/webrtc/webrtc/modules/audio_processing/beamformer/ |
| matrix.h | 55 // array, |data_|, or as an array of row pointers, |elements_|, but is
120 T* const* elements() { return &elements_[0]; }
121 const T* const* elements() const { return &elements_[0]; }
128 trace += elements_[i][i];
287 ss << elements_[i][j] << " "; local
308 elements_.resize(num_rows_);
311 elements_[i] = &data_[i * num_columns_];
329 std::vector<T*> elements_; member in class:webrtc::Matrix
331 // Stores temporary copies of |data_| and |elements_| for in-place operations
341 elements_[i][j] = src[j][i]
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-bch.cc | 85 Element* at(int index) const { return &(elements_.at(index)); }
122 for (int i = 0; i < elements_.length(); i++) {
179 elements_(graph->blocks()->length(), graph->zone()) {
183 elements_.Add(element, graph->zone());
366 ZoneList<Element> elements_; member in class:v8::internal::BASE_EMBEDDED
|
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/ |
| map.h | 557 delete elements_;
568 elements_ =
1671 InnerMap* elements_; member in union:google::protobuf::Map::__anon71556
[all...] |
| /external/v8/src/regexp/ |
| regexp-ast.h | 339 explicit RegExpText(Zone* zone) : elements_(2, zone), length_(0) {}
349 elements_.Add(elm, zone);
352 ZoneList<TextElement>* elements() { return &elements_; }
355 ZoneList<TextElement> elements_; member in class:v8::internal::final
|
| /toolchain/binutils/binutils-2.25/gold/ |
| script-sections.cc | 1962 Output_section_elements elements_; member in class:gold::Output_section_definition
3623 const Script_sections::Sections_elements* elements_; member in class:gold::Sort_output_sections
[all...] |
| /prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit/2.14/ |
| htmlunit-2.14.jar | |
