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
#pragma once


#include <bit><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <ranges><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.

#include "snippet/aliases.hpp"


namespace uni {


namespace superset_transform {


template<std::ranges::random_access_range R, std::unsigned_integral Bit = std::uint32_t>
void zeta(R& range) {
    const auto n = std::ranges::size(range);
    assert(std::has_single_bit(n));

    for(Bit i = 1; i < n; i <<= 1) {
        for(Bit j = 0; j < n; ++j) {
            if((j & i) == 0) {
                range[j] += range[j | i];
            }
        }
    }
}



template<std::ranges::random_access_range R, std::unsigned_integral Bit = std::uint32_t>
void mobius(R& range) {
    const auto n = std::ranges::size(range);
    assert(std::has_single_bit(n));

    for(Bit i = 1; i < n; i <<= 1) {
        for(Bit j = 0; j < n; ++j) {
            if((j & i) == 0) {
                range[j] -= range[j | i];
            }
        }
    }
}


} // namespace superset_transform


namespace subset_transform {


template<std::ranges::random_access_range R, std::unsigned_integral Bit = std::uint32_t>
void zeta(R& range) {
    const auto n = std::ranges::size(range);
    assert(std::has_single_bit(n));

    for(Bit i = 1; i < n; i <<= 1) {
        for(Bit j = 0; j < n; ++j) {
            if((j & i) == 0) {
                range[j | i] += range[j];
            }
        }
    }
}



template<std::ranges::random_access_range R, std::unsigned_integral Bit = std::uint32_t>
void mobius(R& range) {
    const auto n = std::ranges::size(range);
    assert(std::has_single_bit(n));

    for(Bit i = 1; i < n; i <<= 1) {
        for(Bit j = 0; j < n; ++j) {
            if((j & i) == 0) {
                range[j | i] -= range[j];
            }
        }
    }
}


} // namespace subset_transform


} // namespace uni