blob: 52dc3893a310133424cd3d2382c236a433635746 (
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
|
// Copyright (C) 2018 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// { dg-do run { target c++11 } }
#include <tr2/dynamic_bitset>
#include <testsuite_hooks.h>
void
test01()
{
std::tr2::dynamic_bitset<unsigned> b;
VERIFY( b.size() == 0 );
VERIFY( b.find_first() == b.size() );
b.push_back(0);
VERIFY( b.size() == 1 );
VERIFY( b.find_first() == b.size() );
b.push_back(0);
VERIFY( b.size() == 2 );
VERIFY( b.find_first() == b.size() );
b.push_back(1);
VERIFY( b.size() == 3 );
VERIFY( b.find_first() == b.size() - 1 );
b.push_back(1);
VERIFY( b.size() == 4 );
VERIFY( b.find_first() == b.size() - 2 );
b.push_back(0);
VERIFY( b.size() == 5 );
VERIFY( b.find_first() == b.size() - 3 );
b.clear();
VERIFY( b.size() == 0 );
VERIFY( b.find_first() == b.size() );
b.push_back(1);
VERIFY( b.size() == 1 );
VERIFY( b.find_first() == 0 );
b.push_back(1);
VERIFY( b.size() == 2 );
VERIFY( b.find_first() == 0 );
b.push_back(1);
VERIFY( b.size() == 3 );
VERIFY( b.find_first() == 0 );
b.clear();
b.append(2u);
VERIFY( b.size() == b.bits_per_block );
VERIFY( b.find_first() == 1 );
b <<= 1;
VERIFY( b.find_first() == 2 );
b <<= 3;
VERIFY( b.find_first() == 5 );
b <<= 6;
VERIFY( b.find_first() == 11 );
VERIFY( b.size() == b.bits_per_block );
}
int
main()
{
test01();
}
|
