// -*- C++ -*-
|
// -*- C++ -*-
|
|
|
// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
|
// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
|
// Free Software Foundation, Inc.
|
// Free Software Foundation, Inc.
|
//
|
//
|
// This file is part of the GNU ISO C++ Library. This library is free
|
// 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
|
// software; you can redistribute it and/or modify it under the
|
// terms of the GNU General Public License as published by the
|
// terms of the GNU General Public License as published by the
|
// Free Software Foundation; either version 3, or (at your option)
|
// Free Software Foundation; either version 3, or (at your option)
|
// any later version.
|
// any later version.
|
|
|
// This library is distributed in the hope that it will be useful,
|
// This library is distributed in the hope that it will be useful,
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
// GNU General Public License for more details.
|
// GNU General Public License for more details.
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
// Under Section 7 of GPL version 3, you are granted additional
|
// permissions described in the GCC Runtime Library Exception, version
|
// permissions described in the GCC Runtime Library Exception, version
|
// 3.1, as published by the Free Software Foundation.
|
// 3.1, as published by the Free Software Foundation.
|
|
|
// You should have received a copy of the GNU General Public License and
|
// 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;
|
// a copy of the GCC Runtime Library Exception along with this program;
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
// .
|
// .
|
|
|
/*
|
/*
|
* Copyright (c) 1998
|
* Copyright (c) 1998
|
* Silicon Graphics Computer Systems, Inc.
|
* Silicon Graphics Computer Systems, Inc.
|
*
|
*
|
* Permission to use, copy, modify, distribute and sell this software
|
* Permission to use, copy, modify, distribute and sell this software
|
* and its documentation for any purpose is hereby granted without fee,
|
* and its documentation for any purpose is hereby granted without fee,
|
* provided that the above copyright notice appear in all copies and
|
* provided that the above copyright notice appear in all copies and
|
* that both that copyright notice and this permission notice appear
|
* that both that copyright notice and this permission notice appear
|
* in supporting documentation. Silicon Graphics makes no
|
* in supporting documentation. Silicon Graphics makes no
|
* representations about the suitability of this software for any
|
* representations about the suitability of this software for any
|
* purpose. It is provided "as is" without express or implied warranty.
|
* purpose. It is provided "as is" without express or implied warranty.
|
*/
|
*/
|
|
|
/** @file include/bitset
|
/** @file include/bitset
|
* This is a Standard C++ Library header.
|
* This is a Standard C++ Library header.
|
*/
|
*/
|
|
|
#ifndef _GLIBCXX_BITSET
|
#ifndef _GLIBCXX_BITSET
|
#define _GLIBCXX_BITSET 1
|
#define _GLIBCXX_BITSET 1
|
|
|
#pragma GCC system_header
|
#pragma GCC system_header
|
|
|
#include // For size_t
|
#include // For size_t
|
#include
|
#include
|
#include // For invalid_argument, out_of_range,
|
#include // For invalid_argument, out_of_range,
|
// overflow_error
|
// overflow_error
|
#include
|
#include
|
#include
|
#include
|
|
|
#define _GLIBCXX_BITSET_BITS_PER_WORD (__CHAR_BIT__ * sizeof(unsigned long))
|
#define _GLIBCXX_BITSET_BITS_PER_WORD (__CHAR_BIT__ * sizeof(unsigned long))
|
#define _GLIBCXX_BITSET_WORDS(__n) \
|
#define _GLIBCXX_BITSET_WORDS(__n) \
|
((__n) < 1 ? 0 : ((__n) + _GLIBCXX_BITSET_BITS_PER_WORD - 1) \
|
((__n) < 1 ? 0 : ((__n) + _GLIBCXX_BITSET_BITS_PER_WORD - 1) \
|
/ _GLIBCXX_BITSET_BITS_PER_WORD)
|
/ _GLIBCXX_BITSET_BITS_PER_WORD)
|
|
|
_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
|
_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)
|
|
|
/**
|
/**
|
* Base class, general case. It is a class invariant that _Nw will be
|
* Base class, general case. It is a class invariant that _Nw will be
|
* nonnegative.
|
* nonnegative.
|
*
|
*
|
* See documentation for bitset.
|
* See documentation for bitset.
|
*/
|
*/
|
template
|
template
|
struct _Base_bitset
|
struct _Base_bitset
|
{
|
{
|
typedef unsigned long _WordT;
|
typedef unsigned long _WordT;
|
|
|
/// 0 is the least significant word.
|
/// 0 is the least significant word.
|
_WordT _M_w[_Nw];
|
_WordT _M_w[_Nw];
|
|
|
_Base_bitset()
|
_Base_bitset()
|
{ _M_do_reset(); }
|
{ _M_do_reset(); }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
_Base_bitset(unsigned long long __val)
|
_Base_bitset(unsigned long long __val)
|
#else
|
#else
|
_Base_bitset(unsigned long __val)
|
_Base_bitset(unsigned long __val)
|
#endif
|
#endif
|
{
|
{
|
_M_do_reset();
|
_M_do_reset();
|
_M_w[0] = __val;
|
_M_w[0] = __val;
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
if (sizeof(unsigned long long) > sizeof(unsigned long))
|
if (sizeof(unsigned long long) > sizeof(unsigned long))
|
_M_w[1] = __val >> _GLIBCXX_BITSET_BITS_PER_WORD;
|
_M_w[1] = __val >> _GLIBCXX_BITSET_BITS_PER_WORD;
|
#endif
|
#endif
|
}
|
}
|
|
|
static size_t
|
static size_t
|
_S_whichword(size_t __pos )
|
_S_whichword(size_t __pos )
|
{ return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }
|
{ return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }
|
|
|
static size_t
|
static size_t
|
_S_whichbyte(size_t __pos )
|
_S_whichbyte(size_t __pos )
|
{ return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }
|
{ return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }
|
|
|
static size_t
|
static size_t
|
_S_whichbit(size_t __pos )
|
_S_whichbit(size_t __pos )
|
{ return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }
|
{ return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }
|
|
|
static _WordT
|
static _WordT
|
_S_maskbit(size_t __pos )
|
_S_maskbit(size_t __pos )
|
{ return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }
|
{ return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }
|
|
|
_WordT&
|
_WordT&
|
_M_getword(size_t __pos)
|
_M_getword(size_t __pos)
|
{ return _M_w[_S_whichword(__pos)]; }
|
{ return _M_w[_S_whichword(__pos)]; }
|
|
|
_WordT
|
_WordT
|
_M_getword(size_t __pos) const
|
_M_getword(size_t __pos) const
|
{ return _M_w[_S_whichword(__pos)]; }
|
{ return _M_w[_S_whichword(__pos)]; }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
const _WordT*
|
const _WordT*
|
_M_getdata() const
|
_M_getdata() const
|
{ return _M_w; }
|
{ return _M_w; }
|
#endif
|
#endif
|
|
|
_WordT&
|
_WordT&
|
_M_hiword()
|
_M_hiword()
|
{ return _M_w[_Nw - 1]; }
|
{ return _M_w[_Nw - 1]; }
|
|
|
_WordT
|
_WordT
|
_M_hiword() const
|
_M_hiword() const
|
{ return _M_w[_Nw - 1]; }
|
{ return _M_w[_Nw - 1]; }
|
|
|
void
|
void
|
_M_do_and(const _Base_bitset<_Nw>& __x)
|
_M_do_and(const _Base_bitset<_Nw>& __x)
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
_M_w[__i] &= __x._M_w[__i];
|
_M_w[__i] &= __x._M_w[__i];
|
}
|
}
|
|
|
void
|
void
|
_M_do_or(const _Base_bitset<_Nw>& __x)
|
_M_do_or(const _Base_bitset<_Nw>& __x)
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
_M_w[__i] |= __x._M_w[__i];
|
_M_w[__i] |= __x._M_w[__i];
|
}
|
}
|
|
|
void
|
void
|
_M_do_xor(const _Base_bitset<_Nw>& __x)
|
_M_do_xor(const _Base_bitset<_Nw>& __x)
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
_M_w[__i] ^= __x._M_w[__i];
|
_M_w[__i] ^= __x._M_w[__i];
|
}
|
}
|
|
|
void
|
void
|
_M_do_left_shift(size_t __shift);
|
_M_do_left_shift(size_t __shift);
|
|
|
void
|
void
|
_M_do_right_shift(size_t __shift);
|
_M_do_right_shift(size_t __shift);
|
|
|
void
|
void
|
_M_do_flip()
|
_M_do_flip()
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
_M_w[__i] = ~_M_w[__i];
|
_M_w[__i] = ~_M_w[__i];
|
}
|
}
|
|
|
void
|
void
|
_M_do_set()
|
_M_do_set()
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
_M_w[__i] = ~static_cast<_WordT>(0);
|
_M_w[__i] = ~static_cast<_WordT>(0);
|
}
|
}
|
|
|
void
|
void
|
_M_do_reset()
|
_M_do_reset()
|
{ __builtin_memset(_M_w, 0, _Nw * sizeof(_WordT)); }
|
{ __builtin_memset(_M_w, 0, _Nw * sizeof(_WordT)); }
|
|
|
bool
|
bool
|
_M_is_equal(const _Base_bitset<_Nw>& __x) const
|
_M_is_equal(const _Base_bitset<_Nw>& __x) const
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; ++__i)
|
for (size_t __i = 0; __i < _Nw; ++__i)
|
if (_M_w[__i] != __x._M_w[__i])
|
if (_M_w[__i] != __x._M_w[__i])
|
return false;
|
return false;
|
return true;
|
return true;
|
}
|
}
|
|
|
size_t
|
size_t
|
_M_are_all_aux() const
|
_M_are_all_aux() const
|
{
|
{
|
for (size_t __i = 0; __i < _Nw - 1; __i++)
|
for (size_t __i = 0; __i < _Nw - 1; __i++)
|
if (_M_w[__i] != ~static_cast<_WordT>(0))
|
if (_M_w[__i] != ~static_cast<_WordT>(0))
|
return 0;
|
return 0;
|
return ((_Nw - 1) * _GLIBCXX_BITSET_BITS_PER_WORD
|
return ((_Nw - 1) * _GLIBCXX_BITSET_BITS_PER_WORD
|
+ __builtin_popcountl(_M_hiword()));
|
+ __builtin_popcountl(_M_hiword()));
|
}
|
}
|
|
|
bool
|
bool
|
_M_is_any() const
|
_M_is_any() const
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
if (_M_w[__i] != static_cast<_WordT>(0))
|
if (_M_w[__i] != static_cast<_WordT>(0))
|
return true;
|
return true;
|
return false;
|
return false;
|
}
|
}
|
|
|
size_t
|
size_t
|
_M_do_count() const
|
_M_do_count() const
|
{
|
{
|
size_t __result = 0;
|
size_t __result = 0;
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
__result += __builtin_popcountl(_M_w[__i]);
|
__result += __builtin_popcountl(_M_w[__i]);
|
return __result;
|
return __result;
|
}
|
}
|
|
|
unsigned long
|
unsigned long
|
_M_do_to_ulong() const;
|
_M_do_to_ulong() const;
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
unsigned long long
|
unsigned long long
|
_M_do_to_ullong() const;
|
_M_do_to_ullong() const;
|
#endif
|
#endif
|
|
|
// find first "on" bit
|
// find first "on" bit
|
size_t
|
size_t
|
_M_do_find_first(size_t __not_found) const;
|
_M_do_find_first(size_t __not_found) const;
|
|
|
// find the next "on" bit that follows "prev"
|
// find the next "on" bit that follows "prev"
|
size_t
|
size_t
|
_M_do_find_next(size_t __prev, size_t __not_found) const;
|
_M_do_find_next(size_t __prev, size_t __not_found) const;
|
};
|
};
|
|
|
// Definitions of non-inline functions from _Base_bitset.
|
// Definitions of non-inline functions from _Base_bitset.
|
template
|
template
|
void
|
void
|
_Base_bitset<_Nw>::_M_do_left_shift(size_t __shift)
|
_Base_bitset<_Nw>::_M_do_left_shift(size_t __shift)
|
{
|
{
|
if (__builtin_expect(__shift != 0, 1))
|
if (__builtin_expect(__shift != 0, 1))
|
{
|
{
|
const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD;
|
const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD;
|
const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD;
|
const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD;
|
|
|
if (__offset == 0)
|
if (__offset == 0)
|
for (size_t __n = _Nw - 1; __n >= __wshift; --__n)
|
for (size_t __n = _Nw - 1; __n >= __wshift; --__n)
|
_M_w[__n] = _M_w[__n - __wshift];
|
_M_w[__n] = _M_w[__n - __wshift];
|
else
|
else
|
{
|
{
|
const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD
|
const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD
|
- __offset);
|
- __offset);
|
for (size_t __n = _Nw - 1; __n > __wshift; --__n)
|
for (size_t __n = _Nw - 1; __n > __wshift; --__n)
|
_M_w[__n] = ((_M_w[__n - __wshift] << __offset)
|
_M_w[__n] = ((_M_w[__n - __wshift] << __offset)
|
| (_M_w[__n - __wshift - 1] >> __sub_offset));
|
| (_M_w[__n - __wshift - 1] >> __sub_offset));
|
_M_w[__wshift] = _M_w[0] << __offset;
|
_M_w[__wshift] = _M_w[0] << __offset;
|
}
|
}
|
|
|
std::fill(_M_w + 0, _M_w + __wshift, static_cast<_WordT>(0));
|
std::fill(_M_w + 0, _M_w + __wshift, static_cast<_WordT>(0));
|
}
|
}
|
}
|
}
|
|
|
template
|
template
|
void
|
void
|
_Base_bitset<_Nw>::_M_do_right_shift(size_t __shift)
|
_Base_bitset<_Nw>::_M_do_right_shift(size_t __shift)
|
{
|
{
|
if (__builtin_expect(__shift != 0, 1))
|
if (__builtin_expect(__shift != 0, 1))
|
{
|
{
|
const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD;
|
const size_t __wshift = __shift / _GLIBCXX_BITSET_BITS_PER_WORD;
|
const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD;
|
const size_t __offset = __shift % _GLIBCXX_BITSET_BITS_PER_WORD;
|
const size_t __limit = _Nw - __wshift - 1;
|
const size_t __limit = _Nw - __wshift - 1;
|
|
|
if (__offset == 0)
|
if (__offset == 0)
|
for (size_t __n = 0; __n <= __limit; ++__n)
|
for (size_t __n = 0; __n <= __limit; ++__n)
|
_M_w[__n] = _M_w[__n + __wshift];
|
_M_w[__n] = _M_w[__n + __wshift];
|
else
|
else
|
{
|
{
|
const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD
|
const size_t __sub_offset = (_GLIBCXX_BITSET_BITS_PER_WORD
|
- __offset);
|
- __offset);
|
for (size_t __n = 0; __n < __limit; ++__n)
|
for (size_t __n = 0; __n < __limit; ++__n)
|
_M_w[__n] = ((_M_w[__n + __wshift] >> __offset)
|
_M_w[__n] = ((_M_w[__n + __wshift] >> __offset)
|
| (_M_w[__n + __wshift + 1] << __sub_offset));
|
| (_M_w[__n + __wshift + 1] << __sub_offset));
|
_M_w[__limit] = _M_w[_Nw-1] >> __offset;
|
_M_w[__limit] = _M_w[_Nw-1] >> __offset;
|
}
|
}
|
|
|
std::fill(_M_w + __limit + 1, _M_w + _Nw, static_cast<_WordT>(0));
|
std::fill(_M_w + __limit + 1, _M_w + _Nw, static_cast<_WordT>(0));
|
}
|
}
|
}
|
}
|
|
|
template
|
template
|
unsigned long
|
unsigned long
|
_Base_bitset<_Nw>::_M_do_to_ulong() const
|
_Base_bitset<_Nw>::_M_do_to_ulong() const
|
{
|
{
|
for (size_t __i = 1; __i < _Nw; ++__i)
|
for (size_t __i = 1; __i < _Nw; ++__i)
|
if (_M_w[__i])
|
if (_M_w[__i])
|
__throw_overflow_error(__N("_Base_bitset::_M_do_to_ulong"));
|
__throw_overflow_error(__N("_Base_bitset::_M_do_to_ulong"));
|
return _M_w[0];
|
return _M_w[0];
|
}
|
}
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
template
|
template
|
unsigned long long
|
unsigned long long
|
_Base_bitset<_Nw>::_M_do_to_ullong() const
|
_Base_bitset<_Nw>::_M_do_to_ullong() const
|
{
|
{
|
const bool __dw = sizeof(unsigned long long) > sizeof(unsigned long);
|
const bool __dw = sizeof(unsigned long long) > sizeof(unsigned long);
|
for (size_t __i = 1 + __dw; __i < _Nw; ++__i)
|
for (size_t __i = 1 + __dw; __i < _Nw; ++__i)
|
if (_M_w[__i])
|
if (_M_w[__i])
|
__throw_overflow_error(__N("_Base_bitset::_M_do_to_ullong"));
|
__throw_overflow_error(__N("_Base_bitset::_M_do_to_ullong"));
|
|
|
if (__dw)
|
if (__dw)
|
return _M_w[0] + (static_cast(_M_w[1])
|
return _M_w[0] + (static_cast(_M_w[1])
|
<< _GLIBCXX_BITSET_BITS_PER_WORD);
|
<< _GLIBCXX_BITSET_BITS_PER_WORD);
|
return _M_w[0];
|
return _M_w[0];
|
}
|
}
|
#endif
|
#endif
|
|
|
template
|
template
|
size_t
|
size_t
|
_Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const
|
_Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const
|
{
|
{
|
for (size_t __i = 0; __i < _Nw; __i++)
|
for (size_t __i = 0; __i < _Nw; __i++)
|
{
|
{
|
_WordT __thisword = _M_w[__i];
|
_WordT __thisword = _M_w[__i];
|
if (__thisword != static_cast<_WordT>(0))
|
if (__thisword != static_cast<_WordT>(0))
|
return (__i * _GLIBCXX_BITSET_BITS_PER_WORD
|
return (__i * _GLIBCXX_BITSET_BITS_PER_WORD
|
+ __builtin_ctzl(__thisword));
|
+ __builtin_ctzl(__thisword));
|
}
|
}
|
// not found, so return an indication of failure.
|
// not found, so return an indication of failure.
|
return __not_found;
|
return __not_found;
|
}
|
}
|
|
|
template
|
template
|
size_t
|
size_t
|
_Base_bitset<_Nw>::_M_do_find_next(size_t __prev, size_t __not_found) const
|
_Base_bitset<_Nw>::_M_do_find_next(size_t __prev, size_t __not_found) const
|
{
|
{
|
// make bound inclusive
|
// make bound inclusive
|
++__prev;
|
++__prev;
|
|
|
// check out of bounds
|
// check out of bounds
|
if (__prev >= _Nw * _GLIBCXX_BITSET_BITS_PER_WORD)
|
if (__prev >= _Nw * _GLIBCXX_BITSET_BITS_PER_WORD)
|
return __not_found;
|
return __not_found;
|
|
|
// search first word
|
// search first word
|
size_t __i = _S_whichword(__prev);
|
size_t __i = _S_whichword(__prev);
|
_WordT __thisword = _M_w[__i];
|
_WordT __thisword = _M_w[__i];
|
|
|
// mask off bits below bound
|
// mask off bits below bound
|
__thisword &= (~static_cast<_WordT>(0)) << _S_whichbit(__prev);
|
__thisword &= (~static_cast<_WordT>(0)) << _S_whichbit(__prev);
|
|
|
if (__thisword != static_cast<_WordT>(0))
|
if (__thisword != static_cast<_WordT>(0))
|
return (__i * _GLIBCXX_BITSET_BITS_PER_WORD
|
return (__i * _GLIBCXX_BITSET_BITS_PER_WORD
|
+ __builtin_ctzl(__thisword));
|
+ __builtin_ctzl(__thisword));
|
|
|
// check subsequent words
|
// check subsequent words
|
__i++;
|
__i++;
|
for (; __i < _Nw; __i++)
|
for (; __i < _Nw; __i++)
|
{
|
{
|
__thisword = _M_w[__i];
|
__thisword = _M_w[__i];
|
if (__thisword != static_cast<_WordT>(0))
|
if (__thisword != static_cast<_WordT>(0))
|
return (__i * _GLIBCXX_BITSET_BITS_PER_WORD
|
return (__i * _GLIBCXX_BITSET_BITS_PER_WORD
|
+ __builtin_ctzl(__thisword));
|
+ __builtin_ctzl(__thisword));
|
}
|
}
|
// not found, so return an indication of failure.
|
// not found, so return an indication of failure.
|
return __not_found;
|
return __not_found;
|
} // end _M_do_find_next
|
} // end _M_do_find_next
|
|
|
/**
|
/**
|
* Base class, specialization for a single word.
|
* Base class, specialization for a single word.
|
*
|
*
|
* See documentation for bitset.
|
* See documentation for bitset.
|
*/
|
*/
|
template<>
|
template<>
|
struct _Base_bitset<1>
|
struct _Base_bitset<1>
|
{
|
{
|
typedef unsigned long _WordT;
|
typedef unsigned long _WordT;
|
_WordT _M_w;
|
_WordT _M_w;
|
|
|
_Base_bitset(void)
|
_Base_bitset(void)
|
: _M_w(0)
|
: _M_w(0)
|
{ }
|
{ }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
_Base_bitset(unsigned long long __val)
|
_Base_bitset(unsigned long long __val)
|
#else
|
#else
|
_Base_bitset(unsigned long __val)
|
_Base_bitset(unsigned long __val)
|
#endif
|
#endif
|
: _M_w(__val)
|
: _M_w(__val)
|
{ }
|
{ }
|
|
|
static size_t
|
static size_t
|
_S_whichword(size_t __pos )
|
_S_whichword(size_t __pos )
|
{ return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }
|
{ return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }
|
|
|
static size_t
|
static size_t
|
_S_whichbyte(size_t __pos )
|
_S_whichbyte(size_t __pos )
|
{ return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }
|
{ return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }
|
|
|
static size_t
|
static size_t
|
_S_whichbit(size_t __pos )
|
_S_whichbit(size_t __pos )
|
{ return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }
|
{ return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }
|
|
|
static _WordT
|
static _WordT
|
_S_maskbit(size_t __pos )
|
_S_maskbit(size_t __pos )
|
{ return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }
|
{ return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }
|
|
|
_WordT&
|
_WordT&
|
_M_getword(size_t)
|
_M_getword(size_t)
|
{ return _M_w; }
|
{ return _M_w; }
|
|
|
_WordT
|
_WordT
|
_M_getword(size_t) const
|
_M_getword(size_t) const
|
{ return _M_w; }
|
{ return _M_w; }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
const _WordT*
|
const _WordT*
|
_M_getdata() const
|
_M_getdata() const
|
{ return &_M_w; }
|
{ return &_M_w; }
|
#endif
|
#endif
|
|
|
_WordT&
|
_WordT&
|
_M_hiword()
|
_M_hiword()
|
{ return _M_w; }
|
{ return _M_w; }
|
|
|
_WordT
|
_WordT
|
_M_hiword() const
|
_M_hiword() const
|
{ return _M_w; }
|
{ return _M_w; }
|
|
|
void
|
void
|
_M_do_and(const _Base_bitset<1>& __x)
|
_M_do_and(const _Base_bitset<1>& __x)
|
{ _M_w &= __x._M_w; }
|
{ _M_w &= __x._M_w; }
|
|
|
void
|
void
|
_M_do_or(const _Base_bitset<1>& __x)
|
_M_do_or(const _Base_bitset<1>& __x)
|
{ _M_w |= __x._M_w; }
|
{ _M_w |= __x._M_w; }
|
|
|
void
|
void
|
_M_do_xor(const _Base_bitset<1>& __x)
|
_M_do_xor(const _Base_bitset<1>& __x)
|
{ _M_w ^= __x._M_w; }
|
{ _M_w ^= __x._M_w; }
|
|
|
void
|
void
|
_M_do_left_shift(size_t __shift)
|
_M_do_left_shift(size_t __shift)
|
{ _M_w <<= __shift; }
|
{ _M_w <<= __shift; }
|
|
|
void
|
void
|
_M_do_right_shift(size_t __shift)
|
_M_do_right_shift(size_t __shift)
|
{ _M_w >>= __shift; }
|
{ _M_w >>= __shift; }
|
|
|
void
|
void
|
_M_do_flip()
|
_M_do_flip()
|
{ _M_w = ~_M_w; }
|
{ _M_w = ~_M_w; }
|
|
|
void
|
void
|
_M_do_set()
|
_M_do_set()
|
{ _M_w = ~static_cast<_WordT>(0); }
|
{ _M_w = ~static_cast<_WordT>(0); }
|
|
|
void
|
void
|
_M_do_reset()
|
_M_do_reset()
|
{ _M_w = 0; }
|
{ _M_w = 0; }
|
|
|
bool
|
bool
|
_M_is_equal(const _Base_bitset<1>& __x) const
|
_M_is_equal(const _Base_bitset<1>& __x) const
|
{ return _M_w == __x._M_w; }
|
{ return _M_w == __x._M_w; }
|
|
|
size_t
|
size_t
|
_M_are_all_aux() const
|
_M_are_all_aux() const
|
{ return __builtin_popcountl(_M_w); }
|
{ return __builtin_popcountl(_M_w); }
|
|
|
bool
|
bool
|
_M_is_any() const
|
_M_is_any() const
|
{ return _M_w != 0; }
|
{ return _M_w != 0; }
|
|
|
size_t
|
size_t
|
_M_do_count() const
|
_M_do_count() const
|
{ return __builtin_popcountl(_M_w); }
|
{ return __builtin_popcountl(_M_w); }
|
|
|
unsigned long
|
unsigned long
|
_M_do_to_ulong() const
|
_M_do_to_ulong() const
|
{ return _M_w; }
|
{ return _M_w; }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
unsigned long long
|
unsigned long long
|
_M_do_to_ullong() const
|
_M_do_to_ullong() const
|
{ return _M_w; }
|
{ return _M_w; }
|
#endif
|
#endif
|
|
|
size_t
|
size_t
|
_M_do_find_first(size_t __not_found) const
|
_M_do_find_first(size_t __not_found) const
|
{
|
{
|
if (_M_w != 0)
|
if (_M_w != 0)
|
return __builtin_ctzl(_M_w);
|
return __builtin_ctzl(_M_w);
|
else
|
else
|
return __not_found;
|
return __not_found;
|
}
|
}
|
|
|
// find the next "on" bit that follows "prev"
|
// find the next "on" bit that follows "prev"
|
size_t
|
size_t
|
_M_do_find_next(size_t __prev, size_t __not_found) const
|
_M_do_find_next(size_t __prev, size_t __not_found) const
|
{
|
{
|
++__prev;
|
++__prev;
|
if (__prev >= ((size_t) _GLIBCXX_BITSET_BITS_PER_WORD))
|
if (__prev >= ((size_t) _GLIBCXX_BITSET_BITS_PER_WORD))
|
return __not_found;
|
return __not_found;
|
|
|
_WordT __x = _M_w >> __prev;
|
_WordT __x = _M_w >> __prev;
|
if (__x != 0)
|
if (__x != 0)
|
return __builtin_ctzl(__x) + __prev;
|
return __builtin_ctzl(__x) + __prev;
|
else
|
else
|
return __not_found;
|
return __not_found;
|
}
|
}
|
};
|
};
|
|
|
/**
|
/**
|
* Base class, specialization for no storage (zero-length %bitset).
|
* Base class, specialization for no storage (zero-length %bitset).
|
*
|
*
|
* See documentation for bitset.
|
* See documentation for bitset.
|
*/
|
*/
|
template<>
|
template<>
|
struct _Base_bitset<0>
|
struct _Base_bitset<0>
|
{
|
{
|
typedef unsigned long _WordT;
|
typedef unsigned long _WordT;
|
|
|
_Base_bitset()
|
_Base_bitset()
|
{ }
|
{ }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
_Base_bitset(unsigned long long)
|
_Base_bitset(unsigned long long)
|
#else
|
#else
|
_Base_bitset(unsigned long)
|
_Base_bitset(unsigned long)
|
#endif
|
#endif
|
{ }
|
{ }
|
|
|
static size_t
|
static size_t
|
_S_whichword(size_t __pos )
|
_S_whichword(size_t __pos )
|
{ return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }
|
{ return __pos / _GLIBCXX_BITSET_BITS_PER_WORD; }
|
|
|
static size_t
|
static size_t
|
_S_whichbyte(size_t __pos )
|
_S_whichbyte(size_t __pos )
|
{ return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }
|
{ return (__pos % _GLIBCXX_BITSET_BITS_PER_WORD) / __CHAR_BIT__; }
|
|
|
static size_t
|
static size_t
|
_S_whichbit(size_t __pos )
|
_S_whichbit(size_t __pos )
|
{ return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }
|
{ return __pos % _GLIBCXX_BITSET_BITS_PER_WORD; }
|
|
|
static _WordT
|
static _WordT
|
_S_maskbit(size_t __pos )
|
_S_maskbit(size_t __pos )
|
{ return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }
|
{ return (static_cast<_WordT>(1)) << _S_whichbit(__pos); }
|
|
|
// This would normally give access to the data. The bounds-checking
|
// This would normally give access to the data. The bounds-checking
|
// in the bitset class will prevent the user from getting this far,
|
// in the bitset class will prevent the user from getting this far,
|
// but (1) it must still return an lvalue to compile, and (2) the
|
// but (1) it must still return an lvalue to compile, and (2) the
|
// user might call _Unchecked_set directly, in which case this /needs/
|
// user might call _Unchecked_set directly, in which case this /needs/
|
// to fail. Let's not penalize zero-length users unless they actually
|
// to fail. Let's not penalize zero-length users unless they actually
|
// make an unchecked call; all the memory ugliness is therefore
|
// make an unchecked call; all the memory ugliness is therefore
|
// localized to this single should-never-get-this-far function.
|
// localized to this single should-never-get-this-far function.
|
_WordT&
|
_WordT&
|
_M_getword(size_t) const
|
_M_getword(size_t) const
|
{
|
{
|
__throw_out_of_range(__N("_Base_bitset::_M_getword"));
|
__throw_out_of_range(__N("_Base_bitset::_M_getword"));
|
return *new _WordT;
|
return *new _WordT;
|
}
|
}
|
|
|
_WordT
|
_WordT
|
_M_hiword() const
|
_M_hiword() const
|
{ return 0; }
|
{ return 0; }
|
|
|
void
|
void
|
_M_do_and(const _Base_bitset<0>&)
|
_M_do_and(const _Base_bitset<0>&)
|
{ }
|
{ }
|
|
|
void
|
void
|
_M_do_or(const _Base_bitset<0>&)
|
_M_do_or(const _Base_bitset<0>&)
|
{ }
|
{ }
|
|
|
void
|
void
|
_M_do_xor(const _Base_bitset<0>&)
|
_M_do_xor(const _Base_bitset<0>&)
|
{ }
|
{ }
|
|
|
void
|
void
|
_M_do_left_shift(size_t)
|
_M_do_left_shift(size_t)
|
{ }
|
{ }
|
|
|
void
|
void
|
_M_do_right_shift(size_t)
|
_M_do_right_shift(size_t)
|
{ }
|
{ }
|
|
|
void
|
void
|
_M_do_flip()
|
_M_do_flip()
|
{ }
|
{ }
|
|
|
void
|
void
|
_M_do_set()
|
_M_do_set()
|
{ }
|
{ }
|
|
|
void
|
void
|
_M_do_reset()
|
_M_do_reset()
|
{ }
|
{ }
|
|
|
// Are all empty bitsets equal to each other? Are they equal to
|
// Are all empty bitsets equal to each other? Are they equal to
|
// themselves? How to compare a thing which has no state? What is
|
// themselves? How to compare a thing which has no state? What is
|
// the sound of one zero-length bitset clapping?
|
// the sound of one zero-length bitset clapping?
|
bool
|
bool
|
_M_is_equal(const _Base_bitset<0>&) const
|
_M_is_equal(const _Base_bitset<0>&) const
|
{ return true; }
|
{ return true; }
|
|
|
size_t
|
size_t
|
_M_are_all_aux() const
|
_M_are_all_aux() const
|
{ return 0; }
|
{ return 0; }
|
|
|
bool
|
bool
|
_M_is_any() const
|
_M_is_any() const
|
{ return false; }
|
{ return false; }
|
|
|
size_t
|
size_t
|
_M_do_count() const
|
_M_do_count() const
|
{ return 0; }
|
{ return 0; }
|
|
|
unsigned long
|
unsigned long
|
_M_do_to_ulong() const
|
_M_do_to_ulong() const
|
{ return 0; }
|
{ return 0; }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
unsigned long long
|
unsigned long long
|
_M_do_to_ullong() const
|
_M_do_to_ullong() const
|
{ return 0; }
|
{ return 0; }
|
#endif
|
#endif
|
|
|
// Normally "not found" is the size, but that could also be
|
// Normally "not found" is the size, but that could also be
|
// misinterpreted as an index in this corner case. Oh well.
|
// misinterpreted as an index in this corner case. Oh well.
|
size_t
|
size_t
|
_M_do_find_first(size_t) const
|
_M_do_find_first(size_t) const
|
{ return 0; }
|
{ return 0; }
|
|
|
size_t
|
size_t
|
_M_do_find_next(size_t, size_t) const
|
_M_do_find_next(size_t, size_t) const
|
{ return 0; }
|
{ return 0; }
|
};
|
};
|
|
|
|
|
// Helper class to zero out the unused high-order bits in the highest word.
|
// Helper class to zero out the unused high-order bits in the highest word.
|
template
|
template
|
struct _Sanitize
|
struct _Sanitize
|
{
|
{
|
static void _S_do_sanitize(unsigned long& __val)
|
static void _S_do_sanitize(unsigned long& __val)
|
{ __val &= ~((~static_cast(0)) << _Extrabits); }
|
{ __val &= ~((~static_cast(0)) << _Extrabits); }
|
};
|
};
|
|
|
template<>
|
template<>
|
struct _Sanitize<0>
|
struct _Sanitize<0>
|
{ static void _S_do_sanitize(unsigned long) {} };
|
{ static void _S_do_sanitize(unsigned long) {} };
|
|
|
/**
|
/**
|
* @brief The %bitset class represents a @e fixed-size sequence of bits.
|
* @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
|
* (Note that %bitset does @e not meet the formal requirements of a
|
* container. Mainly, it lacks iterators.)
|
* container. Mainly, it lacks iterators.)
|
*
|
*
|
* The template argument, @a Nb, may be any non-negative number,
|
* The template argument, @a Nb, may be any non-negative number,
|
* specifying the number of bits (e.g., "0", "12", "1024*1024").
|
* specifying the number of bits (e.g., "0", "12", "1024*1024").
|
*
|
*
|
* In the general unoptimized case, storage is allocated in word-sized
|
* In the general unoptimized case, storage is allocated in word-sized
|
* blocks. Let B be the number of bits in a word, then (Nb+(B-1))/B
|
* blocks. Let B be the number of bits in a word, then (Nb+(B-1))/B
|
* words will be used for storage. B - Nb%B bits are unused. (They are
|
* words will be used for storage. B - Nb%B bits are unused. (They are
|
* the high-order bits in the highest word.) It is a class invariant
|
* the high-order bits in the highest word.) It is a class invariant
|
* that those unused bits are always zero.
|
* that those unused bits are always zero.
|
*
|
*
|
* If you think of %bitset as a simple array of bits, be
|
* If you think of %bitset as a simple array of bits, be
|
* aware that your mental picture is reversed: a %bitset behaves
|
* 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 same way as bits in integers do, with the bit at index 0 in
|
* the least significant / right-hand position, and the bit at
|
* the least significant / right-hand position, and the bit at
|
* index Nb-1 in the most significant / left-hand position.
|
* index Nb-1 in the most significant / left-hand position.
|
* Thus, unlike other containers, a %bitset's index counts from
|
* Thus, unlike other containers, a %bitset's index counts from
|
* right to left, to put it very loosely.
|
* right to left, to put it very loosely.
|
*
|
*
|
* This behavior is preserved when translating to and from strings. For
|
* This behavior is preserved when translating to and from strings. For
|
* example, the first line of the following program probably prints
|
* example, the first line of the following program probably prints
|
* b('a') is 0001100001 on a modern ASCII system.
|
* b('a') is 0001100001 on a modern ASCII system.
|
*
|
*
|
* @code
|
* @code
|
* #include
|
* #include
|
* #include
|
* #include
|
* #include
|
* #include
|
*
|
*
|
* using namespace std;
|
* using namespace std;
|
*
|
*
|
* int main()
|
* int main()
|
* {
|
* {
|
* long a = 'a';
|
* long a = 'a';
|
* bitset<10> b(a);
|
* bitset<10> b(a);
|
*
|
*
|
* cout << "b('a') is " << b << endl;
|
* cout << "b('a') is " << b << endl;
|
*
|
*
|
* ostringstream s;
|
* ostringstream s;
|
* s << b;
|
* s << b;
|
* string str = s.str();
|
* string str = s.str();
|
* cout << "index 3 in the string is " << str[3] << " but\n"
|
* cout << "index 3 in the string is " << str[3] << " but\n"
|
* << "index 3 in the bitset is " << b[3] << endl;
|
* << "index 3 in the bitset is " << b[3] << endl;
|
* }
|
* }
|
* @endcode
|
* @endcode
|
*
|
*
|
* Also see:
|
* Also see:
|
* http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch33s02.html
|
* http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch33s02.html
|
* for a description of extensions.
|
* for a description of extensions.
|
*
|
*
|
* Most of the actual code isn't contained in %bitset<> itself, but in the
|
* 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
|
* base class _Base_bitset. The base class works with whole words, not with
|
* individual bits. This allows us to specialize _Base_bitset for the
|
* individual bits. This allows us to specialize _Base_bitset for the
|
* important special case where the %bitset is only a single word.
|
* important special case where the %bitset is only a single word.
|
*
|
*
|
* Extra confusion can result due to the fact that the storage for
|
* 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
|
* _Base_bitset @e is a regular array, and is indexed as such. This is
|
* carefully encapsulated.
|
* carefully encapsulated.
|
*/
|
*/
|
template
|
template
|
class bitset
|
class bitset
|
: private _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)>
|
: private _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)>
|
{
|
{
|
private:
|
private:
|
typedef _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> _Base;
|
typedef _Base_bitset<_GLIBCXX_BITSET_WORDS(_Nb)> _Base;
|
typedef unsigned long _WordT;
|
typedef unsigned long _WordT;
|
|
|
void
|
void
|
_M_do_sanitize()
|
_M_do_sanitize()
|
{
|
{
|
_Sanitize<_Nb % _GLIBCXX_BITSET_BITS_PER_WORD>::
|
_Sanitize<_Nb % _GLIBCXX_BITSET_BITS_PER_WORD>::
|
_S_do_sanitize(this->_M_hiword());
|
_S_do_sanitize(this->_M_hiword());
|
}
|
}
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
template friend class hash;
|
template friend class hash;
|
#endif
|
#endif
|
|
|
public:
|
public:
|
/**
|
/**
|
* This encapsulates the concept of a single bit. An instance of this
|
* This encapsulates the concept of a single bit. An instance of this
|
* class is a proxy for an actual bit; this way the individual bit
|
* class is a proxy for an actual bit; this way the individual bit
|
* operations are done as faster word-size bitwise instructions.
|
* operations are done as faster word-size bitwise instructions.
|
*
|
*
|
* Most users will never need to use this class directly; conversions
|
* Most users will never need to use this class directly; conversions
|
* to and from bool are automatic and should be transparent. Overloaded
|
* to and from bool are automatic and should be transparent. Overloaded
|
* operators help to preserve the illusion.
|
* operators help to preserve the illusion.
|
*
|
*
|
* (On a typical system, this bit %reference is 64
|
* (On a typical system, this bit %reference is 64
|
* times the size of an actual bit. Ha.)
|
* times the size of an actual bit. Ha.)
|
*/
|
*/
|
class reference
|
class reference
|
{
|
{
|
friend class bitset;
|
friend class bitset;
|
|
|
_WordT *_M_wp;
|
_WordT *_M_wp;
|
size_t _M_bpos;
|
size_t _M_bpos;
|
|
|
// left undefined
|
// left undefined
|
reference();
|
reference();
|
|
|
public:
|
public:
|
reference(bitset& __b, size_t __pos)
|
reference(bitset& __b, size_t __pos)
|
{
|
{
|
_M_wp = &__b._M_getword(__pos);
|
_M_wp = &__b._M_getword(__pos);
|
_M_bpos = _Base::_S_whichbit(__pos);
|
_M_bpos = _Base::_S_whichbit(__pos);
|
}
|
}
|
|
|
~reference()
|
~reference()
|
{ }
|
{ }
|
|
|
// For b[i] = __x;
|
// For b[i] = __x;
|
reference&
|
reference&
|
operator=(bool __x)
|
operator=(bool __x)
|
{
|
{
|
if (__x)
|
if (__x)
|
*_M_wp |= _Base::_S_maskbit(_M_bpos);
|
*_M_wp |= _Base::_S_maskbit(_M_bpos);
|
else
|
else
|
*_M_wp &= ~_Base::_S_maskbit(_M_bpos);
|
*_M_wp &= ~_Base::_S_maskbit(_M_bpos);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
// For b[i] = b[__j];
|
// For b[i] = b[__j];
|
reference&
|
reference&
|
operator=(const reference& __j)
|
operator=(const reference& __j)
|
{
|
{
|
if ((*(__j._M_wp) & _Base::_S_maskbit(__j._M_bpos)))
|
if ((*(__j._M_wp) & _Base::_S_maskbit(__j._M_bpos)))
|
*_M_wp |= _Base::_S_maskbit(_M_bpos);
|
*_M_wp |= _Base::_S_maskbit(_M_bpos);
|
else
|
else
|
*_M_wp &= ~_Base::_S_maskbit(_M_bpos);
|
*_M_wp &= ~_Base::_S_maskbit(_M_bpos);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
// Flips the bit
|
// Flips the bit
|
bool
|
bool
|
operator~() const
|
operator~() const
|
{ return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) == 0; }
|
{ return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) == 0; }
|
|
|
// For __x = b[i];
|
// For __x = b[i];
|
operator bool() const
|
operator bool() const
|
{ return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) != 0; }
|
{ return (*(_M_wp) & _Base::_S_maskbit(_M_bpos)) != 0; }
|
|
|
// For b[i].flip();
|
// For b[i].flip();
|
reference&
|
reference&
|
flip()
|
flip()
|
{
|
{
|
*_M_wp ^= _Base::_S_maskbit(_M_bpos);
|
*_M_wp ^= _Base::_S_maskbit(_M_bpos);
|
return *this;
|
return *this;
|
}
|
}
|
};
|
};
|
friend class reference;
|
friend class reference;
|
|
|
// 23.3.5.1 constructors:
|
// 23.3.5.1 constructors:
|
/// All bits set to zero.
|
/// All bits set to zero.
|
bitset()
|
bitset()
|
{ }
|
{ }
|
|
|
/// Initial bits bitwise-copied from a single word (others set to zero).
|
/// Initial bits bitwise-copied from a single word (others set to zero).
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
bitset(unsigned long long __val)
|
bitset(unsigned long long __val)
|
#else
|
#else
|
bitset(unsigned long __val)
|
bitset(unsigned long __val)
|
#endif
|
#endif
|
: _Base(__val)
|
: _Base(__val)
|
{ _M_do_sanitize(); }
|
{ _M_do_sanitize(); }
|
|
|
/**
|
/**
|
* @brief Use a subset of a string.
|
* @brief Use a subset of a string.
|
* @param s A string of @a 0 and @a 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 position Index of the first character in @a s to use;
|
* defaults to zero.
|
* defaults to zero.
|
* @throw std::out_of_range If @a pos is bigger the size of @a s.
|
* @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
|
* @throw std::invalid_argument If a character appears in the string
|
* which is neither @a 0 nor @a 1.
|
* which is neither @a 0 nor @a 1.
|
*/
|
*/
|
template
|
template
|
explicit
|
explicit
|
bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
size_t __position = 0)
|
size_t __position = 0)
|
: _Base()
|
: _Base()
|
{
|
{
|
if (__position > __s.size())
|
if (__position > __s.size())
|
__throw_out_of_range(__N("bitset::bitset initial position "
|
__throw_out_of_range(__N("bitset::bitset initial position "
|
"not valid"));
|
"not valid"));
|
_M_copy_from_string(__s, __position,
|
_M_copy_from_string(__s, __position,
|
std::basic_string<_CharT, _Traits, _Alloc>::npos,
|
std::basic_string<_CharT, _Traits, _Alloc>::npos,
|
_CharT('0'), _CharT('1'));
|
_CharT('0'), _CharT('1'));
|
}
|
}
|
|
|
/**
|
/**
|
* @brief Use a subset of a string.
|
* @brief Use a subset of a string.
|
* @param s A string of @a 0 and @a 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 position Index of the first character in @a s to use.
|
* @param n The number of characters to copy.
|
* @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::out_of_range If @a pos is bigger the size of @a s.
|
* @throw std::invalid_argument If a character appears in the string
|
* @throw std::invalid_argument If a character appears in the string
|
* which is neither @a 0 nor @a 1.
|
* which is neither @a 0 nor @a 1.
|
*/
|
*/
|
template
|
template
|
bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
size_t __position, size_t __n)
|
size_t __position, size_t __n)
|
: _Base()
|
: _Base()
|
{
|
{
|
if (__position > __s.size())
|
if (__position > __s.size())
|
__throw_out_of_range(__N("bitset::bitset initial position "
|
__throw_out_of_range(__N("bitset::bitset initial position "
|
"not valid"));
|
"not valid"));
|
_M_copy_from_string(__s, __position, __n, _CharT('0'), _CharT('1'));
|
_M_copy_from_string(__s, __position, __n, _CharT('0'), _CharT('1'));
|
}
|
}
|
|
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// 396. what are characters zero and one.
|
// 396. what are characters zero and one.
|
template
|
template
|
bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
bitset(const std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
size_t __position, size_t __n,
|
size_t __position, size_t __n,
|
_CharT __zero, _CharT __one = _CharT('1'))
|
_CharT __zero, _CharT __one = _CharT('1'))
|
: _Base()
|
: _Base()
|
{
|
{
|
if (__position > __s.size())
|
if (__position > __s.size())
|
__throw_out_of_range(__N("bitset::bitset initial position "
|
__throw_out_of_range(__N("bitset::bitset initial position "
|
"not valid"));
|
"not valid"));
|
_M_copy_from_string(__s, __position, __n, __zero, __one);
|
_M_copy_from_string(__s, __position, __n, __zero, __one);
|
}
|
}
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
/**
|
/**
|
* @brief Construct from a string.
|
* @brief Construct from a string.
|
* @param str A string of @a 0 and @a 1 characters.
|
* @param str A string of @a 0 and @a 1 characters.
|
* @throw std::invalid_argument If a character appears in the string
|
* @throw std::invalid_argument If a character appears in the string
|
* which is neither @a 0 nor @a 1.
|
* which is neither @a 0 nor @a 1.
|
*/
|
*/
|
explicit
|
explicit
|
bitset(const char* __str)
|
bitset(const char* __str)
|
: _Base()
|
: _Base()
|
{
|
{
|
if (!__str)
|
if (!__str)
|
__throw_logic_error(__N("bitset::bitset(const char*)"));
|
__throw_logic_error(__N("bitset::bitset(const char*)"));
|
|
|
const size_t __len = __builtin_strlen(__str);
|
const size_t __len = __builtin_strlen(__str);
|
_M_copy_from_ptr>(__str, __len, 0,
|
_M_copy_from_ptr>(__str, __len, 0,
|
__len, '0', '1');
|
__len, '0', '1');
|
}
|
}
|
#endif
|
#endif
|
|
|
// 23.3.5.2 bitset operations:
|
// 23.3.5.2 bitset operations:
|
//@{
|
//@{
|
/**
|
/**
|
* @brief Operations on bitsets.
|
* @brief Operations on bitsets.
|
* @param rhs A same-sized bitset.
|
* @param rhs A same-sized bitset.
|
*
|
*
|
* These should be self-explanatory.
|
* These should be self-explanatory.
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
operator&=(const bitset<_Nb>& __rhs)
|
operator&=(const bitset<_Nb>& __rhs)
|
{
|
{
|
this->_M_do_and(__rhs);
|
this->_M_do_and(__rhs);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
bitset<_Nb>&
|
bitset<_Nb>&
|
operator|=(const bitset<_Nb>& __rhs)
|
operator|=(const bitset<_Nb>& __rhs)
|
{
|
{
|
this->_M_do_or(__rhs);
|
this->_M_do_or(__rhs);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
bitset<_Nb>&
|
bitset<_Nb>&
|
operator^=(const bitset<_Nb>& __rhs)
|
operator^=(const bitset<_Nb>& __rhs)
|
{
|
{
|
this->_M_do_xor(__rhs);
|
this->_M_do_xor(__rhs);
|
return *this;
|
return *this;
|
}
|
}
|
//@}
|
//@}
|
|
|
//@{
|
//@{
|
/**
|
/**
|
* @brief Operations on bitsets.
|
* @brief Operations on bitsets.
|
* @param position The number of places to shift.
|
* @param position The number of places to shift.
|
*
|
*
|
* These should be self-explanatory.
|
* These should be self-explanatory.
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
operator<<=(size_t __position)
|
operator<<=(size_t __position)
|
{
|
{
|
if (__builtin_expect(__position < _Nb, 1))
|
if (__builtin_expect(__position < _Nb, 1))
|
{
|
{
|
this->_M_do_left_shift(__position);
|
this->_M_do_left_shift(__position);
|
this->_M_do_sanitize();
|
this->_M_do_sanitize();
|
}
|
}
|
else
|
else
|
this->_M_do_reset();
|
this->_M_do_reset();
|
return *this;
|
return *this;
|
}
|
}
|
|
|
bitset<_Nb>&
|
bitset<_Nb>&
|
operator>>=(size_t __position)
|
operator>>=(size_t __position)
|
{
|
{
|
if (__builtin_expect(__position < _Nb, 1))
|
if (__builtin_expect(__position < _Nb, 1))
|
{
|
{
|
this->_M_do_right_shift(__position);
|
this->_M_do_right_shift(__position);
|
this->_M_do_sanitize();
|
this->_M_do_sanitize();
|
}
|
}
|
else
|
else
|
this->_M_do_reset();
|
this->_M_do_reset();
|
return *this;
|
return *this;
|
}
|
}
|
//@}
|
//@}
|
|
|
//@{
|
//@{
|
/**
|
/**
|
* These versions of single-bit set, reset, flip, and test are
|
* These versions of single-bit set, reset, flip, and test are
|
* extensions from the SGI version. They do no range checking.
|
* extensions from the SGI version. They do no range checking.
|
* @ingroup SGIextensions
|
* @ingroup SGIextensions
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
_Unchecked_set(size_t __pos)
|
_Unchecked_set(size_t __pos)
|
{
|
{
|
this->_M_getword(__pos) |= _Base::_S_maskbit(__pos);
|
this->_M_getword(__pos) |= _Base::_S_maskbit(__pos);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
bitset<_Nb>&
|
bitset<_Nb>&
|
_Unchecked_set(size_t __pos, int __val)
|
_Unchecked_set(size_t __pos, int __val)
|
{
|
{
|
if (__val)
|
if (__val)
|
this->_M_getword(__pos) |= _Base::_S_maskbit(__pos);
|
this->_M_getword(__pos) |= _Base::_S_maskbit(__pos);
|
else
|
else
|
this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos);
|
this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
bitset<_Nb>&
|
bitset<_Nb>&
|
_Unchecked_reset(size_t __pos)
|
_Unchecked_reset(size_t __pos)
|
{
|
{
|
this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos);
|
this->_M_getword(__pos) &= ~_Base::_S_maskbit(__pos);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
bitset<_Nb>&
|
bitset<_Nb>&
|
_Unchecked_flip(size_t __pos)
|
_Unchecked_flip(size_t __pos)
|
{
|
{
|
this->_M_getword(__pos) ^= _Base::_S_maskbit(__pos);
|
this->_M_getword(__pos) ^= _Base::_S_maskbit(__pos);
|
return *this;
|
return *this;
|
}
|
}
|
|
|
bool
|
bool
|
_Unchecked_test(size_t __pos) const
|
_Unchecked_test(size_t __pos) const
|
{ return ((this->_M_getword(__pos) & _Base::_S_maskbit(__pos))
|
{ return ((this->_M_getword(__pos) & _Base::_S_maskbit(__pos))
|
!= static_cast<_WordT>(0)); }
|
!= static_cast<_WordT>(0)); }
|
//@}
|
//@}
|
|
|
// Set, reset, and flip.
|
// Set, reset, and flip.
|
/**
|
/**
|
* @brief Sets every bit to true.
|
* @brief Sets every bit to true.
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
set()
|
set()
|
{
|
{
|
this->_M_do_set();
|
this->_M_do_set();
|
this->_M_do_sanitize();
|
this->_M_do_sanitize();
|
return *this;
|
return *this;
|
}
|
}
|
|
|
/**
|
/**
|
* @brief Sets a given bit to a particular value.
|
* @brief Sets a given bit to a particular value.
|
* @param position The index of the bit.
|
* @param position The index of the bit.
|
* @param val Either true or false, defaults to true.
|
* @param val Either true or false, defaults to true.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
set(size_t __position, bool __val = true)
|
set(size_t __position, bool __val = true)
|
{
|
{
|
if (__position >= _Nb)
|
if (__position >= _Nb)
|
__throw_out_of_range(__N("bitset::set"));
|
__throw_out_of_range(__N("bitset::set"));
|
return _Unchecked_set(__position, __val);
|
return _Unchecked_set(__position, __val);
|
}
|
}
|
|
|
/**
|
/**
|
* @brief Sets every bit to false.
|
* @brief Sets every bit to false.
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
reset()
|
reset()
|
{
|
{
|
this->_M_do_reset();
|
this->_M_do_reset();
|
return *this;
|
return *this;
|
}
|
}
|
|
|
/**
|
/**
|
* @brief Sets a given bit to false.
|
* @brief Sets a given bit to false.
|
* @param position The index of the bit.
|
* @param position The index of the bit.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
*
|
*
|
* Same as writing @c set(pos,false).
|
* Same as writing @c set(pos,false).
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
reset(size_t __position)
|
reset(size_t __position)
|
{
|
{
|
if (__position >= _Nb)
|
if (__position >= _Nb)
|
__throw_out_of_range(__N("bitset::reset"));
|
__throw_out_of_range(__N("bitset::reset"));
|
return _Unchecked_reset(__position);
|
return _Unchecked_reset(__position);
|
}
|
}
|
|
|
/**
|
/**
|
* @brief Toggles every bit to its opposite value.
|
* @brief Toggles every bit to its opposite value.
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
flip()
|
flip()
|
{
|
{
|
this->_M_do_flip();
|
this->_M_do_flip();
|
this->_M_do_sanitize();
|
this->_M_do_sanitize();
|
return *this;
|
return *this;
|
}
|
}
|
|
|
/**
|
/**
|
* @brief Toggles a given bit to its opposite value.
|
* @brief Toggles a given bit to its opposite value.
|
* @param position The index of the bit.
|
* @param position The index of the bit.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
*/
|
*/
|
bitset<_Nb>&
|
bitset<_Nb>&
|
flip(size_t __position)
|
flip(size_t __position)
|
{
|
{
|
if (__position >= _Nb)
|
if (__position >= _Nb)
|
__throw_out_of_range(__N("bitset::flip"));
|
__throw_out_of_range(__N("bitset::flip"));
|
return _Unchecked_flip(__position);
|
return _Unchecked_flip(__position);
|
}
|
}
|
|
|
/// See the no-argument flip().
|
/// See the no-argument flip().
|
bitset<_Nb>
|
bitset<_Nb>
|
operator~() const
|
operator~() const
|
{ return bitset<_Nb>(*this).flip(); }
|
{ return bitset<_Nb>(*this).flip(); }
|
|
|
//@{
|
//@{
|
/**
|
/**
|
* @brief Array-indexing support.
|
* @brief Array-indexing support.
|
* @param position Index into the %bitset.
|
* @param position Index into the %bitset.
|
* @return A bool for a const %bitset. For non-const bitsets, an
|
* @return A bool for a const %bitset. For non-const bitsets, an
|
* instance of the reference proxy class.
|
* instance of the reference proxy class.
|
* @note These operators do no range checking and throw no exceptions,
|
* @note These operators do no range checking and throw no exceptions,
|
* as required by DR 11 to the standard.
|
* as required by DR 11 to the standard.
|
*
|
*
|
* _GLIBCXX_RESOLVE_LIB_DEFECTS Note that this implementation already
|
* _GLIBCXX_RESOLVE_LIB_DEFECTS Note that this implementation already
|
* resolves DR 11 (items 1 and 2), but does not do the range-checking
|
* resolves DR 11 (items 1 and 2), but does not do the range-checking
|
* required by that DR's resolution. -pme
|
* required by that DR's resolution. -pme
|
* The DR has since been changed: range-checking is a precondition
|
* The DR has since been changed: range-checking is a precondition
|
* (users' responsibility), and these functions must not throw. -pme
|
* (users' responsibility), and these functions must not throw. -pme
|
*/
|
*/
|
reference
|
reference
|
operator[](size_t __position)
|
operator[](size_t __position)
|
{ return reference(*this,__position); }
|
{ return reference(*this,__position); }
|
|
|
bool
|
bool
|
operator[](size_t __position) const
|
operator[](size_t __position) const
|
{ return _Unchecked_test(__position); }
|
{ return _Unchecked_test(__position); }
|
//@}
|
//@}
|
|
|
/**
|
/**
|
* @brief Returns a numerical interpretation of the %bitset.
|
* @brief Returns a numerical interpretation of the %bitset.
|
* @return The integral equivalent of the bits.
|
* @return The integral equivalent of the bits.
|
* @throw std::overflow_error If there are too many bits to be
|
* @throw std::overflow_error If there are too many bits to be
|
* represented in an @c unsigned @c long.
|
* represented in an @c unsigned @c long.
|
*/
|
*/
|
unsigned long
|
unsigned long
|
to_ulong() const
|
to_ulong() const
|
{ return this->_M_do_to_ulong(); }
|
{ return this->_M_do_to_ulong(); }
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
unsigned long long
|
unsigned long long
|
to_ullong() const
|
to_ullong() const
|
{ return this->_M_do_to_ullong(); }
|
{ return this->_M_do_to_ullong(); }
|
#endif
|
#endif
|
|
|
/**
|
/**
|
* @brief Returns a character interpretation of the %bitset.
|
* @brief Returns a character interpretation of the %bitset.
|
* @return The string equivalent of the bits.
|
* @return The string equivalent of the bits.
|
*
|
*
|
* Note the ordering of the bits: decreasing character positions
|
* Note the ordering of the bits: decreasing character positions
|
* correspond to increasing bit positions (see the main class notes for
|
* correspond to increasing bit positions (see the main class notes for
|
* an example).
|
* an example).
|
*/
|
*/
|
template
|
template
|
std::basic_string<_CharT, _Traits, _Alloc>
|
std::basic_string<_CharT, _Traits, _Alloc>
|
to_string() const
|
to_string() const
|
{
|
{
|
std::basic_string<_CharT, _Traits, _Alloc> __result;
|
std::basic_string<_CharT, _Traits, _Alloc> __result;
|
_M_copy_to_string(__result, _CharT('0'), _CharT('1'));
|
_M_copy_to_string(__result, _CharT('0'), _CharT('1'));
|
return __result;
|
return __result;
|
}
|
}
|
|
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// 396. what are characters zero and one.
|
// 396. what are characters zero and one.
|
template
|
template
|
std::basic_string<_CharT, _Traits, _Alloc>
|
std::basic_string<_CharT, _Traits, _Alloc>
|
to_string(_CharT __zero, _CharT __one = _CharT('1')) const
|
to_string(_CharT __zero, _CharT __one = _CharT('1')) const
|
{
|
{
|
std::basic_string<_CharT, _Traits, _Alloc> __result;
|
std::basic_string<_CharT, _Traits, _Alloc> __result;
|
_M_copy_to_string(__result, __zero, __one);
|
_M_copy_to_string(__result, __zero, __one);
|
return __result;
|
return __result;
|
}
|
}
|
|
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// 434. bitset::to_string() hard to use.
|
// 434. bitset::to_string() hard to use.
|
template
|
template
|
std::basic_string<_CharT, _Traits, std::allocator<_CharT> >
|
std::basic_string<_CharT, _Traits, std::allocator<_CharT> >
|
to_string() const
|
to_string() const
|
{ return to_string<_CharT, _Traits, std::allocator<_CharT> >(); }
|
{ return to_string<_CharT, _Traits, std::allocator<_CharT> >(); }
|
|
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// 853. to_string needs updating with zero and one.
|
// 853. to_string needs updating with zero and one.
|
template
|
template
|
std::basic_string<_CharT, _Traits, std::allocator<_CharT> >
|
std::basic_string<_CharT, _Traits, std::allocator<_CharT> >
|
to_string(_CharT __zero, _CharT __one = _CharT('1')) const
|
to_string(_CharT __zero, _CharT __one = _CharT('1')) const
|
{ return to_string<_CharT, _Traits,
|
{ return to_string<_CharT, _Traits,
|
std::allocator<_CharT> >(__zero, __one); }
|
std::allocator<_CharT> >(__zero, __one); }
|
|
|
template
|
template
|
std::basic_string<_CharT, std::char_traits<_CharT>,
|
std::basic_string<_CharT, std::char_traits<_CharT>,
|
std::allocator<_CharT> >
|
std::allocator<_CharT> >
|
to_string() const
|
to_string() const
|
{
|
{
|
return to_string<_CharT, std::char_traits<_CharT>,
|
return to_string<_CharT, std::char_traits<_CharT>,
|
std::allocator<_CharT> >();
|
std::allocator<_CharT> >();
|
}
|
}
|
|
|
template
|
template
|
std::basic_string<_CharT, std::char_traits<_CharT>,
|
std::basic_string<_CharT, std::char_traits<_CharT>,
|
std::allocator<_CharT> >
|
std::allocator<_CharT> >
|
to_string(_CharT __zero, _CharT __one = _CharT('1')) const
|
to_string(_CharT __zero, _CharT __one = _CharT('1')) const
|
{
|
{
|
return to_string<_CharT, std::char_traits<_CharT>,
|
return to_string<_CharT, std::char_traits<_CharT>,
|
std::allocator<_CharT> >(__zero, __one);
|
std::allocator<_CharT> >(__zero, __one);
|
}
|
}
|
|
|
std::basic_string, std::allocator >
|
std::basic_string, std::allocator >
|
to_string() const
|
to_string() const
|
{
|
{
|
return to_string,
|
return to_string,
|
std::allocator >();
|
std::allocator >();
|
}
|
}
|
|
|
std::basic_string, std::allocator >
|
std::basic_string, std::allocator >
|
to_string(char __zero, char __one = '1') const
|
to_string(char __zero, char __one = '1') const
|
{
|
{
|
return to_string,
|
return to_string,
|
std::allocator >(__zero, __one);
|
std::allocator >(__zero, __one);
|
}
|
}
|
|
|
// Helper functions for string operations.
|
// Helper functions for string operations.
|
template
|
template
|
void
|
void
|
_M_copy_from_ptr(const _CharT*, size_t, size_t, size_t,
|
_M_copy_from_ptr(const _CharT*, size_t, size_t, size_t,
|
_CharT, _CharT);
|
_CharT, _CharT);
|
|
|
template
|
template
|
void
|
void
|
_M_copy_from_string(const std::basic_string<_CharT,
|
_M_copy_from_string(const std::basic_string<_CharT,
|
_Traits, _Alloc>& __s, size_t __pos, size_t __n,
|
_Traits, _Alloc>& __s, size_t __pos, size_t __n,
|
_CharT __zero, _CharT __one)
|
_CharT __zero, _CharT __one)
|
{ _M_copy_from_ptr<_CharT, _Traits>(__s.data(), __s.size(), __pos, __n,
|
{ _M_copy_from_ptr<_CharT, _Traits>(__s.data(), __s.size(), __pos, __n,
|
__zero, __one); }
|
__zero, __one); }
|
|
|
template
|
template
|
void
|
void
|
_M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&,
|
_M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>&,
|
_CharT, _CharT) const;
|
_CharT, _CharT) const;
|
|
|
// NB: Backward compat.
|
// NB: Backward compat.
|
template
|
template
|
void
|
void
|
_M_copy_from_string(const std::basic_string<_CharT,
|
_M_copy_from_string(const std::basic_string<_CharT,
|
_Traits, _Alloc>& __s, size_t __pos, size_t __n)
|
_Traits, _Alloc>& __s, size_t __pos, size_t __n)
|
{ _M_copy_from_string(__s, __pos, __n, _CharT('0'), _CharT('1')); }
|
{ _M_copy_from_string(__s, __pos, __n, _CharT('0'), _CharT('1')); }
|
|
|
template
|
template
|
void
|
void
|
_M_copy_to_string(std::basic_string<_CharT, _Traits,_Alloc>& __s) const
|
_M_copy_to_string(std::basic_string<_CharT, _Traits,_Alloc>& __s) const
|
{ _M_copy_to_string(__s, _CharT('0'), _CharT('1')); }
|
{ _M_copy_to_string(__s, _CharT('0'), _CharT('1')); }
|
|
|
/// Returns the number of bits which are set.
|
/// Returns the number of bits which are set.
|
size_t
|
size_t
|
count() const
|
count() const
|
{ return this->_M_do_count(); }
|
{ return this->_M_do_count(); }
|
|
|
/// Returns the total number of bits.
|
/// Returns the total number of bits.
|
size_t
|
size_t
|
size() const
|
size() const
|
{ return _Nb; }
|
{ return _Nb; }
|
|
|
//@{
|
//@{
|
/// These comparisons for equality/inequality are, well, @e bitwise.
|
/// These comparisons for equality/inequality are, well, @e bitwise.
|
bool
|
bool
|
operator==(const bitset<_Nb>& __rhs) const
|
operator==(const bitset<_Nb>& __rhs) const
|
{ return this->_M_is_equal(__rhs); }
|
{ return this->_M_is_equal(__rhs); }
|
|
|
bool
|
bool
|
operator!=(const bitset<_Nb>& __rhs) const
|
operator!=(const bitset<_Nb>& __rhs) const
|
{ return !this->_M_is_equal(__rhs); }
|
{ return !this->_M_is_equal(__rhs); }
|
//@}
|
//@}
|
|
|
/**
|
/**
|
* @brief Tests the value of a bit.
|
* @brief Tests the value of a bit.
|
* @param position The index of a bit.
|
* @param position The index of a bit.
|
* @return The value at @a pos.
|
* @return The value at @a pos.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
* @throw std::out_of_range If @a pos is bigger the size of the %set.
|
*/
|
*/
|
bool
|
bool
|
test(size_t __position) const
|
test(size_t __position) const
|
{
|
{
|
if (__position >= _Nb)
|
if (__position >= _Nb)
|
__throw_out_of_range(__N("bitset::test"));
|
__throw_out_of_range(__N("bitset::test"));
|
return _Unchecked_test(__position);
|
return _Unchecked_test(__position);
|
}
|
}
|
|
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// DR 693. std::bitset::all() missing.
|
// DR 693. std::bitset::all() missing.
|
/**
|
/**
|
* @brief Tests whether all the bits are on.
|
* @brief Tests whether all the bits are on.
|
* @return True if all the bits are set.
|
* @return True if all the bits are set.
|
*/
|
*/
|
bool
|
bool
|
all() const
|
all() const
|
{ return this->_M_are_all_aux() == _Nb; }
|
{ return this->_M_are_all_aux() == _Nb; }
|
|
|
/**
|
/**
|
* @brief Tests whether any of the bits are on.
|
* @brief Tests whether any of the bits are on.
|
* @return True if at least one bit is set.
|
* @return True if at least one bit is set.
|
*/
|
*/
|
bool
|
bool
|
any() const
|
any() const
|
{ return this->_M_is_any(); }
|
{ return this->_M_is_any(); }
|
|
|
/**
|
/**
|
* @brief Tests whether any of the bits are on.
|
* @brief Tests whether any of the bits are on.
|
* @return True if none of the bits are set.
|
* @return True if none of the bits are set.
|
*/
|
*/
|
bool
|
bool
|
none() const
|
none() const
|
{ return !this->_M_is_any(); }
|
{ return !this->_M_is_any(); }
|
|
|
//@{
|
//@{
|
/// Self-explanatory.
|
/// Self-explanatory.
|
bitset<_Nb>
|
bitset<_Nb>
|
operator<<(size_t __position) const
|
operator<<(size_t __position) const
|
{ return bitset<_Nb>(*this) <<= __position; }
|
{ return bitset<_Nb>(*this) <<= __position; }
|
|
|
bitset<_Nb>
|
bitset<_Nb>
|
operator>>(size_t __position) const
|
operator>>(size_t __position) const
|
{ return bitset<_Nb>(*this) >>= __position; }
|
{ return bitset<_Nb>(*this) >>= __position; }
|
//@}
|
//@}
|
|
|
/**
|
/**
|
* @brief Finds the index of the first "on" bit.
|
* @brief Finds the index of the first "on" bit.
|
* @return The index of the first bit set, or size() if not found.
|
* @return The index of the first bit set, or size() if not found.
|
* @ingroup SGIextensions
|
* @ingroup SGIextensions
|
* @sa _Find_next
|
* @sa _Find_next
|
*/
|
*/
|
size_t
|
size_t
|
_Find_first() const
|
_Find_first() const
|
{ return this->_M_do_find_first(_Nb); }
|
{ return this->_M_do_find_first(_Nb); }
|
|
|
/**
|
/**
|
* @brief Finds the index of the next "on" bit after prev.
|
* @brief Finds the index of the next "on" bit after prev.
|
* @return The index of the next bit set, or size() if not found.
|
* @return The index of the next bit set, or size() if not found.
|
* @param prev Where to start searching.
|
* @param prev Where to start searching.
|
* @ingroup SGIextensions
|
* @ingroup SGIextensions
|
* @sa _Find_first
|
* @sa _Find_first
|
*/
|
*/
|
size_t
|
size_t
|
_Find_next(size_t __prev ) const
|
_Find_next(size_t __prev ) const
|
{ return this->_M_do_find_next(__prev, _Nb); }
|
{ return this->_M_do_find_next(__prev, _Nb); }
|
};
|
};
|
|
|
// Definitions of non-inline member functions.
|
// Definitions of non-inline member functions.
|
template
|
template
|
template
|
template
|
void
|
void
|
bitset<_Nb>::
|
bitset<_Nb>::
|
_M_copy_from_ptr(const _CharT* __s, size_t __len,
|
_M_copy_from_ptr(const _CharT* __s, size_t __len,
|
size_t __pos, size_t __n, _CharT __zero, _CharT __one)
|
size_t __pos, size_t __n, _CharT __zero, _CharT __one)
|
{
|
{
|
reset();
|
reset();
|
const size_t __nbits = std::min(_Nb, std::min(__n, __len - __pos));
|
const size_t __nbits = std::min(_Nb, std::min(__n, __len - __pos));
|
for (size_t __i = __nbits; __i > 0; --__i)
|
for (size_t __i = __nbits; __i > 0; --__i)
|
{
|
{
|
const _CharT __c = __s[__pos + __nbits - __i];
|
const _CharT __c = __s[__pos + __nbits - __i];
|
if (_Traits::eq(__c, __zero))
|
if (_Traits::eq(__c, __zero))
|
;
|
;
|
else if (_Traits::eq(__c, __one))
|
else if (_Traits::eq(__c, __one))
|
_Unchecked_set(__i - 1);
|
_Unchecked_set(__i - 1);
|
else
|
else
|
__throw_invalid_argument(__N("bitset::_M_copy_from_ptr"));
|
__throw_invalid_argument(__N("bitset::_M_copy_from_ptr"));
|
}
|
}
|
}
|
}
|
|
|
template
|
template
|
template
|
template
|
void
|
void
|
bitset<_Nb>::
|
bitset<_Nb>::
|
_M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
_M_copy_to_string(std::basic_string<_CharT, _Traits, _Alloc>& __s,
|
_CharT __zero, _CharT __one) const
|
_CharT __zero, _CharT __one) const
|
{
|
{
|
__s.assign(_Nb, __zero);
|
__s.assign(_Nb, __zero);
|
for (size_t __i = _Nb; __i > 0; --__i)
|
for (size_t __i = _Nb; __i > 0; --__i)
|
if (_Unchecked_test(__i - 1))
|
if (_Unchecked_test(__i - 1))
|
_Traits::assign(__s[_Nb - __i], __one);
|
_Traits::assign(__s[_Nb - __i], __one);
|
}
|
}
|
|
|
// 23.3.5.3 bitset operations:
|
// 23.3.5.3 bitset operations:
|
//@{
|
//@{
|
/**
|
/**
|
* @brief Global bitwise operations on bitsets.
|
* @brief Global bitwise operations on bitsets.
|
* @param x A bitset.
|
* @param x A bitset.
|
* @param y A bitset of the same size as @a x.
|
* @param y A bitset of the same size as @a x.
|
* @return A new bitset.
|
* @return A new bitset.
|
*
|
*
|
* These should be self-explanatory.
|
* These should be self-explanatory.
|
*/
|
*/
|
template
|
template
|
inline bitset<_Nb>
|
inline bitset<_Nb>
|
operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y)
|
operator&(const bitset<_Nb>& __x, const bitset<_Nb>& __y)
|
{
|
{
|
bitset<_Nb> __result(__x);
|
bitset<_Nb> __result(__x);
|
__result &= __y;
|
__result &= __y;
|
return __result;
|
return __result;
|
}
|
}
|
|
|
template
|
template
|
inline bitset<_Nb>
|
inline bitset<_Nb>
|
operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y)
|
operator|(const bitset<_Nb>& __x, const bitset<_Nb>& __y)
|
{
|
{
|
bitset<_Nb> __result(__x);
|
bitset<_Nb> __result(__x);
|
__result |= __y;
|
__result |= __y;
|
return __result;
|
return __result;
|
}
|
}
|
|
|
template
|
template
|
inline bitset<_Nb>
|
inline bitset<_Nb>
|
operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y)
|
operator^(const bitset<_Nb>& __x, const bitset<_Nb>& __y)
|
{
|
{
|
bitset<_Nb> __result(__x);
|
bitset<_Nb> __result(__x);
|
__result ^= __y;
|
__result ^= __y;
|
return __result;
|
return __result;
|
}
|
}
|
//@}
|
//@}
|
|
|
//@{
|
//@{
|
/**
|
/**
|
* @brief Global I/O operators for bitsets.
|
* @brief Global I/O operators for bitsets.
|
*
|
*
|
* Direct I/O between streams and bitsets is supported. Output is
|
* Direct I/O between streams and bitsets is supported. Output is
|
* straightforward. Input will skip whitespace, only accept @a 0 and @a 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
|
* characters, and will only extract as many digits as the %bitset will
|
* hold.
|
* hold.
|
*/
|
*/
|
template
|
template
|
std::basic_istream<_CharT, _Traits>&
|
std::basic_istream<_CharT, _Traits>&
|
operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
|
operator>>(std::basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
|
{
|
{
|
typedef typename _Traits::char_type char_type;
|
typedef typename _Traits::char_type char_type;
|
typedef std::basic_istream<_CharT, _Traits> __istream_type;
|
typedef std::basic_istream<_CharT, _Traits> __istream_type;
|
typedef typename __istream_type::ios_base __ios_base;
|
typedef typename __istream_type::ios_base __ios_base;
|
|
|
std::basic_string<_CharT, _Traits> __tmp;
|
std::basic_string<_CharT, _Traits> __tmp;
|
__tmp.reserve(_Nb);
|
__tmp.reserve(_Nb);
|
|
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// 303. Bitset input operator underspecified
|
// 303. Bitset input operator underspecified
|
const char_type __zero = __is.widen('0');
|
const char_type __zero = __is.widen('0');
|
const char_type __one = __is.widen('1');
|
const char_type __one = __is.widen('1');
|
|
|
typename __ios_base::iostate __state = __ios_base::goodbit;
|
typename __ios_base::iostate __state = __ios_base::goodbit;
|
typename __istream_type::sentry __sentry(__is);
|
typename __istream_type::sentry __sentry(__is);
|
if (__sentry)
|
if (__sentry)
|
{
|
{
|
__try
|
__try
|
{
|
{
|
for (size_t __i = _Nb; __i > 0; --__i)
|
for (size_t __i = _Nb; __i > 0; --__i)
|
{
|
{
|
static typename _Traits::int_type __eof = _Traits::eof();
|
static typename _Traits::int_type __eof = _Traits::eof();
|
|
|
typename _Traits::int_type __c1 = __is.rdbuf()->sbumpc();
|
typename _Traits::int_type __c1 = __is.rdbuf()->sbumpc();
|
if (_Traits::eq_int_type(__c1, __eof))
|
if (_Traits::eq_int_type(__c1, __eof))
|
{
|
{
|
__state |= __ios_base::eofbit;
|
__state |= __ios_base::eofbit;
|
break;
|
break;
|
}
|
}
|
else
|
else
|
{
|
{
|
const char_type __c2 = _Traits::to_char_type(__c1);
|
const char_type __c2 = _Traits::to_char_type(__c1);
|
if (_Traits::eq(__c2, __zero))
|
if (_Traits::eq(__c2, __zero))
|
__tmp.push_back(__zero);
|
__tmp.push_back(__zero);
|
else if (_Traits::eq(__c2, __one))
|
else if (_Traits::eq(__c2, __one))
|
__tmp.push_back(__one);
|
__tmp.push_back(__one);
|
else if (_Traits::
|
else if (_Traits::
|
eq_int_type(__is.rdbuf()->sputbackc(__c2),
|
eq_int_type(__is.rdbuf()->sputbackc(__c2),
|
__eof))
|
__eof))
|
{
|
{
|
__state |= __ios_base::failbit;
|
__state |= __ios_base::failbit;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
__catch(__cxxabiv1::__forced_unwind&)
|
__catch(__cxxabiv1::__forced_unwind&)
|
{
|
{
|
__is._M_setstate(__ios_base::badbit);
|
__is._M_setstate(__ios_base::badbit);
|
__throw_exception_again;
|
__throw_exception_again;
|
}
|
}
|
__catch(...)
|
__catch(...)
|
{ __is._M_setstate(__ios_base::badbit); }
|
{ __is._M_setstate(__ios_base::badbit); }
|
}
|
}
|
|
|
if (__tmp.empty() && _Nb)
|
if (__tmp.empty() && _Nb)
|
__state |= __ios_base::failbit;
|
__state |= __ios_base::failbit;
|
else
|
else
|
__x._M_copy_from_string(__tmp, static_cast(0), _Nb,
|
__x._M_copy_from_string(__tmp, static_cast(0), _Nb,
|
__zero, __one);
|
__zero, __one);
|
if (__state)
|
if (__state)
|
__is.setstate(__state);
|
__is.setstate(__state);
|
return __is;
|
return __is;
|
}
|
}
|
|
|
template
|
template
|
std::basic_ostream<_CharT, _Traits>&
|
std::basic_ostream<_CharT, _Traits>&
|
operator<<(std::basic_ostream<_CharT, _Traits>& __os,
|
operator<<(std::basic_ostream<_CharT, _Traits>& __os,
|
const bitset<_Nb>& __x)
|
const bitset<_Nb>& __x)
|
{
|
{
|
std::basic_string<_CharT, _Traits> __tmp;
|
std::basic_string<_CharT, _Traits> __tmp;
|
|
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// _GLIBCXX_RESOLVE_LIB_DEFECTS
|
// 396. what are characters zero and one.
|
// 396. what are characters zero and one.
|
const ctype<_CharT>& __ct = use_facet >(__os.getloc());
|
const ctype<_CharT>& __ct = use_facet >(__os.getloc());
|
__x._M_copy_to_string(__tmp, __ct.widen('0'), __ct.widen('1'));
|
__x._M_copy_to_string(__tmp, __ct.widen('0'), __ct.widen('1'));
|
return __os << __tmp;
|
return __os << __tmp;
|
}
|
}
|
//@}
|
//@}
|
|
|
_GLIBCXX_END_NESTED_NAMESPACE
|
_GLIBCXX_END_NESTED_NAMESPACE
|
|
|
#undef _GLIBCXX_BITSET_WORDS
|
#undef _GLIBCXX_BITSET_WORDS
|
#undef _GLIBCXX_BITSET_BITS_PER_WORD
|
#undef _GLIBCXX_BITSET_BITS_PER_WORD
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
|
|
#include
|
#include
|
|
|
_GLIBCXX_BEGIN_NAMESPACE(std)
|
_GLIBCXX_BEGIN_NAMESPACE(std)
|
|
|
// DR 1182.
|
// DR 1182.
|
/// std::hash specialization for bitset.
|
/// std::hash specialization for bitset.
|
template
|
template
|
struct hash<_GLIBCXX_STD_D::bitset<_Nb>>
|
struct hash<_GLIBCXX_STD_D::bitset<_Nb>>
|
: public std::unary_function<_GLIBCXX_STD_D::bitset<_Nb>, size_t>
|
: public std::unary_function<_GLIBCXX_STD_D::bitset<_Nb>, size_t>
|
{
|
{
|
size_t
|
size_t
|
operator()(const _GLIBCXX_STD_D::bitset<_Nb>& __b) const
|
operator()(const _GLIBCXX_STD_D::bitset<_Nb>& __b) const
|
{
|
{
|
const size_t __clength = (_Nb + __CHAR_BIT__ - 1) / __CHAR_BIT__;
|
const size_t __clength = (_Nb + __CHAR_BIT__ - 1) / __CHAR_BIT__;
|
return std::_Fnv_hash::hash(__b._M_getdata(), __clength);
|
return std::_Fnv_hash::hash(__b._M_getdata(), __clength);
|
}
|
}
|
};
|
};
|
|
|
template<>
|
template<>
|
struct hash<_GLIBCXX_STD_D::bitset<0>>
|
struct hash<_GLIBCXX_STD_D::bitset<0>>
|
: public std::unary_function<_GLIBCXX_STD_D::bitset<0>, size_t>
|
: public std::unary_function<_GLIBCXX_STD_D::bitset<0>, size_t>
|
{
|
{
|
size_t
|
size_t
|
operator()(const _GLIBCXX_STD_D::bitset<0>&) const
|
operator()(const _GLIBCXX_STD_D::bitset<0>&) const
|
{ return 0; }
|
{ return 0; }
|
};
|
};
|
|
|
_GLIBCXX_END_NAMESPACE
|
_GLIBCXX_END_NAMESPACE
|
|
|
#endif // __GXX_EXPERIMENTAL_CXX0X__
|
#endif // __GXX_EXPERIMENTAL_CXX0X__
|
|
|
#ifdef _GLIBCXX_DEBUG
|
#ifdef _GLIBCXX_DEBUG
|
# include
|
# include
|
#endif
|
#endif
|
|
|
#ifdef _GLIBCXX_PROFILE
|
#ifdef _GLIBCXX_PROFILE
|
# include
|
# include
|
#endif
|
#endif
|
|
|
#endif /* _GLIBCXX_BITSET */
|
#endif /* _GLIBCXX_BITSET */
|
|
|
