Lines Matching defs:value
41 // circular_deque(size_t count, const T& value);
51 // void assign(size_t count, const T& value);
53 // void assign(std::initializer_list<T> value);
91 // void resize(size_t count, const T& value);
94 // void insert(const_iterator pos, size_type count, const T& value);
97 // iterator insert(const_iterator pos, const T& value);
98 // iterator insert(const_iterator pos, T&& value);
421 // Constructs with |count| copies of |value| or default constructed version.
423 circular_deque(size_type count, const T& value) { resize(count, value); }
483 void assign(size_type count, const value_type& value) {
487 emplace_back(value);
493 typename std::enable_if<::base::internal::is_iterator<InputIterator>::value,
505 void assign(std::initializer_list<value_type> value) {
506 reserve(std::distance(value.begin(), value.end()));
507 assign(value.begin(), value.end());
625 // size, elements are added to the end with |value| or the default
630 // There are two versions rather than using a default value to avoid
654 void resize(size_type count, const value_type& value) {
659 emplace_back(value);
684 void insert(const_iterator pos, size_type count, const T& value) {
691 push_front(value);
699 new (&buffer_[insert_cur.index_]) T(value);
707 // value) version when value is an integer.
709 typename std::enable_if<::base::internal::is_iterator<InputIterator>::value,
746 iterator insert(const_iterator pos, const T& value) {
747 return emplace(pos, value);
749 iterator insert(const_iterator pos, T&& value) {
750 return emplace(pos, std::move(value));
830 void push_front(const T& value) { emplace_front(value); }
831 void push_front(T&& value) { emplace_front(std::move(value)); }
833 void push_back(const T& value) { emplace_back(value); }
834 void push_back(T&& value) { emplace_back(std::move(value)); }
1097 void Erase(circular_deque<T>& container, const Value& value) {
1098 container.erase(std::remove(container.begin(), container.end(), value),