right_shift.pass.cpp revision b64f8b07c104c6cc986570ac8ee0ed16a9f23976
1c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant//===----------------------------------------------------------------------===//
2c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant//
3c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant//                     The LLVM Compiler Infrastructure
4c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant//
5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open
6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details.
7c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant//
8c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant//===----------------------------------------------------------------------===//
9c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
10c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant// test bitset<N> operator>>(size_t pos) const;
11c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
12c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant#include <bitset>
13c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant#include <cstdlib>
14c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant#include <cassert>
15c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
16c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnanttemplate <std::size_t N>
17c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnantstd::bitset<N>
18c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnantmake_bitset()
19c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant{
20c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    std::bitset<N> v;
21c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    for (std::size_t i = 0; i < N; ++i)
22c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant        v[i] = static_cast<bool>(std::rand() & 1);
23c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    return v;
24c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant}
25c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
26c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnanttemplate <std::size_t N>
27c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnantvoid test_right_shift()
28c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant{
29c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    for (std::size_t s = 0; s <= N+1; ++s)
30c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    {
31c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant        std::bitset<N> v1 = make_bitset<N>();
32c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant        std::bitset<N> v2 = v1;
33c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant        assert((v1 >>= s) == (v2 >> s));
34c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    }
35c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant}
36c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
37c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnantint main()
38c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant{
39c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<0>();
40c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<1>();
41c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<31>();
42c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<32>();
43c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<33>();
44c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<63>();
45c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<64>();
46c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<65>();
47c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_right_shift<1000>();
48c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant}
49