/* * Copyright (c) 2014 The WebRTC project authors. All Rights Reserved. * * Use of this source code is governed by a BSD-style license * that can be found in the LICENSE file in the root of the source * tree. An additional intellectual property rights grant can be found * in the file PATENTS. All contributing project authors may * be found in the AUTHORS file in the root of the source tree. */ // Borrowed from Chromium's src/base/memory/scoped_vector.h. #ifndef WEBRTC_SYSTEM_WRAPPERS_INCLUDE_SCOPED_VECTOR_H_ #define WEBRTC_SYSTEM_WRAPPERS_INCLUDE_SCOPED_VECTOR_H_ #include #include "webrtc/base/checks.h" #include "webrtc/system_wrappers/include/stl_util.h" namespace webrtc { // ScopedVector wraps a vector deleting the elements from its // destructor. template class ScopedVector { public: typedef typename std::vector::allocator_type allocator_type; typedef typename std::vector::size_type size_type; typedef typename std::vector::difference_type difference_type; typedef typename std::vector::pointer pointer; typedef typename std::vector::const_pointer const_pointer; typedef typename std::vector::reference reference; typedef typename std::vector::const_reference const_reference; typedef typename std::vector::value_type value_type; typedef typename std::vector::iterator iterator; typedef typename std::vector::const_iterator const_iterator; typedef typename std::vector::reverse_iterator reverse_iterator; typedef typename std::vector::const_reverse_iterator const_reverse_iterator; ScopedVector() {} ~ScopedVector() { clear(); } // Move construction and assignment. ScopedVector(ScopedVector&& other) { *this = static_cast(other); } ScopedVector& operator=(ScopedVector&& other) { std::swap(v_, other.v_); // The arguments are std::vectors, so std::swap // is the one that we want. other.clear(); return *this; } // Deleted copy constructor and copy assignment, to make the type move-only. ScopedVector(const ScopedVector& other) = delete; ScopedVector& operator=(const ScopedVector& other) = delete; // Get an rvalue reference. (sv.Pass() does the same thing as std::move(sv).) ScopedVector&& Pass() { return static_cast(*this); } reference operator[](size_t index) { return v_[index]; } const_reference operator[](size_t index) const { return v_[index]; } bool empty() const { return v_.empty(); } size_t size() const { return v_.size(); } reverse_iterator rbegin() { return v_.rbegin(); } const_reverse_iterator rbegin() const { return v_.rbegin(); } reverse_iterator rend() { return v_.rend(); } const_reverse_iterator rend() const { return v_.rend(); } iterator begin() { return v_.begin(); } const_iterator begin() const { return v_.begin(); } iterator end() { return v_.end(); } const_iterator end() const { return v_.end(); } const_reference front() const { return v_.front(); } reference front() { return v_.front(); } const_reference back() const { return v_.back(); } reference back() { return v_.back(); } void push_back(T* elem) { v_.push_back(elem); } void pop_back() { RTC_DCHECK(!empty()); delete v_.back(); v_.pop_back(); } std::vector& get() { return v_; } const std::vector& get() const { return v_; } void swap(std::vector& other) { v_.swap(other); } void swap(ScopedVector& other) { v_.swap(other.v_); } void release(std::vector* out) { out->swap(v_); v_.clear(); } void reserve(size_t capacity) { v_.reserve(capacity); } // Resize, deleting elements in the disappearing range if we are shrinking. void resize(size_t new_size) { if (v_.size() > new_size) STLDeleteContainerPointers(v_.begin() + new_size, v_.end()); v_.resize(new_size); } template void assign(InputIterator begin, InputIterator end) { v_.assign(begin, end); } void clear() { STLDeleteElements(&v_); } // Like |clear()|, but doesn't delete any elements. void weak_clear() { v_.clear(); } // Lets the ScopedVector take ownership of |x|. iterator insert(iterator position, T* x) { return v_.insert(position, x); } // Lets the ScopedVector take ownership of elements in [first,last). template void insert(iterator position, InputIterator first, InputIterator last) { v_.insert(position, first, last); } iterator erase(iterator position) { delete *position; return v_.erase(position); } iterator erase(iterator first, iterator last) { STLDeleteContainerPointers(first, last); return v_.erase(first, last); } // Like |erase()|, but doesn't delete the element at |position|. iterator weak_erase(iterator position) { return v_.erase(position); } // Like |erase()|, but doesn't delete the elements in [first, last). iterator weak_erase(iterator first, iterator last) { return v_.erase(first, last); } private: std::vector v_; }; } // namespace webrtc #endif // WEBRTC_SYSTEM_WRAPPERS_INCLUDE_SCOPED_VECTOR_H_