Lines Matching refs:storage_

62       : storage_(std::forward<Ts>(elements)...) {  in BoundedInlineVector()
72 storage_.data, &storage_.size); in BoundedInlineVector()
81 storage_.data, &storage_.size); in BoundedInlineVector()
89 bounded_inline_vector_impl::DestroyElements(storage_.data, storage_.size);
92 storage_.data, &storage_.size);
101 bounded_inline_vector_impl::DestroyElements(storage_.data, storage_.size);
104 storage_.data, &storage_.size);
108 bool empty() const { return storage_.size == 0; } in empty()
109 int size() const { return storage_.size; } in size()
118 if (new_size > storage_.size) { in resize()
120 storage_.data + storage_.size, new_size - storage_.size); in resize()
121 } else if (new_size < storage_.size) { in resize()
122 bounded_inline_vector_impl::DestroyElements(storage_.data + new_size, in resize()
123 storage_.size - new_size); in resize()
125 storage_.size = new_size; in resize()
128 const T* data() const { return storage_.data; } in data()
129 T* data() { return storage_.data; } in data()
133 RTC_DCHECK_LT(index, storage_.size);
134 return storage_.data[index];
138 RTC_DCHECK_LT(index, storage_.size);
139 return storage_.data[index];
142 T* begin() { return storage_.data; } in begin()
143 T* end() { return storage_.data + storage_.size; } in end()
144 const T* begin() const { return storage_.data; } in begin()
145 const T* end() const { return storage_.data + storage_.size; } in end()
146 const T* cbegin() const { return storage_.data; } in cbegin()
147 const T* cend() const { return storage_.data + storage_.size; } in cend()
150 bounded_inline_vector_impl::Storage<T, fixed_capacity> storage_;