diff options
Diffstat (limited to 'lib/etl/bitset.h')
| -rw-r--r-- | lib/etl/bitset.h | 344 |
1 files changed, 344 insertions, 0 deletions
diff --git a/lib/etl/bitset.h b/lib/etl/bitset.h new file mode 100644 index 0000000..5d4fbcf --- /dev/null +++ b/lib/etl/bitset.h @@ -0,0 +1,344 @@ +///\file + +/****************************************************************************** +The MIT License(MIT) + +Embedded Template Library. +https://github.com/ETLCPP/etl +http://www.etlcpp.com + +Copyright(c) 2014 jwellbelove + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files(the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and / or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions : + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. +******************************************************************************/ + +#ifndef __ETL_BITSET__ +#define __ETL_BITSET__ + +#include <algorithm> +#include <iterator> +#include <string.h> +#include <stddef.h> + +#include "platform.h" +#include "integral_limits.h" +#include "algorithm.h" +#include "nullptr.h" +#include "log.h" +#include "ibitset.h" + +#define ETL_NO_CHECKS +#include "error_handler.h" + +#if defined(ETL_COMPILER_KEIL) +#pragma diag_suppress 1300 +#endif + +//***************************************************************************** +///\defgroup bitset bitset +/// Similar to std::bitset but without requiring std::string. +///\ingroup containers +//***************************************************************************** + +namespace etl +{ + //************************************************************************* + /// The class emulates an array of bool elements, but optimized for space allocation. + /// Will accommodate any number of bits. + /// Does not use std::string. + ///\tparam N The number of bits. + ///\ingroup bitset + //************************************************************************* + template <const size_t MAXN> + class bitset : public ibitset + { + + static const size_t ARRAY_SIZE = (MAXN % BITS_PER_ELEMENT == 0) ? MAXN / BITS_PER_ELEMENT : MAXN / BITS_PER_ELEMENT + 1; + + public: + + static const size_t ALLOCATED_BITS = ARRAY_SIZE * BITS_PER_ELEMENT; + + public: + + //************************************************************************* + /// Default constructor. + //************************************************************************* + bitset() + : ibitset(MAXN, ARRAY_SIZE, data) + { + reset(); + } + + //************************************************************************* + /// Copy constructor. + //************************************************************************* + bitset(const bitset<MAXN>& other) + : ibitset(MAXN, ARRAY_SIZE, data) + { + etl::copy_n(other.data, ARRAY_SIZE, data); + } + + //************************************************************************* + /// Construct from a value. + //************************************************************************* + bitset(unsigned long long value) + : ibitset(MAXN, ARRAY_SIZE, data) + { + initialise(value); + } + + //************************************************************************* + /// Construct from a string. + //************************************************************************* + bitset(const char* text) + : ibitset(MAXN, ARRAY_SIZE, data) + { + set(text); + } + + //************************************************************************* + /// Set all of the bits. + //************************************************************************* + bitset<MAXN>& set() + { + ibitset::set(); + return *this; + } + + //************************************************************************* + /// Set the bit at the position. + //************************************************************************* + bitset<MAXN>& set(size_t position, bool value = true) + { + ibitset::set(position, value); + return *this; + } + + //************************************************************************* + /// Set from a string. + //************************************************************************* + bitset<MAXN>& set(const char* text) + { + ETL_ASSERT(text != 0, ETL_ERROR(bitset_nullptr)); + ibitset::set(text); + + return *this; + } + + //************************************************************************* + /// Reset all of the bits. + //************************************************************************* + bitset<MAXN>& reset() + { + ibitset::reset(); + return *this; + } + + //************************************************************************* + /// Reset the bit at the position. + //************************************************************************* + bitset<MAXN>& reset(size_t position) + { + ibitset::reset(position); + return *this; + } + + //************************************************************************* + /// Flip all of the bits. + //************************************************************************* + bitset<MAXN>& flip() + { + ibitset::flip(); + return *this; + } + + //************************************************************************* + /// Flip the bit at the position. + //************************************************************************* + bitset<MAXN>& flip(size_t position) + { + ibitset::flip(position); + return *this; + } + + //************************************************************************* + /// operator = + //************************************************************************* + bitset<MAXN>& operator =(const bitset<MAXN>& other) + { + if (this != &other) + { + etl::copy_n(other.data, ARRAY_SIZE, data); + } + + return *this; + } + + //************************************************************************* + /// operator &= + //************************************************************************* + bitset<MAXN>& operator &=(const bitset<MAXN>& other) + { + ibitset::operator &=(other); + return *this; + } + + //************************************************************************* + /// operator |= + //************************************************************************* + bitset<MAXN>& operator |=(const bitset<MAXN>& other) + { + ibitset::operator |=(other); + return *this; + } + + //************************************************************************* + /// operator ^= + //************************************************************************* + bitset<MAXN>& operator ^=(const bitset<MAXN>& other) + { + ibitset::operator ^=(other); + return *this; + } + + //************************************************************************* + /// operator ~ + //************************************************************************* + bitset<MAXN> operator ~() const + { + bitset<MAXN> temp(*this); + + temp.invert(); + + return temp; + } + + //************************************************************************* + /// operator << + //************************************************************************* + bitset<MAXN> operator<<(size_t shift) const + { + bitset<MAXN> temp(*this); + + temp <<= shift; + + return temp; + } + + //************************************************************************* + /// operator <<= + //************************************************************************* + bitset<MAXN>& operator<<=(size_t shift) + { + ibitset::operator <<=(shift); + return *this; + } + + //************************************************************************* + /// operator >> + //************************************************************************* + bitset<MAXN> operator>>(size_t shift) const + { + bitset<MAXN> temp(*this); + + temp >>= shift; + + return temp; + } + + //************************************************************************* + /// operator >>= + //************************************************************************* + bitset<MAXN>& operator>>=(size_t shift) + { + ibitset::operator >>=(shift); + return *this; + } + + //************************************************************************* + /// operator == + //************************************************************************* + friend bool operator == (const bitset<MAXN>& lhs, const bitset<MAXN>& rhs) + { + return ibitset::is_equal(lhs, rhs); + } + + private: + + element_t data[ARRAY_SIZE]; + }; + + //*************************************************************************** + /// operator & + ///\ingroup bitset + //*************************************************************************** + template <const size_t MAXN> + bitset<MAXN> operator & (const bitset<MAXN>& lhs, const bitset<MAXN>& rhs) + { + bitset<MAXN> temp(lhs); + temp &= rhs; + return temp; + } + + //*************************************************************************** + /// operator | + ///\ingroup bitset + //*************************************************************************** + template<const size_t MAXN> + bitset<MAXN> operator | (const bitset<MAXN>& lhs, const bitset<MAXN>& rhs) + { + bitset<MAXN> temp(lhs); + temp |= rhs; + return temp; + } + + //*************************************************************************** + /// operator ^ + ///\ingroup bitset + //*************************************************************************** + template<const size_t MAXN> + bitset<MAXN> operator ^ (const bitset<MAXN>& lhs, const bitset<MAXN>& rhs) + { + bitset<MAXN> temp(lhs); + temp ^= rhs; + return temp; + } + + //*************************************************************************** + /// operator != + ///\ingroup bitset + //*************************************************************************** + template<const size_t MAXN> + bool operator != (const bitset<MAXN>& lhs, const bitset<MAXN>& rhs) + { + return !(lhs == rhs); + } +} + +//************************************************************************* +/// swap +//************************************************************************* +template <const size_t MAXN> +void swap(etl::bitset<MAXN>& lhs, etl::bitset<MAXN>& rhs) +{ + lhs.swap(rhs); +} + +#endif |