void reserve(size_type __n);
void shrink_to_fit() _NOEXCEPT;
- _LIBCPP_INLINE_VISIBILITY reference operator[](size_type __n);
- _LIBCPP_INLINE_VISIBILITY const_reference operator[](size_type __n) const;
+ _LIBCPP_INLINE_VISIBILITY reference operator[](size_type __n) _NOEXCEPT;
+ _LIBCPP_INLINE_VISIBILITY const_reference operator[](size_type __n) const _NOEXCEPT;
reference at(size_type __n);
const_reference at(size_type __n) const;
- _LIBCPP_INLINE_VISIBILITY reference front()
+ _LIBCPP_INLINE_VISIBILITY reference front() _NOEXCEPT
{
_LIBCPP_ASSERT(!empty(), "front() called for empty vector");
return *this->__begin_;
}
- _LIBCPP_INLINE_VISIBILITY const_reference front() const
+ _LIBCPP_INLINE_VISIBILITY const_reference front() const _NOEXCEPT
{
_LIBCPP_ASSERT(!empty(), "front() called for empty vector");
return *this->__begin_;
}
- _LIBCPP_INLINE_VISIBILITY reference back()
+ _LIBCPP_INLINE_VISIBILITY reference back() _NOEXCEPT
{
_LIBCPP_ASSERT(!empty(), "back() called for empty vector");
return *(this->__end_ - 1);
}
- _LIBCPP_INLINE_VISIBILITY const_reference back() const
+ _LIBCPP_INLINE_VISIBILITY const_reference back() const _NOEXCEPT
{
_LIBCPP_ASSERT(!empty(), "back() called for empty vector");
return *(this->__end_ - 1);
template <class _Tp, class _Allocator>
inline _LIBCPP_INLINE_VISIBILITY
typename vector<_Tp, _Allocator>::reference
-vector<_Tp, _Allocator>::operator[](size_type __n)
+vector<_Tp, _Allocator>::operator[](size_type __n) _NOEXCEPT
{
_LIBCPP_ASSERT(__n < size(), "vector[] index out of bounds");
return this->__begin_[__n];
template <class _Tp, class _Allocator>
inline _LIBCPP_INLINE_VISIBILITY
typename vector<_Tp, _Allocator>::const_reference
-vector<_Tp, _Allocator>::operator[](size_type __n) const
+vector<_Tp, _Allocator>::operator[](size_type __n) const _NOEXCEPT
{
_LIBCPP_ASSERT(__n < size(), "vector[] index out of bounds");
return this->__begin_[__n];
--- /dev/null
+//===----------------------------------------------------------------------===//
+//
+// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
+// See https://llvm.org/LICENSE.txt for license information.
+// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
+//
+//===----------------------------------------------------------------------===//
+
+// <vector>
+
+// reference operator[](size_type __i);
+// const_reference operator[](size_type __i) const;
+//
+// reference at(size_type __i);
+// const_reference at(size_type __i) const;
+//
+// reference front();
+// const_reference front() const;
+//
+// reference back();
+// const_reference back() const;
+// libc++ marks these as 'noexcept' (except 'at')
+
+#include <vector>
+#include <cassert>
+
+#include "min_allocator.h"
+#include "test_macros.h"
+
+template <class C>
+C
+make(int size, int start = 0)
+{
+ C c;
+ for (int i = 0; i < size; ++i)
+ c.push_back(start + i);
+ return c;
+}
+
+int main(int, char**)
+{
+ {
+ typedef std::vector<int> C;
+ C c = make<C>(10);
+ LIBCPP_ASSERT_NOEXCEPT(c[0]);
+ LIBCPP_ASSERT_NOEXCEPT(c.front());
+ LIBCPP_ASSERT_NOEXCEPT(c.back());
+ // at() is NOT noexcept
+ ASSERT_SAME_TYPE(C::reference, decltype(c[0]));
+ ASSERT_SAME_TYPE(C::reference, decltype(c.at(0)));
+ ASSERT_SAME_TYPE(C::reference, decltype(c.front()));
+ ASSERT_SAME_TYPE(C::reference, decltype(c.back()));
+ for (int i = 0; i < 10; ++i)
+ assert(c[i] == i);
+ for (int i = 0; i < 10; ++i)
+ assert(c.at(i) == i);
+ assert(c.front() == 0);
+ assert(c.back() == 9);
+ }
+ {
+ typedef std::vector<int> C;
+ const int N = 5;
+ const C c = make<C>(10, N);
+ LIBCPP_ASSERT_NOEXCEPT(c[0]);
+ LIBCPP_ASSERT_NOEXCEPT(c.front());
+ LIBCPP_ASSERT_NOEXCEPT(c.back());
+ // at() is NOT noexcept
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c[0]));
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c.at(0)));
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c.front()));
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c.back()));
+ for (int i = 0; i < 10; ++i)
+ assert(c[i] == N + i);
+ for (int i = 0; i < 10; ++i)
+ assert(c.at(i) == N + i);
+ assert(c.front() == N);
+ assert(c.back() == N + 9);
+ }
+#if TEST_STD_VER >= 11
+ {
+ typedef std::vector<int, min_allocator<int>> C;
+ const int N = 34;
+ C c = make<C>(10, N);
+ LIBCPP_ASSERT_NOEXCEPT(c[0]);
+ LIBCPP_ASSERT_NOEXCEPT(c.front());
+ LIBCPP_ASSERT_NOEXCEPT(c.back());
+ // at() is NOT noexcept
+ ASSERT_SAME_TYPE(C::reference, decltype(c[0]));
+ ASSERT_SAME_TYPE(C::reference, decltype(c.at(0)));
+ ASSERT_SAME_TYPE(C::reference, decltype(c.front()));
+ ASSERT_SAME_TYPE(C::reference, decltype(c.back()));
+ for (int i = 0; i < 10; ++i)
+ assert(c[i] == N + i);
+ for (int i = 0; i < 10; ++i)
+ assert(c.at(i) == N + i);
+ assert(c.front() == N);
+ assert(c.back() == N + 9);
+ }
+ {
+ typedef std::vector<int, min_allocator<int>> C;
+ const int N = 23;
+ const C c = make<C>(10, N);
+ LIBCPP_ASSERT_NOEXCEPT(c[0]);
+ LIBCPP_ASSERT_NOEXCEPT(c.front());
+ LIBCPP_ASSERT_NOEXCEPT(c.back());
+ // at() is NOT noexcept
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c[0]));
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c.at(0)));
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c.front()));
+ ASSERT_SAME_TYPE(C::const_reference, decltype(c.back()));
+ for (int i = 0; i < 10; ++i)
+ assert(c[i] == N + i);
+ for (int i = 0; i < 10; ++i)
+ assert(c.at(i) == N + i);
+ assert(c.front() == N);
+ assert(c.back() == N + 9);
+ }
+#endif
+
+ return 0;
+}