| /external/chromium_org/content/common/ |
| resource_request_body.cc | 15 elements_.push_back(Element());
16 elements_.back().SetToBytes(bytes, bytes_len);
24 elements_.push_back(Element());
25 elements_.back().SetToFilePathRange(file_path, offset, length,
30 elements_.push_back(Element());
31 elements_.back().SetToBlob(uuid);
37 elements_.push_back(Element());
38 elements_.back().SetToFileSystemUrlRange(url, offset, length,
|
| resource_request_body.h | 41 const std::vector<Element>* elements() const { return &elements_; }
42 std::vector<Element>* elements_mutable() { return &elements_; }
44 elements_.swap(*elements);
57 std::vector<Element> elements_; member in class:content::ResourceRequestBody
|
| /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_org/ui/compositor/ |
| layer_animation_sequence.cc | 48 if (elements_.empty())
51 elements_[0]->set_requested_start_time(start_time_);
52 elements_[0]->Start(delegate, animation_group_id_);
60 if (elements_.empty())
66 size_t current_index = last_element_ % elements_.size();
68 while (is_cyclic_ || last_element_ < elements_.size()) {
69 elements_[current_index]->set_requested_start_time(last_start_);
70 if (!elements_[current_index]->IsFinished(now, &element_duration))
74 if (elements_[current_index]->ProgressToEnd(delegate))
79 elements_[current_index]->last_progressed_fraction()
[all...] |
| /external/chromium_org/ui/gfx/animation/ |
| animation_container.cc | 23 // elements_ is not empty, something is wrong.
24 DCHECK(elements_.empty());
28 DCHECK(elements_.count(element) == 0); // Start should only be invoked if the
31 if (elements_.empty()) {
39 elements_.insert(element);
43 DCHECK(elements_.count(element) > 0); // The element must be running.
45 elements_.erase(element);
47 if (elements_.empty()) {
71 Elements elements = elements_;
76 if (elements_.find(*i) != elements_.end()
[all...] |
| animation_container.h | 52 bool is_running() const { return !elements_.empty(); }
77 Elements elements_; member in class:gfx::AnimationContainer
|
| /external/chromium_org/ppapi/shared_impl/ |
| array_var.cc | 37 if (index >= elements_.size())
40 const PP_Var& element = elements_[index].get();
51 if (index >= elements_.size()) {
54 elements_.resize(index + 1);
57 elements_[index] = value;
62 if (elements_.size() > std::numeric_limits<uint32_t>::max()) {
67 return static_cast<uint32_t>(elements_.size());
73 elements_.resize(length);
|
| array_var.h | 40 const ElementVector& elements() const { return elements_; }
42 ElementVector& elements() { return elements_; }
48 ElementVector elements_; member in class:ppapi::ArrayVar
|
| /external/chromium_org/third_party/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 | 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/chromium_org/v8/src/heap/ |
| gc-tracer.h | 20 const_iterator() : index_(0), elements_(NULL) {}
23 : index_(index), elements_(elements) {}
26 return elements_ == rhs.elements_ && index_ == rhs.index_;
30 return elements_ != rhs.elements_ || index_ != rhs.index_;
33 operator const T*() const { return elements_ + index_; }
35 const T* operator->() const { return elements_ + index_; }
37 const T& operator*() const { return elements_[index_]; }
51 const T* elements_; member in class:v8::internal::RingBuffer::const_iterator
75 T elements_[MAX_SIZE + 1]; member in class:v8::internal::RingBuffer
[all...] |
| /external/openfst/src/include/fst/ |
| partition.h | 62 for (size_t i = 0; i < elements_.size(); ++i)
63 delete elements_[i];
72 for (size_t i = 0; i < elements_.size(); ++i)
73 delete elements_[i];
74 elements_.clear();
78 elements_.resize(num_states);
82 elements_[i] = new Element(i);
108 Element* element = elements_[element_id];
125 Element* element = elements_[element_id];
149 if (class_split_[class_id] == elements_[element_id]
233 vector<Element*> elements_; member in class:fst::Partition
[all...] |
| determinize.h | 202 subsets_(table_size_, new SubsetKey(), new SubsetEqual(&elements_)) { }
206 subsets_(table_size_, new SubsetKey(), new SubsetEqual(&elements_)) { }
239 : elements_(elements) {}
241 // At each call to operator(), the elements_ vector should contain
242 // only NULLs. When this operator returns, elements_ will still
258 while (elements_->size() <= element1.state_id)
259 elements_->push_back(0);
260 (*elements_)[element1.state_id] = &element1;
268 while (elements_->size() <= element2.state_id)
269 elements_->push_back(0)
285 vector<Element *> *elements_; member in class:fst::DefaultDeterminizeStateTable::SubsetEqual
316 vector<Element *> elements_; member in class:fst::DefaultDeterminizeStateTable
680 vector<Element *> elements_; member in class:fst::DeterminizeFsaImpl
[all...] |
| /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 | 226 subset_hash_(0, SubsetKey(), SubsetEqual(&elements_)) {
338 while ((StateId)elements_.size() <= dest_element.state_id)
339 elements_.push_back(0);
340 Element *matching_element = elements_[dest_element.state_id];
349 elements_[dest_element.state_id] = &dest_element;
365 elements_[dest_element.state_id] = 0;
380 : elements_(elements) {}
382 // At each call to operator(), elements_[state] must be defined and
384 // 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 | 188 const Element &e = elements_[s];
234 unfactored_[e.state] = elements_.size();
235 elements_.push_back(e);
243 StateId s = elements_.size();
244 elements_.push_back(e);
254 Element e = elements_[s];
316 vector<Element> elements_; // mapping Fst state to Elements member in class:fst::FactorWeightFstImpl
|
| /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_org/courgette/ |
| ensemble.h | 76 const std::vector<Element*>& elements() const { return elements_; }
84 std::vector<Element*> elements_; // Embedded elements discovered. member in class:courgette::Ensemble
|
| ensemble.cc | 52 elements_.push_back(element);
|
| /external/chromium_org/chrome/browser/profile_resetter/ |
| brandcode_config_fetcher.cc | 71 std::vector<std::string> elements_; member in class:__anon9127::XmlConfigParser
114 context->elements_.push_back(node_name);
121 context->elements_.pop_back();
134 return elements_.size() == arraysize(data_path) &&
135 std::equal(elements_.begin(), elements_.end(), data_path);
|
| /external/chromium_org/components/search_engines/ |
| template_url_parser.cc | 166 std::vector<ElementType> elements_; member in class:TemplateURLParsingContext
225 context->elements_.push_back(
286 context->elements_.pop_back();
476 if (elements_.size() == 2 && elements_[0] == OPEN_SEARCH_DESCRIPTION)
477 return elements_[1];
479 return (elements_.size() == 3 && elements_[0] == OPEN_SEARCH_DESCRIPTION &&
480 elements_[1] == URL && elements_[2] == PARAM) ? PARAM : UNKNOWN
[all...] |
| /external/chromium_org/content/shell/renderer/test_runner/ |
| accessibility_controller.h | 61 WebAXObjectProxyList elements_; member in class:content::AccessibilityController
|
| accessibility_controller.cc | 144 elements_.Clear();
181 v8::Handle<v8::Object> element_handle = elements_.GetOrCreate(target);
232 return elements_.GetOrCreate(focused_element_);
238 return elements_.CreateRoot(root_element_);
264 return elements_.GetOrCreate(obj);
|
| /external/chromium_org/v8/src/ |
| 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());
367 ZoneList<Element> elements_; member in class:v8::internal::BASE_EMBEDDED
|
