// <bitset> -*- C++ -*-
-// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
+// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
// Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library 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 2, or (at your option)
+// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// 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 library; see the file COPYING. If not, write to
-// the Free Software Foundation, 51 Franklin Street, Fifth Floor,
-// Boston, MA 02110-1301, USA.
+// Under Section 7 of GPL version 3, you are granted additional
+// permissions described in the GCC Runtime Library Exception, version
+// 3.1, as published by the Free Software Foundation.
-// As a special exception, you may use this file as part of a free software
-// library without restriction. Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License. This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
+// You should have received a copy of the GNU General Public License and
+// a copy of the GCC Runtime Library Exception along with this program;
+// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
+// <http://www.gnu.org/licenses/>.
/*
* Copyright (c) 1998
#pragma GCC system_header
-#include <cstddef> // For size_t
#include <string>
#include <bits/functexcept.h> // For invalid_argument, out_of_range,
// overflow_error
#define _GLIBCXX_BITSET_BITS_PER_WORD (__CHAR_BIT__ * sizeof(unsigned long))
#define _GLIBCXX_BITSET_WORDS(__n) \
- ((__n) < 1 ? 0 : ((__n) + _GLIBCXX_BITSET_BITS_PER_WORD - 1) \
- / _GLIBCXX_BITSET_BITS_PER_WORD)
+ ((__n) / _GLIBCXX_BITSET_BITS_PER_WORD + \
+ ((__n) % _GLIBCXX_BITSET_BITS_PER_WORD == 0 ? 0 : 1))
_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
/**
- * @if maint
- * Base class, general case. It is a class inveriant that _Nw will be
+ * Base class, general case. It is a class invariant that _Nw will be
* nonnegative.
*
* See documentation for bitset.
- * @endif
*/
template<size_t _Nw>
struct _Base_bitset
_Base_bitset()
{ _M_do_reset(); }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ _Base_bitset(unsigned long long __val)
+#else
_Base_bitset(unsigned long __val)
+#endif
{
_M_do_reset();
_M_w[0] = __val;
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ if (sizeof(unsigned long long) > sizeof(unsigned long))
+ _M_w[1] = __val >> _GLIBCXX_BITSET_BITS_PER_WORD;
+#endif
}
static size_t
_M_getword(size_t __pos) const
{ return _M_w[_S_whichword(__pos)]; }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ const _WordT*
+ _M_getdata() const
+ { return _M_w; }
+#endif
+
_WordT&
_M_hiword()
{ return _M_w[_Nw - 1]; }
unsigned long
_M_do_to_ulong() const;
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ unsigned long long
+ _M_do_to_ullong() const;
+#endif
+
// find first "on" bit
size_t
_M_do_find_first(size_t __not_found) const;
return _M_w[0];
}
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ template<size_t _Nw>
+ unsigned long long
+ _Base_bitset<_Nw>::_M_do_to_ullong() const
+ {
+ const bool __dw = sizeof(unsigned long long) > sizeof(unsigned long);
+ for (size_t __i = 1 + __dw; __i < _Nw; ++__i)
+ if (_M_w[__i])
+ __throw_overflow_error(__N("_Base_bitset::_M_do_to_ullong"));
+
+ if (__dw)
+ return _M_w[0] + (static_cast<unsigned long long>(_M_w[1])
+ << _GLIBCXX_BITSET_BITS_PER_WORD);
+ return _M_w[0];
+ }
+#endif
+
template<size_t _Nw>
size_t
_Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const
} // end _M_do_find_next
/**
- * @if maint
* Base class, specialization for a single word.
*
* See documentation for bitset.
- * @endif
*/
template<>
struct _Base_bitset<1>
: _M_w(0)
{ }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ _Base_bitset(unsigned long long __val)
+#else
_Base_bitset(unsigned long __val)
+#endif
: _M_w(__val)
{ }
_M_getword(size_t) const
{ return _M_w; }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ const _WordT*
+ _M_getdata() const
+ { return &_M_w; }
+#endif
+
_WordT&
_M_hiword()
{ return _M_w; }
_M_do_to_ulong() const
{ return _M_w; }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ unsigned long long
+ _M_do_to_ullong() const
+ { return _M_w; }
+#endif
+
size_t
_M_do_find_first(size_t __not_found) const
{
};
/**
- * @if maint
* Base class, specialization for no storage (zero-length %bitset).
*
* See documentation for bitset.
- * @endif
*/
template<>
struct _Base_bitset<0>
_Base_bitset()
{ }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ _Base_bitset(unsigned long long)
+#else
_Base_bitset(unsigned long)
+#endif
{ }
static size_t
_M_do_to_ulong() const
{ return 0; }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ unsigned long long
+ _M_do_to_ullong() const
+ { return 0; }
+#endif
+
// Normally "not found" is the size, but that could also be
// misinterpreted as an index in this corner case. Oh well.
size_t
/**
* @brief The %bitset class represents a @e fixed-size sequence of bits.
*
- * @ingroup Containers
+ * @ingroup containers
*
* (Note that %bitset does @e not meet the formal requirements of a
* <a href="tables.html#65">container</a>. Mainly, it lacks iterators.)
* the high-order bits in the highest word.) It is a class invariant
* that those unused bits are always zero.
*
- * If you think of %bitset as "a simple array of bits," be aware that
- * your mental picture is reversed: a %bitset behaves the same way as
- * bits in integers do, with the bit at index 0 in the "least significant
- * / right-hand" position, and the bit at index Nb-1 in the "most
- * significant / left-hand" position. Thus, unlike other containers, a
- * %bitset's index "counts from right to left," to put it very loosely.
+ * If you think of %bitset as <em>a simple array of bits</em>, be
+ * aware that your mental picture is reversed: a %bitset behaves
+ * the same way as bits in integers do, with the bit at index 0 in
+ * the <em>least significant / right-hand</em> position, and the bit at
+ * index Nb-1 in the <em>most significant / left-hand</em> position.
+ * Thus, unlike other containers, a %bitset's index <em>counts from
+ * right to left</em>, to put it very loosely.
*
* This behavior is preserved when translating to and from strings. For
* example, the first line of the following program probably prints
- * "b('a') is 0001100001" on a modern ASCII system.
+ * <em>b('a') is 0001100001</em> on a modern ASCII system.
*
* @code
* #include <bitset>
* }
* @endcode
*
- * Also see http://gcc.gnu.org/onlinedocs/libstdc++/ext/sgiexts.html#ch23
+ * Also see:
+ * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch33s02.html
* for a description of extensions.
*
- * @if maint
* Most of the actual code isn't contained in %bitset<> itself, but in the
* base class _Base_bitset. The base class works with whole words, not with
* individual bits. This allows us to specialize _Base_bitset for the
* Extra confusion can result due to the fact that the storage for
* _Base_bitset @e is a regular array, and is indexed as such. This is
* carefully encapsulated.
- * @endif
*/
template<size_t _Nb>
class bitset
_S_do_sanitize(this->_M_hiword());
}
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ template<typename> friend class hash;
+#endif
+
public:
/**
* This encapsulates the concept of a single bit. An instance of this
* to and from bool are automatic and should be transparent. Overloaded
* operators help to preserve the illusion.
*
- * (On a typical system, this "bit %reference" is 64 times the size of
- * an actual bit. Ha.)
+ * (On a typical system, this <em>bit %reference</em> is 64
+ * times the size of an actual bit. Ha.)
*/
class reference
{
{ }
/// Initial bits bitwise-copied from a single word (others set to zero).
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ bitset(unsigned long long __val)
+#else
bitset(unsigned long __val)
+#endif
: _Base(__val)
{ _M_do_sanitize(); }
/**
* @brief Use a subset of a string.
- * @param s A string of '0' and '1' characters.
+ * @param s A string of @a 0 and @a 1 characters.
* @param position Index of the first character in @a s to use;
* defaults to zero.
* @throw std::out_of_range If @a pos is bigger the size of @a s.
* @throw std::invalid_argument If a character appears in the string
- * which is neither '0' nor '1'.
+ * which is neither @a 0 nor @a 1.
*/
template<class _CharT, class _Traits, class _Alloc>
explicit
__throw_out_of_range(__N("bitset::bitset initial position "
"not valid"));
_M_copy_from_string(__s, __position,
- std::basic_string<_CharT, _Traits, _Alloc>::npos);
+ std::basic_string<_CharT, _Traits, _Alloc>::npos,
+ _CharT('0'), _CharT('1'));
}
/**
* @brief Use a subset of a string.
- * @param s A string of '0' and '1' characters.
+ * @param s A string of @a 0 and @a 1 characters.
* @param position Index of the first character in @a s to use.
* @param n The number of characters to copy.
* @throw std::out_of_range If @a pos is bigger the size of @a s.
* @throw std::invalid_argument If a character appears in the string
- * which is neither '0' nor '1'.
+ * which is neither @a 0 nor @a 1.
*/
template<class _CharT, class _Traits, class _Alloc>
bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
if (__position > __s.size())
__throw_out_of_range(__N("bitset::bitset initial position "
"not valid"));
- _M_copy_from_string(__s, __position, __n);
+ _M_copy_from_string(__s, __position, __n, _CharT('0'), _CharT('1'));
}
-
+
+ // _GLIBCXX_RESOLVE_LIB_DEFECTS
+ // 396. what are characters zero and one.
+ template<class _CharT, class _Traits, class _Alloc>
+ bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
+ size_t __position, size_t __n,
+ _CharT __zero, _CharT __one = _CharT('1'))
+ : _Base()
+ {
+ if (__position > __s.size())
+ __throw_out_of_range(__N("bitset::bitset initial position "
+ "not valid"));
+ _M_copy_from_string(__s, __position, __n, __zero, __one);
+ }
+
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ /**
+ * @brief Construct from a character %array.
+ * @param str An %array of characters @a zero and @a one.
+ * @param n The number of characters to use.
+ * @param zero The character corresponding to the value 0.
+ * @param one The character corresponding to the value 1.
+ * @throw std::invalid_argument If a character appears in the string
+ * which is neither @a zero nor @a one.
+ */
+ template<typename _CharT>
+ explicit
+ bitset(const _CharT* __str,
+ typename std::basic_string<_CharT>::size_type __n
+ = std::basic_string<_CharT>::npos,
+ _CharT __zero = _CharT('0'), _CharT __one = _CharT('1'))
+ : _Base()
+ {
+ if (!__str)
+ __throw_logic_error(__N("bitset::bitset(const _CharT*, ...)"));
+
+ if (__n == std::basic_string<_CharT>::npos)
+ __n = std::char_traits<_CharT>::length(__str);
+ _M_copy_from_ptr<_CharT, std::char_traits<_CharT>>(__str, __n, 0,
+ __n, __zero,
+ __one);
+ }
+#endif
+
// 23.3.5.2 bitset operations:
//@{
/**
/**
* @brief Array-indexing support.
* @param position Index into the %bitset.
- * @return A bool for a 'const %bitset'. For non-const bitsets, an
+ * @return A bool for a <em>const %bitset</em>. For non-const bitsets, an
* instance of the reference proxy class.
* @note These operators do no range checking and throw no exceptions,
* as required by DR 11 to the standard.
*
- * @if maint
* _GLIBCXX_RESOLVE_LIB_DEFECTS Note that this implementation already
* resolves DR 11 (items 1 and 2), but does not do the range-checking
* required by that DR's resolution. -pme
* The DR has since been changed: range-checking is a precondition
* (users' responsibility), and these functions must not throw. -pme
- * @endif
*/
reference
operator[](size_t __position)
//@}
/**
- * @brief Retuns a numerical interpretation of the %bitset.
+ * @brief Returns a numerical interpretation of the %bitset.
* @return The integral equivalent of the bits.
* @throw std::overflow_error If there are too many bits to be
* represented in an @c unsigned @c long.
to_ulong() const
{ return this->_M_do_to_ulong(); }
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+ unsigned long long
+ to_ullong() const
+ { return this->_M_do_to_ullong(); }
+#endif
+
/**
- * @brief Retuns a character interpretation of the %bitset.
+ * @brief Returns a character interpretation of the %bitset.
* @return The string equivalent of the bits.
*
* Note the ordering of the bits: decreasing character positions
to_string() const
{
std::basic_string<_CharT, _Traits, _Alloc> __result;
- _M_copy_to_string(__result);
+ _M_copy_to_string(__result, _CharT('0'), _CharT('1'));
+ return __result;
+ }
+
+ // _GLIBCXX_RESOLVE_LIB_DEFECTS
+ // 396. what are characters zero and one.
+ template<class _CharT, class _Traits, class _Alloc>
+ std::basic_string<_CharT, _Traits, _Alloc>
+ to_string(_CharT __zero, _CharT __one = _CharT('1')) const
+ {
+ std::basic_string<_CharT, _Traits, _Alloc> __result;
+ _M_copy_to_string(__result, __zero, __one);
return __result;
}
to_string() const
{ return to_string<_CharT, _Traits, std::allocator<_CharT> >(); }
+ // _GLIBCXX_RESOLVE_LIB_DEFECTS
+ // 853. to_string needs updating with zero and one.
+ template<class _CharT, class _Traits>
+ std::basic_string<_CharT, _Traits, std::allocator<_CharT> >
+ to_string(_CharT __zero, _CharT __one = _CharT('1')) const
+ { return to_string<_CharT, _Traits,
+ std::allocator<_CharT> >(__zero, __one); }
+
template<class _CharT>
std::basic_string<_CharT, std::char_traits<_CharT>,
std::allocator<_CharT> >
std::allocator<_CharT> >();
}
+ template<class _CharT>
+ std::basic_string<_CharT, std::char_traits<_CharT>,
+ std::allocator<_CharT> >
+ to_string(_CharT __zero, _CharT __one = _CharT('1')) const
+ {
+ return to_string<_CharT, std::char_traits<_CharT>,
+ std::allocator<_CharT> >(__zero, __one);
+ }
+
std::basic_string<char, std::char_traits<char>, std::allocator<char> >
to_string() const
{
std::allocator<char> >();
}
+ std::basic_string<char, std::char_traits<char>, std::allocator<char> >
+ to_string(char __zero, char __one = '1') const
+ {
+ return to_string<char, std::char_traits<char>,
+ std::allocator<char> >(__zero, __one);
+ }
+
// Helper functions for string operations.
+ template<class _CharT, class _Traits>
+ void
+ _M_copy_from_ptr(const _CharT*, size_t, size_t, size_t,
+ _CharT, _CharT);
+
template<class _CharT, class _Traits, class _Alloc>
void
_M_copy_from_string(const std::basic_string<_CharT,
- _Traits, _Alloc>& __s,
- size_t, size_t);
+ _Traits, _Alloc>& __s, size_t __pos, size_t __n,
+ _CharT __zero, _CharT __one)
+ { _M_copy_from_ptr<_CharT, _Traits>(__s.data(), __s.size(), __pos, __n,
+ __zero, __one); }
template<class _CharT, class _Traits, class _Alloc>
void
- _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&) const;
+ _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&,
+ _CharT, _CharT) const;
+
+ // NB: Backward compat.
+ template<class _CharT, class _Traits, class _Alloc>
+ void
+ _M_copy_from_string(const std::basic_string<_CharT,
+ _Traits, _Alloc>& __s, size_t __pos, size_t __n)
+ { _M_copy_from_string(__s, __pos, __n, _CharT('0'), _CharT('1')); }
+
+ template<class _CharT, class _Traits, class _Alloc>
+ void
+ _M_copy_to_string(std::basic_string<_CharT, _Traits,_Alloc>& __s) const
+ { _M_copy_to_string(__s, _CharT('0'), _CharT('1')); }
/// Returns the number of bits which are set.
size_t
// Definitions of non-inline member functions.
template<size_t _Nb>
- template<class _CharT, class _Traits, class _Alloc>
+ template<class _CharT, class _Traits>
void
bitset<_Nb>::
- _M_copy_from_string(const std::basic_string<_CharT, _Traits,
- _Alloc>& __s, size_t __pos, size_t __n)
+ _M_copy_from_ptr(const _CharT* __s, size_t __len,
+ size_t __pos, size_t __n, _CharT __zero, _CharT __one)
{
reset();
- const size_t __nbits = std::min(_Nb, std::min(__n, __s.size() - __pos));
+ const size_t __nbits = std::min(_Nb, std::min(__n, __len - __pos));
for (size_t __i = __nbits; __i > 0; --__i)
{
- switch(__s[__pos + __nbits - __i])
- {
- case '0':
- break;
- case '1':
- _Unchecked_set(__i - 1);
- break;
- default:
- __throw_invalid_argument(__N("bitset::_M_copy_from_string"));
- }
+ const _CharT __c = __s[__pos + __nbits - __i];
+ if (_Traits::eq(__c, __zero))
+ ;
+ else if (_Traits::eq(__c, __one))
+ _Unchecked_set(__i - 1);
+ else
+ __throw_invalid_argument(__N("bitset::_M_copy_from_ptr"));
}
}
template<class _CharT, class _Traits, class _Alloc>
void
bitset<_Nb>::
- _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s) const
+ _M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s,
+ _CharT __zero, _CharT __one) const
{
- __s.assign(_Nb, '0');
+ __s.assign(_Nb, __zero);
for (size_t __i = _Nb; __i > 0; --__i)
if (_Unchecked_test(__i - 1))
- __s[_Nb - __i] = '1';
+ _Traits::assign(__s[_Nb - __i], __one);
}
// 23.3.5.3 bitset operations:
* @brief Global I/O operators for bitsets.
*
* Direct I/O between streams and bitsets is supported. Output is
- * straightforward. Input will skip whitespace, only accept '0' and '1'
+ * straightforward. Input will skip whitespace, only accept @a 0 and @a 1
* characters, and will only extract as many digits as the %bitset will
* hold.
*/
std::basic_string<_CharT, _Traits> __tmp;
__tmp.reserve(_Nb);
+ // _GLIBCXX_RESOLVE_LIB_DEFECTS
+ // 303. Bitset input operator underspecified
+ const char_type __zero = __is.widen('0');
+ const char_type __one = __is.widen('1');
+
typename __ios_base::iostate __state = __ios_base::goodbit;
typename __istream_type::sentry __sentry(__is);
if (__sentry)
{
- try
+ __try
{
- // _GLIBCXX_RESOLVE_LIB_DEFECTS
- // 303. Bitset input operator underspecified
- const char_type __zero = __is.widen('0');
- const char_type __one = __is.widen('1');
for (size_t __i = _Nb; __i > 0; --__i)
{
static typename _Traits::int_type __eof = _Traits::eof();
else
{
const char_type __c2 = _Traits::to_char_type(__c1);
- if (__c2 == __zero)
- __tmp.push_back('0');
- else if (__c2 == __one)
- __tmp.push_back('1');
+ if (_Traits::eq(__c2, __zero))
+ __tmp.push_back(__zero);
+ else if (_Traits::eq(__c2, __one))
+ __tmp.push_back(__one);
else if (_Traits::
eq_int_type(__is.rdbuf()->sputbackc(__c2),
__eof))
}
}
}
- catch(__cxxabiv1::__forced_unwind&)
+ __catch(__cxxabiv1::__forced_unwind&)
{
__is._M_setstate(__ios_base::badbit);
__throw_exception_again;
}
- catch(...)
+ __catch(...)
{ __is._M_setstate(__ios_base::badbit); }
}
if (__tmp.empty() && _Nb)
__state |= __ios_base::failbit;
else
- __x._M_copy_from_string(__tmp, static_cast<size_t>(0), _Nb);
+ __x._M_copy_from_string(__tmp, static_cast<size_t>(0), _Nb,
+ __zero, __one);
if (__state)
__is.setstate(__state);
return __is;
const bitset<_Nb>& __x)
{
std::basic_string<_CharT, _Traits> __tmp;
- __x._M_copy_to_string(__tmp);
+
+ // _GLIBCXX_RESOLVE_LIB_DEFECTS
+ // 396. what are characters zero and one.
+ const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__os.getloc());
+ __x._M_copy_to_string(__tmp, __ct.widen('0'), __ct.widen('1'));
return __os << __tmp;
}
//@}
#undef _GLIBCXX_BITSET_WORDS
#undef _GLIBCXX_BITSET_BITS_PER_WORD
+#ifdef __GXX_EXPERIMENTAL_CXX0X__
+
+#include <bits/functional_hash.h>
+
+_GLIBCXX_BEGIN_NAMESPACE(std)
+
+ // DR 1182.
+ /// std::hash specialization for bitset.
+ template<size_t _Nb>
+ struct hash<_GLIBCXX_STD_D::bitset<_Nb>>
+ : public __hash_base<size_t, _GLIBCXX_STD_D::bitset<_Nb>>
+ {
+ size_t
+ operator()(const _GLIBCXX_STD_D::bitset<_Nb>& __b) const
+ {
+ const size_t __clength = (_Nb + __CHAR_BIT__ - 1) / __CHAR_BIT__;
+ return std::_Hash_impl::hash(__b._M_getdata(), __clength);
+ }
+ };
+
+ template<>
+ struct hash<_GLIBCXX_STD_D::bitset<0>>
+ : public __hash_base<size_t, _GLIBCXX_STD_D::bitset<0>>
+ {
+ size_t
+ operator()(const _GLIBCXX_STD_D::bitset<0>&) const
+ { return 0; }
+ };
+
+_GLIBCXX_END_NAMESPACE
+
+#endif // __GXX_EXPERIMENTAL_CXX0X__
+
#ifdef _GLIBCXX_DEBUG
# include <debug/bitset>
#endif
+#ifdef _GLIBCXX_PROFILE
+# include <profile/bitset>
+#endif
+
#endif /* _GLIBCXX_BITSET */