bitset.h

/*
 This Source Code Form is subject to the terms of the Mozilla Public
 License, v. 2.0. If a copy of the MPL was not distributed with this
 file, You can obtain one at http://mozilla.org/MPL/2.0/.
 \author Auberval Florian
*/
 
#pragma once
 
#include "../defines.h"
#include <cstddef>
#include <utility>
#include "./iteratorUtils.h"
#include "../../Common/Assert.h"
 
namespace Ponca
{
    template <int N, typename T = unsigned long long>
    class BitSet
    {
        static_assert(N > 0, "The capacity must be strictly positive");
 
    private:
        static constexpr size_t BIT_SIZE   = sizeof(T) * 8; 
        static constexpr size_t ARRAY_SIZE = (N + BIT_SIZE - 1) / BIT_SIZE; 
    public:
        using container_type = std::array<T, N>;
        using iterator       = typename container_type::iterator;
 
    public:
        PONCA_MULTIARCH BitSet() = default;
 
        PONCA_MULTIARCH void flip(int i);
 
        PONCA_MULTIARCH bool erase(int value);
 
        PONCA_MULTIARCH std::pair<iterator, bool> insert(const int& value);
 
        PONCA_MULTIARCH [[nodiscard]] bool contains(int value) const;
 
        PONCA_MULTIARCH void clear();
 
        PONCA_MULTIARCH [[nodiscard]] iterator begin();
 
        PONCA_MULTIARCH [[nodiscard]] iterator end();
 
    protected:
        container_type m_data = {}; 
    };
} // namespace Ponca
 
#include "bitset.hpp"