File: access.pass.cpp

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
file content (121 lines) | stat: -rw-r--r-- 3,945 bytes parent folder | download | duplicates (9)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
//===----------------------------------------------------------------------===//
//
// 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;
}