bitset.hpp

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that 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 Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <ext/ostream>
 
#include <bitset>
#include <compare>
 
namespace ext {
 
template < std::size_t N >
class bitset : public std::bitset < N > {
public:
    using std::bitset < N >::bitset; // NOLINT(modernize-use-equals-default)
 
    using std::bitset < N >::operator =;
#ifndef __clang__
 
    bitset ( ) = default;
 
    bitset ( const bitset & other ) = default;
 
    bitset ( bitset && other ) = default;
 
    bitset & operator = ( bitset && other ) = default;
 
    bitset & operator = ( const bitset & other ) = default;
#endif
 
    std::strong_ordering operator <=> ( const ext::bitset < N > & second ) const {
        const bitset < N > & first = * this;
        for ( size_t i = 0; i < N; ++i ) {
            std::strong_ordering res = first [ i ] <=> second [ i ];
            if ( res != 0 )
                return res;
        }
        return std::strong_ordering::equal;
    }
 
    bool operator == ( const ext::bitset < N > & second ) const {
        return ( * this <=> second ) == 0;
    }
};
 
template < size_t N >
ext::ostream & operator << ( ext::ostream & out, const ext::bitset < N > & bitset ) {
    out << "[";
 
    for ( size_t i = 0; i < N; ++i ) {
        if ( i != 0 ) out << ", ";
        out << bitset [ i ];
    }
 
    out << "]";
    return out;
}
 
} /* namespace ext */