| /external/protobuf/src/google/protobuf/ |
| repeated_field.cc | 45 void** old_elements = elements_;
47 elements_ = new void*[total_size_];
48 memcpy(elements_, old_elements, allocated_size_ * sizeof(elements_[0]));
55 void** swap_elements = elements_;
64 elements_ = other->elements_;
70 other->elements_ = swap_elements;
76 if (elements_ == other->initial_space_) {
77 elements_ = initial_space_
[all...] |
| repeated_field.h | 134 Element* elements_; member in class:google::protobuf::RepeatedField
250 void** elements_; member in class:google::protobuf::internal::RepeatedPtrFieldBase
422 : elements_(initial_space_),
429 if (elements_ != initial_space_) {
430 delete [] elements_;
447 elements_[current_size_++] = value;
453 return &elements_[current_size_++];
459 return elements_[index];
465 return elements_ + index;
471 elements_[index] = value
[all...] |
| /external/chromium/net/base/ |
| upload_data.cc | 132 elements_.push_back(Element());
133 elements_.back().SetToBytes(bytes, bytes_len);
139 elements_.push_back(Element());
140 elements_.back().SetToFilePath(file_path);
147 elements_.push_back(Element());
148 elements_.back().SetToFilePathRange(file_path, offset, length,
154 elements_.push_back(Element());
155 elements_.back().SetToBlobUrl(blob_url);
162 elements_.push_back(Element());
163 elements_.back().SetToChunk(bytes, bytes_len, is_last_chunk)
[all...] |
| upload_data.h | 171 return &elements_;
177 elements_.swap(*elements);
191 std::vector<Element> elements_; member in class:net::UploadData
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| partition.h | 57 for (size_t i = 0; i < elements_.size(); ++i)
58 delete elements_[i];
67 for (size_t i = 0; i < elements_.size(); ++i)
68 delete elements_[i];
69 elements_.clear();
73 elements_.resize(num_states);
77 elements_[i] = new Element(i);
103 Element* element = elements_[element_id];
120 Element* element = elements_[element_id];
144 if (class_split_[class_id] == elements_[element_id]
228 vector<Element*> elements_; member in class:fst::Partition
[all...] |
| determinize.h | 228 subset_hash_(0, SubsetKey(), SubsetEqual(&elements_)) {
340 while ((StateId)elements_.size() <= dest_element.state_id)
341 elements_.push_back(0);
342 Element *matching_element = elements_[dest_element.state_id];
351 elements_[dest_element.state_id] = &dest_element;
367 elements_[dest_element.state_id] = 0;
382 : elements_(elements) {}
384 // At each call to operator(), elements_[state] must be defined and
386 // returns, elements_ will preserve that property. We keep it
397 (*elements_)[element1.state_id] = &element1
420 vector<Element *> *elements_; member in class:fst::DeterminizeFsaImpl::SubsetEqual
451 vector<Element *> elements_; member in class:fst::DeterminizeFsaImpl
[all...] |
| factor-weight.h | 190 const Element &e = elements_[s];
236 unfactored_[e.state] = elements_.size();
237 elements_.push_back(e);
245 StateId s = elements_.size();
246 elements_.push_back(e);
256 Element e = elements_[s];
318 vector<Element> elements_; // mapping Fst state to Elements member in class:fst::FactorWeightFstImpl
|
| synchronize.h | 108 const Element &e = elements_[s];
198 StateId s = elements_.size();
199 elements_.push_back(e);
209 Element e = elements_[s];
294 vector<Element> elements_; // mapping Fst state to Elements member in class:fst::SynchronizeFstImpl
|
| /external/protobuf/gtest/src/ |
| gtest-internal-inl.h | 255 Vector() : elements_(NULL), capacity_(0), size_(0) {}
262 if (elements_ != NULL) {
264 delete elements_[i];
267 free(elements_);
268 elements_ = NULL;
306 elements_[index] = new E(element);
317 delete elements_[index];
329 if (predicate(*(elements_[i]))) {
344 functor(*(elements_[i]));
355 if (predicate(*elements_[i]))
479 E** elements_; member in class:testing::internal::Vector
[all...] |
| /external/chromium/chrome/browser/search_engines/ |
| template_url_parser.cc | 119 elements_.push_back(type);
123 elements_.pop_back();
128 if (elements_.size() == 2 && elements_[0] == OPEN_SEARCH_DESCRIPTION)
129 return elements_[1];
132 if (elements_.size() == 3 && elements_[0] == OPEN_SEARCH_DESCRIPTION &&
133 elements_[1] == URL && elements_[2] == PARAM)
232 std::vector<ElementType> elements_; member in class:__anon2933::ParsingContext
[all...] |
| /external/v8/src/ |
| liveobjectlist.cc | 356 elements_(0),
362 // If the elements_ list is empty, then move on to the next list as long
364 while ((elements_ == NULL) && !Done()) {
381 if (elements_ != NULL) break;
389 return elements_[index_].id_;
392 return elements_[index_].obj_;
404 elements_ = curr_->elements_;
413 LiveObjectList::Element* elements_; member in class:v8::internal::LolIterator
427 // If the elements_ list is empty, then move on to the next list as lon
[all...] |
| liveobjectlist-inl.h | 98 Element* elements = lol->elements_;
|
| heap-inl.h | 661 Element e = elements_[hash];
675 elements_[hash].in[0] = c.integers[0];
676 elements_[hash].in[1] = c.integers[1];
677 elements_[hash].output = heap_number;
|
| ast.h | 1993 ZoneList<TextElement> elements_; member in class:v8::internal::RegExpText
[all...] |
| liveobjectlist.h | 206 Element *elements_; member in class:v8::internal::LiveObjectList
|
| heap.cc | [all...] |
| heap.h | [all...] |
