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 unsigned long to_ulong() const;
11c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
12c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant#include <bitset>
13c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant#include <algorithm>
149d00ed5d8749f472e63ca7e5a510da2ee58f9dbdHoward Hinnant#include <limits>
15c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant#include <climits>
16c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant#include <cassert>
17c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
18c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnanttemplate <std::size_t N>
19c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnantvoid test_to_ulong()
20c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant{
21c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    const std::size_t M = sizeof(unsigned long) * CHAR_BIT < N ? sizeof(unsigned long) * CHAR_BIT : N;
22c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    const std::size_t X = M == 0 ? sizeof(unsigned long) * CHAR_BIT - 1 : sizeof(unsigned long) * CHAR_BIT - M;
239d00ed5d8749f472e63ca7e5a510da2ee58f9dbdHoward Hinnant    const std::size_t max = M == 0 ? 0 : std::size_t(std::numeric_limits<unsigned long>::max()) >> X;
24c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    std::size_t tests[] = {0,
25c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant                           std::min<std::size_t>(1, max),
26c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant                           std::min<std::size_t>(2, max),
27c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant                           std::min<std::size_t>(3, max),
28c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant                           std::min(max, max-3),
29c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant                           std::min(max, max-2),
30c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant                           std::min(max, max-1),
31c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant                           max};
32c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    for (std::size_t i = 0; i < sizeof(tests)/sizeof(tests[0]); ++i)
33c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    {
34c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant        std::size_t j = tests[i];
35c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant        std::bitset<N> v(j);
36c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant        assert(j == v.to_ulong());
37c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    }
38c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant}
39c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant
40c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnantint main()
41c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant{
42c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<0>();
43c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<1>();
44c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<31>();
45c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<32>();
46c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<33>();
47c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<63>();
48c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<64>();
49c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<65>();
50c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant    test_to_ulong<1000>();
51c52f43e72dfcea03037729649da84c23b3beb04aHoward Hinnant}
52