Lines Matching defs:vector_
140 // Returns a pointer to the element in vector_ if it was found, or NULL
199 bool IsUsingVector() const { return vector_ != NULL; }
224 Vector<ElementType>* vector_;
226 std::vector<ElementType>* vector_;
335 : valid_cached_min_(false), sorted_(true), size_(0), vector_(NULL) {
343 : valid_cached_min_(false), sorted_(true), size_(0), allocator_(allocator), vector_(NULL) {
355 delete vector_;
383 vector_->push_back(element);
390 vector_ =
393 vector_ = allocator_.New<Vector<ElementType>>(
396 vector_->push_back(element);
402 cached_min_index_ = IsUsingVector() ? vector_->size() - 1 : size_ - 1;
463 vector_->clear();
503 VIXL_ASSERT((&(vector_->front()) <= element) &&
504 (element <= &(vector_->back())));
600 ElementType* start = &(vector_->front());
601 ElementType* end = start + vector_->size();
623 vector_->erase(vector_->begin() + (first_invalid - start), vector_->end());
624 VIXL_ASSERT(vector_->size() == size_);
639 return IsUsingVector() ? vector_->front() : preallocated_[0];
646 return IsUsingVector() ? vector_->back() : preallocated_[size_ - 1];
655 typename Vector<ElementType>::reverse_iterator it = vector_->rbegin();
659 vector_->erase(it.base(), vector_->end());
667 return IsUsingVector() ? &(vector_->front()) : preallocated_;
673 return IsUsingVector() ? &(vector_->back()) + 1 : preallocated_ + size_;
679 return IsUsingVector() ? &(vector_->front()) : preallocated_;
685 return IsUsingVector() ? &(vector_->back()) + 1 : preallocated_ + size_;
700 VIXL_ASSERT((IsUsingVector() && (index < vector_->size())) ||
707 VIXL_ASSERT((IsUsingVector() && (index < vector_->size())) ||
748 size_t n_invalid_elements = vector_->size() - size_;
750 (n_invalid_elements > vector_->size() / RECLAIM_FACTOR);
774 inval_set_->vector_->begin());
777 inval_set_->vector_->begin());
813 bool done = (iterator_ == inval_set_->vector_->end());
826 iterator_ = inval_set_->vector_->end();
858 while ((iterator_ != inval_set_->vector_->end()) && !IsValid(*iterator_)) {