/*
 * Copyright (c) Atmosphère-NX
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms and conditions of the GNU General Public License,
 * version 2, as published by the Free Software Foundation.
 *
 * This program is distributed in the hope 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 program.  If not, see .
 */
#pragma once
#include 
#include 
#include 
namespace ams::util {
    namespace impl {
        template
        class BitSet {
            private:
                static_assert(std::is_integral::value);
                static_assert(std::is_unsigned::value);
                static_assert(sizeof(Storage) <= sizeof(u64));
                static constexpr size_t FlagsPerWord = BITSIZEOF(Storage);
                static constexpr size_t NumWords     = util::DivideUp(N, FlagsPerWord);
                static constexpr ALWAYS_INLINE Storage GetBitMask(size_t bit) {
                    return static_cast(1) << (FlagsPerWord - 1 - bit);
                }
            private:
                Storage m_words[NumWords];
            public:
                constexpr ALWAYS_INLINE BitSet() : m_words() { /* ... */ }
                constexpr ALWAYS_INLINE void SetBit(size_t i) {
                    m_words[i / FlagsPerWord] |= GetBitMask(i % FlagsPerWord);
                }
                constexpr ALWAYS_INLINE void ClearBit(size_t i) {
                    m_words[i / FlagsPerWord] &= ~GetBitMask(i % FlagsPerWord);
                }
                constexpr ALWAYS_INLINE size_t CountLeadingZero() const {
                    for (size_t i = 0; i < NumWords; i++) {
                        if (m_words[i]) {
                            return FlagsPerWord * i + util::CountLeadingZeros(m_words[i]);
                        }
                    }
                    return FlagsPerWord * NumWords;
                }
                constexpr ALWAYS_INLINE size_t GetNextSet(size_t n) const {
                    for (size_t i = (n + 1) / FlagsPerWord; i < NumWords; i++) {
                        Storage word = m_words[i];
                        if (!util::IsAligned(n + 1, FlagsPerWord)) {
                            word &= GetBitMask(n % FlagsPerWord) - 1;
                        }
                        if (word) {
                            return FlagsPerWord * i + util::CountLeadingZeros(word);
                        }
                    }
                    return FlagsPerWord * NumWords;
                }
        };
    }
    template
    using BitSet8  = impl::BitSet;
    template
    using BitSet16 = impl::BitSet;
    template
    using BitSet32 = impl::BitSet;
    template
    using BitSet64 = impl::BitSet;
}