HomeSort by relevance Sort by last modified time
    Searched refs:elements_ (Results 1 - 25 of 44) sorted by null

1 2

  /external/chromium_org/webkit/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().SetToBlobUrl(blob_url);
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:webkit_glue::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 43 if (elements_.empty())
46 elements_[0]->set_requested_start_time(start_time_);
47 elements_[0]->Start(delegate, animation_group_id_);
55 if (elements_.empty())
61 size_t current_index = last_element_ % elements_.size();
63 while (is_cyclic_ || last_element_ < elements_.size()) {
64 elements_[current_index]->set_requested_start_time(last_start_);
65 if (!elements_[current_index]->IsFinished(now, &element_duration))
69 if (elements_[current_index]->ProgressToEnd(delegate))
74 elements_[current_index]->last_progressed_fraction()
    [all...]
  /external/chromium_org/ui/base/animation/
animation_container.cc 22 // elements_ is not empty, something is wrong.
23 DCHECK(elements_.empty());
27 DCHECK(elements_.count(element) == 0); // Start should only be invoked if the
30 if (elements_.empty()) {
38 elements_.insert(element);
42 DCHECK(elements_.count(element) > 0); // The element must be running.
44 elements_.erase(element);
46 if (elements_.empty()) {
70 Elements elements = elements_;
75 if (elements_.find(*i) != elements_.end()
    [all...]
animation_container.h 52 bool is_running() const { return !elements_.empty(); }
77 Elements elements_; member in class:ui::AnimationContainer
  /external/chromium_org/net/base/
upload_data.cc 20 elements_.push_back(new UploadElement());
21 elements_.back()->SetToBytes(bytes, bytes_len);
29 elements_.push_back(new UploadElement());
30 elements_.back()->SetToFilePathRange(file_path, offset, length,
upload_data.h 51 return elements_;
55 return &elements_;
59 elements_.swap(*elements);
73 ScopedVector<UploadElement> elements_; member in class:net::UploadData
  /external/chromium_org/ppapi/shared_impl/
array_var.cc 43 if (index >= elements_.size())
46 const PP_Var& element = elements_[index].get();
57 if (index >= elements_.size()) {
60 elements_.resize(index + 1);
63 elements_[index] = value;
68 if (elements_.size() > std::numeric_limits<uint32_t>::max()) {
73 return static_cast<uint32_t>(elements_.size());
79 elements_.resize(length);
array_var.h 41 return elements_;
45 return elements_;
52 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/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/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 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...]
  /external/open-vcdiff/gtest/src/
gtest-internal-inl.h 259 Vector() : elements_(NULL), capacity_(0), size_(0) {}
266 if (elements_ != NULL) {
268 delete elements_[i];
271 free(elements_);
272 elements_ = NULL;
310 elements_[index] = new E(element);
321 delete elements_[index];
333 if (predicate(*(elements_[i]))) {
348 functor(*(elements_[i]));
359 if (predicate(*elements_[i]))
483 E** elements_; member in class:testing::internal::Vector
    [all...]
  /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:__anon7993::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/chrome/browser/search_engines/
template_url_parser.cc 171 std::vector<ElementType> elements_; member in class:TemplateURLParsingContext
225 context->elements_.push_back(
281 context->elements_.pop_back();
469 if (elements_.size() == 2 && elements_[0] == OPEN_SEARCH_DESCRIPTION)
470 return elements_[1];
472 return (elements_.size() == 3 && elements_[0] == OPEN_SEARCH_DESCRIPTION &&
473 elements_[1] == URL && elements_[2] == PARAM) ? PARAM : UNKNOWN
    [all...]

Completed in 1626 milliseconds

1 2