summaryrefslogtreecommitdiffstats
path: root/libcxx/test/std/utilities/template.bitset/bitset.cons/string_ctor.pass.cpp
blob: 453db91f29db57fbeef6bb196cedc741dc1d8708 (plain)
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
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

// test bitset(string, pos, n, zero, one);

#include <bitset>
#include <cassert>
#include <algorithm> // for 'min' and 'max'
#include <stdexcept> // for 'invalid_argument'

#include "test_macros.h"

#if defined(TEST_COMPILER_C1XX)
#pragma warning(disable: 6294) // Ill-defined for-loop:  initial condition does not satisfy test.  Loop body not executed.
#endif

template <std::size_t N>
void test_string_ctor()
{
#ifndef TEST_HAS_NO_EXCEPTIONS
    {
        try {
            std::string str("xxx1010101010xxxx");
            std::bitset<N> v(str, str.size()+1, 10);
            assert(false);
        }
        catch (std::out_of_range&)
        {
        }
    }
    {
        try {
            std::string str("xxx1010101010xxxx");
            std::bitset<N> v(str, 2, 10);
            assert(false);
        }
        catch (std::invalid_argument&)
        {
        }
    }
    {
        try {
            std::string str("xxxbababababaxxxx");
            std::bitset<N> v(str, 2, 10, 'a', 'b');
            assert(false);
        }
        catch (std::invalid_argument&)
        {
        }
    }
#endif // TEST_HAS_NO_EXCEPTIONS
    {
        std::string str("xxx1010101010xxxx");
        std::bitset<N> v(str, 3, 10);
        std::size_t M = std::min<std::size_t>(N, 10);
        for (std::size_t i = 0; i < M; ++i)
            assert(v[i] == (str[3 + M - 1 - i] == '1'));
        for (std::size_t i = 10; i < N; ++i)
            assert(v[i] == false);
    }
    {
        std::string str("xxxbababababaxxxx");
        std::bitset<N> v(str, 3, 10, 'a', 'b');
        std::size_t M = std::min<std::size_t>(N, 10);
        for (std::size_t i = 0; i < M; ++i)
            assert(v[i] == (str[3 + M - 1 - i] == 'b'));
        for (std::size_t i = 10; i < N; ++i)
            assert(v[i] == false);
    }
}

int main(int, char**)
{
    test_string_ctor<0>();
    test_string_ctor<1>();
    test_string_ctor<31>();
    test_string_ctor<32>();
    test_string_ctor<33>();
    test_string_ctor<63>();
    test_string_ctor<64>();
    test_string_ctor<65>();
    test_string_ctor<1000>();

  return 0;
}
OpenPOWER on IntegriCloud