Home
last modified time | relevance | path

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

/external/protobuf/src/google/protobuf/
Drepeated_field.cc45 void** old_elements = elements_; in Reserve()
47 elements_ = new void*[total_size_]; in Reserve()
48 memcpy(elements_, old_elements, allocated_size_ * sizeof(elements_[0])); in Reserve()
55 void** swap_elements = elements_; in Swap()
64 elements_ = other->elements_; in Swap()
70 other->elements_ = swap_elements; in Swap()
76 if (elements_ == other->initial_space_) { in Swap()
77 elements_ = initial_space_; in Swap()
79 if (other->elements_ == initial_space_) { in Swap()
80 other->elements_ = other->initial_space_; in Swap()
Drepeated_field.h134 Element* elements_; variable
250 void** elements_; variable
422 : elements_(initial_space_), in RepeatedField()
429 if (elements_ != initial_space_) { in ~RepeatedField()
430 delete [] elements_; in ~RepeatedField()
447 elements_[current_size_++] = value; in AddAlreadyReserved()
453 return &elements_[current_size_++]; in AddAlreadyReserved()
459 return elements_[index]; in Get()
465 return elements_ + index; in Mutable()
471 elements_[index] = value; in Set()
[all …]
/external/chromium/net/base/
Dupload_data.cc132 elements_.push_back(Element()); in AppendBytes()
133 elements_.back().SetToBytes(bytes, bytes_len); in AppendBytes()
139 elements_.push_back(Element()); in AppendFile()
140 elements_.back().SetToFilePath(file_path); in AppendFile()
147 elements_.push_back(Element()); in AppendFileRange()
148 elements_.back().SetToFilePathRange(file_path, offset, length, in AppendFileRange()
154 elements_.push_back(Element()); in AppendBlob()
155 elements_.back().SetToBlobUrl(blob_url); in AppendBlob()
162 elements_.push_back(Element()); in AppendChunk()
163 elements_.back().SetToChunk(bytes, bytes_len, is_last_chunk); in AppendChunk()
[all …]
Dupload_data.h171 return &elements_; in elements()
177 elements_.swap(*elements); in swap_elements()
191 std::vector<Element> elements_; variable
/external/protobuf/gtest/src/
Dgtest-internal-inl.h255 Vector() : elements_(NULL), capacity_(0), size_(0) {} in Vector()
262 if (elements_ != NULL) { in Clear()
264 delete elements_[i]; in Clear() local
267 free(elements_); in Clear()
268 elements_ = NULL; in Clear()
306 elements_[index] = new E(element); in Insert()
317 delete elements_[index]; in Erase() local
329 if (predicate(*(elements_[i]))) { in CountIf()
344 functor(*(elements_[i])); in ForEach()
355 if (predicate(*elements_[i])) { in FindIf()
[all …]
/external/openfst/src/include/fst/
Dpartition.h62 for (size_t i = 0; i < elements_.size(); ++i) in ~Partition()
63 delete elements_[i]; in ~Partition() local
72 for (size_t i = 0; i < elements_.size(); ++i) in Initialize()
73 delete elements_[i]; in Initialize() local
74 elements_.clear(); in Initialize()
78 elements_.resize(num_states); in Initialize()
82 elements_[i] = new Element(i); in Initialize()
108 Element* element = elements_[element_id]; in Add()
125 Element* element = elements_[element_id]; in Move()
149 if (class_split_[class_id] == elements_[element_id]) in SplitOn()
[all …]
Ddeterminize.h267 subset_hash_(0, SubsetKey(), SubsetEqual(&elements_)) { in DeterminizeFsaImpl()
287 subset_hash_(0, SubsetKey(), SubsetEqual(&elements_)) { in DeterminizeFsaImpl()
436 while (elements_.size() <= dest_element.state_id) in AddArc()
437 elements_.push_back(0); in AddArc()
438 Element *matching_element = elements_[dest_element.state_id]; in AddArc()
449 elements_[dest_element.state_id] = &dest_element; in AddArc()
465 elements_[dest_element.state_id] = 0; in AddArc()
480 : elements_(elements) {} in SubsetEqual()
494 while (elements_->size() <= element1.state_id) in operator()
495 elements_->push_back(0); in operator()
[all …]
Dfactor-weight.h233 const Element &e = elements_[s]; in Final()
288 unfactored_[e.state] = elements_.size(); in FindState()
289 elements_.push_back(e); in FindState()
297 StateId s = elements_.size(); in FindState()
298 elements_.push_back(e); in FindState()
308 Element e = elements_[s]; in Expand()
375 vector<Element> elements_; // mapping Fst state to Elements variable
Dsynchronize.h130 const Element &e = elements_[s]; in Final()
229 StateId s = elements_.size(); in FindState()
230 elements_.push_back(e); in FindState()
240 Element e = elements_[s]; in Expand()
325 vector<Element> elements_; // mapping Fst state to Elements variable
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dpartition.h57 for (size_t i = 0; i < elements_.size(); ++i) in ~Partition()
58 delete elements_[i]; in ~Partition() local
67 for (size_t i = 0; i < elements_.size(); ++i) in Initialize()
68 delete elements_[i]; in Initialize() local
69 elements_.clear(); in Initialize()
73 elements_.resize(num_states); in Initialize()
77 elements_[i] = new Element(i); in Initialize()
103 Element* element = elements_[element_id]; in Add()
120 Element* element = elements_[element_id]; in Move()
144 if (class_split_[class_id] == elements_[element_id]) in SplitOn()
[all …]
Ddeterminize.h228 subset_hash_(0, SubsetKey(), SubsetEqual(&elements_)) { in DeterminizeFsaImpl()
340 while ((StateId)elements_.size() <= dest_element.state_id) in AddArc()
341 elements_.push_back(0); in AddArc()
342 Element *matching_element = elements_[dest_element.state_id]; in AddArc()
351 elements_[dest_element.state_id] = &dest_element; in AddArc()
367 elements_[dest_element.state_id] = 0; in AddArc()
382 : elements_(elements) {} in SubsetEqual()
397 (*elements_)[element1.state_id] = &element1; in operator()
405 Element *element1 = (*elements_)[element2.state_id]; in operator()
411 (*elements_)[iter1->state_id] = 0; in operator()
[all …]
Dfactor-weight.h190 const Element &e = elements_[s]; in Final()
236 unfactored_[e.state] = elements_.size(); in FindState()
237 elements_.push_back(e); in FindState()
245 StateId s = elements_.size(); in FindState()
246 elements_.push_back(e); in FindState()
256 Element e = elements_[s]; in Expand()
318 vector<Element> elements_; // mapping Fst state to Elements variable
Dsynchronize.h108 const Element &e = elements_[s]; in Final()
198 StateId s = elements_.size(); in FindState()
199 elements_.push_back(e); in FindState()
209 Element e = elements_[s]; in Expand()
294 vector<Element> elements_; // mapping Fst state to Elements variable
/external/chromium/chrome/browser/search_engines/
Dtemplate_url_parser.cc119 elements_.push_back(type); in PushElement()
123 elements_.pop_back(); in PopElement()
128 if (elements_.size() == 2 && elements_[0] == OPEN_SEARCH_DESCRIPTION) in GetKnownType()
129 return elements_[1]; in GetKnownType()
132 if (elements_.size() == 3 && elements_[0] == OPEN_SEARCH_DESCRIPTION && in GetKnownType()
133 elements_[1] == URL && elements_[2] == PARAM) in GetKnownType()
232 std::vector<ElementType> elements_; member in __anon07b545e50111::ParsingContext
/external/v8/src/
Dliveobjectlist.cc358 elements_(0), in LolIterator()
366 while ((elements_ == NULL) && !Done()) { in Init()
383 if (elements_ != NULL) break; in Next()
391 return elements_[index_].id_; in Id()
394 return elements_[index_].obj_; in Obj()
406 elements_ = curr_->elements_; in SetCurrent()
415 LiveObjectList::Element* elements_; member in v8::internal::LolIterator
431 while ((elements_ == NULL) && !Done()) { in Init()
448 if (elements_ != NULL) break; in Next()
931 elements_ = NewArray<Element>(capacity); in LiveObjectList()
[all …]
Dliveobjectlist-inl.h98 Element* elements = lol->elements_; in FindElementFor()
Dheap-inl.h681 Element e = elements_[hash]; in Get()
695 elements_[hash].in[0] = c.integers[0]; in Get()
696 elements_[hash].in[1] = c.integers[1]; in Get()
697 elements_[hash].output = heap_number; in Get()
Dliveobjectlist.h205 Element* elements_; variable
Dast.h2375 RegExpText() : elements_(2), length_(0) {} in RegExpText()
2386 elements_.Add(elm); in AddElement()
2389 ZoneList<TextElement>* elements() { return &elements_; } in elements()
2391 ZoneList<TextElement> elements_;
Dheap.h2569 Element elements_[kCacheSize]; variable
Dheap.cc6875 elements_[i].in[0] = in0; in SubCache()
6876 elements_[i].in[1] = in1; in SubCache()
6877 elements_[i].output = NULL; in SubCache()