.TH "std::tr2::dynamic_bitset< _WordT, _Alloc >" 3cxx "Sun Jan 6 2013" "libstdc++" \" -*- nroff -*- .ad l .nh .SH NAME std::tr2::dynamic_bitset< _WordT, _Alloc > \- .SH SYNOPSIS .br .PP .PP Inherits \fBstd::tr2::__dynamic_bitset_base< _WordT, _Alloc >\fP\&. .SS "Classes" .in +1c .ti -1c .RI "class \fBreference\fP" .br .in -1c .SS "Public Types" .in +1c .ti -1c .RI "typedef \fB__dynamic_bitset_base\fP .br < _WordT, _Alloc > \fB_Base\fP" .br .ti -1c .RI "typedef _Alloc \fBallocator_type\fP" .br .ti -1c .RI "typedef _WordT \fBblock_type\fP" .br .ti -1c .RI "typedef bool \fBconst_reference\fP" .br .ti -1c .RI "typedef size_t \fBsize_type\fP" .br .in -1c .SS "Public Member Functions" .in +1c .ti -1c .RI "\fBdynamic_bitset\fP (const allocator_type &__alloc=allocator_type())" .br .ti -1c .RI "\fBdynamic_bitset\fP (size_type __nbits, unsigned long long __val=0ULL, const allocator_type &__alloc=allocator_type())" .br .ti -1c .RI "\fBdynamic_bitset\fP (\fBinitializer_list\fP< block_type > __il, const allocator_type &__alloc=allocator_type())" .br .ti -1c .RI "template \fBdynamic_bitset\fP (const \fBstd::basic_string\fP< _CharT, _Traits, _Alloc1 > &__str, typename \fBbasic_string\fP< _CharT, _Traits, _Alloc1 >::size_type __pos=0, typename \fBbasic_string\fP< _CharT, _Traits, _Alloc1 >::size_type __n=\fBstd::basic_string\fP< _CharT, _Traits, _Alloc1 >::npos, _CharT __zero=_CharT('0'), _CharT __one=_CharT('1'), const allocator_type &__alloc=allocator_type())" .br .ti -1c .RI "\fBdynamic_bitset\fP (const char *__str, const allocator_type &__alloc=allocator_type())" .br .ti -1c .RI "\fBdynamic_bitset\fP (const \fBdynamic_bitset\fP &__b)" .br .ti -1c .RI "\fBdynamic_bitset\fP (\fBdynamic_bitset\fP &&__b)" .br .ti -1c .RI "template void \fB_M_copy_from_ptr\fP (const _CharT *, size_t, size_t, size_t, _CharT, _CharT)" .br .ti -1c .RI "template void \fB_M_copy_from_string\fP (const \fBstd::basic_string\fP< _CharT, _Traits, _Alloc1 > &__str, size_t __pos, size_t __n, _CharT __zero=_CharT('0'), _CharT __one=_CharT('1'))" .br .ti -1c .RI "template void \fB_M_copy_to_string\fP (\fBstd::basic_string\fP< _CharT, _Traits, _Alloc1 > &__str, _CharT __zero=_CharT('0'), _CharT __one=_CharT('1')) const " .br .ti -1c .RI "bool \fBall\fP () const " .br .ti -1c .RI "bool \fBany\fP () const " .br .ti -1c .RI "void \fBappend\fP (block_type __block)" .br .ti -1c .RI "void \fBappend\fP (\fBinitializer_list\fP< block_type > __il)" .br .ti -1c .RI "template void \fBappend\fP (_BlockInputIterator __first, _BlockInputIterator __last)" .br .ti -1c .RI "void \fBclear\fP ()" .br .ti -1c .RI "size_type \fBcount\fP () const " .br .ti -1c .RI "bool \fBempty\fP () const " .br .ti -1c .RI "size_type \fBfind_first\fP () const " .br .ti -1c .RI "size_type \fBfind_next\fP (size_t __prev) const " .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBflip\fP ()" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBflip\fP (size_type __pos)" .br .ti -1c .RI "allocator_type \fBget_allocator\fP () const " .br .ti -1c .RI "bool \fBis_proper_subset_of\fP (const \fBdynamic_bitset\fP &__b) const " .br .ti -1c .RI "bool \fBis_subset_of\fP (const \fBdynamic_bitset\fP &__b) const " .br .ti -1c .RI "size_type \fBmax_size\fP () const " .br .ti -1c .RI "bool \fBnone\fP () const " .br .ti -1c .RI "size_type \fBnum_blocks\fP () const " .br .ti -1c .RI "\fBdynamic_bitset\fP & \fBoperator=\fP (const \fBdynamic_bitset\fP &__b)" .br .ti -1c .RI "\fBdynamic_bitset\fP & \fBoperator=\fP (\fBdynamic_bitset\fP &&__b)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > \fBoperator~\fP () const " .br .ti -1c .RI "void \fBpush_back\fP (bool __bit)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBreset\fP ()" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBreset\fP (size_type __pos)" .br .ti -1c .RI "void \fBresize\fP (size_type __nbits, bool __value=false)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBset\fP ()" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBset\fP (size_type __pos, bool __val=true)" .br .ti -1c .RI "size_type \fBsize\fP () const " .br .ti -1c .RI "void \fBswap\fP (\fBdynamic_bitset\fP &__b)" .br .ti -1c .RI "bool \fBtest\fP (size_type __pos) const " .br .ti -1c .RI "template, typename _Alloc1 = std::allocator<_CharT>> \fBstd::basic_string\fP< _CharT, .br _Traits, _Alloc1 > \fBto_string\fP (_CharT __zero=_CharT('0'), _CharT __one=_CharT('1')) const " .br .ti -1c .RI "unsigned long long \fBto_ullong\fP () const " .br .ti -1c .RI "unsigned long \fBto_ulong\fP () const " .br .in -1c .PP .RI "\fB\fP" .br .in +1c .in +1c .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBoperator&=\fP (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBoperator&=\fP (\fBdynamic_bitset\fP< _WordT, _Alloc > &&__rhs)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBoperator|=\fP (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBoperator^=\fP (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBoperator-=\fP (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)" .br .in -1c .in -1c .PP .RI "\fB\fP" .br .in +1c .in +1c .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBoperator<<=\fP (size_type __pos)" .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > & \fBoperator>>=\fP (size_type __pos)" .br .in -1c .in -1c .PP .RI "\fB\fP" .br .in +1c .in +1c .ti -1c .RI "\fBreference\fP \fBoperator[]\fP (size_type __pos)" .br .ti -1c .RI "const_reference \fBoperator[]\fP (size_type __pos) const " .br .in -1c .in -1c .PP .RI "\fB\fP" .br .in +1c .in +1c .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > \fBoperator<<\fP (size_type __pos) const " .br .ti -1c .RI "\fBdynamic_bitset\fP< _WordT, _Alloc > \fBoperator>>\fP (size_type __pos) const " .br .in -1c .in -1c .SS "Static Public Attributes" .in +1c .ti -1c .RI "static const size_type \fBbits_per_block\fP" .br .ti -1c .RI "static const size_type \fBnpos\fP" .br .in -1c .SS "Private Member Functions" .in +1c .ti -1c .RI "size_t \fB_M_are_all_aux\fP () const " .br .ti -1c .RI "void \fB_M_assign\fP (const \fB__dynamic_bitset_base\fP &__b)" .br .ti -1c .RI "void \fB_M_clear\fP ()" .br .ti -1c .RI "void \fB_M_do_and\fP (const \fB__dynamic_bitset_base\fP &__x)" .br .ti -1c .RI "void \fB_M_do_append_block\fP (block_type __block, size_type __pos)" .br .ti -1c .RI "size_t \fB_M_do_count\fP () const " .br .ti -1c .RI "void \fB_M_do_dif\fP (const \fB__dynamic_bitset_base\fP &__x)" .br .ti -1c .RI "size_type \fB_M_do_find_first\fP (size_t __not_found) const " .br .ti -1c .RI "size_type \fB_M_do_find_next\fP (size_t __prev, size_t __not_found) const " .br .ti -1c .RI "void \fB_M_do_flip\fP ()" .br .ti -1c .RI "void \fB_M_do_left_shift\fP (size_t __shift)" .br .ti -1c .RI "void \fB_M_do_or\fP (const \fB__dynamic_bitset_base\fP &__x)" .br .ti -1c .RI "void \fB_M_do_reset\fP ()" .br .ti -1c .RI "void \fB_M_do_right_shift\fP (size_t __shift)" .br .ti -1c .RI "void \fB_M_do_set\fP ()" .br .ti -1c .RI "unsigned long long \fB_M_do_to_ullong\fP () const " .br .ti -1c .RI "unsigned long \fB_M_do_to_ulong\fP () const " .br .ti -1c .RI "void \fB_M_do_xor\fP (const \fB__dynamic_bitset_base\fP &__x)" .br .ti -1c .RI "allocator_type \fB_M_get_allocator\fP () const " .br .ti -1c .RI "block_type & \fB_M_getword\fP (size_type __pos)" .br .ti -1c .RI "block_type \fB_M_getword\fP (size_type __pos) const " .br .ti -1c .RI "block_type & \fB_M_hiword\fP ()" .br .ti -1c .RI "block_type \fB_M_hiword\fP () const " .br .ti -1c .RI "bool \fB_M_is_any\fP () const " .br .ti -1c .RI "bool \fB_M_is_equal\fP (const \fB__dynamic_bitset_base\fP &__x) const " .br .ti -1c .RI "bool \fB_M_is_less\fP (const \fB__dynamic_bitset_base\fP &__x) const " .br .ti -1c .RI "bool \fB_M_is_proper_subset_of\fP (const \fB__dynamic_bitset_base\fP &__b) const " .br .ti -1c .RI "bool \fB_M_is_subset_of\fP (const \fB__dynamic_bitset_base\fP &__b)" .br .ti -1c .RI "void \fB_M_resize\fP (size_t __nbits, bool __value)" .br .ti -1c .RI "size_type \fB_M_size\fP () const " .br .ti -1c .RI "void \fB_M_swap\fP (\fB__dynamic_bitset_base\fP &__b)" .br .in -1c .SS "Static Private Member Functions" .in +1c .ti -1c .RI "static block_type \fB_S_maskbit\fP (size_type __pos)" .br .ti -1c .RI "static size_type \fB_S_whichbit\fP (size_type __pos)" .br .ti -1c .RI "static size_type \fB_S_whichbyte\fP (size_type __pos)" .br .ti -1c .RI "static size_type \fB_S_whichword\fP (size_type __pos)" .br .in -1c .SS "Private Attributes" .in +1c .ti -1c .RI "\fBstd::vector\fP< block_type, .br allocator_type > \fB_M_w\fP" .br .in -1c .SS "Static Private Attributes" .in +1c .ti -1c .RI "static const size_type \fB_S_bits_per_block\fP" .br .in -1c .SS "Friends" .in +1c .ti -1c .RI "class \fBreference\fP" .br .in -1c .SH "Detailed Description" .PP .SS "template>class std::tr2::dynamic_bitset< _WordT, _Alloc >" The dynamic_bitset class represents a sequence of bits\&. (Note that dynamic_bitset does \fInot\fP meet the formal requirements of a \fCcontainer\fP\&. Mainly, it lacks iterators\&.) .PP The template argument, \fINb\fP, may be any non-negative number, specifying the number of bits (e\&.g\&., '0', '12', '1024*1024')\&. .PP 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 words will be used for storage\&. B - NbB bits are unused\&. (They are the high-order bits in the highest word\&.) It is a class invariant that those unused bits are always zero\&. .PP If you think of dynamic_bitset as 'a simple array of bits,' be aware that your mental picture is reversed: a dynamic_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 dynamic_bitset's index 'counts from right to left,' to put it very loosely\&. .PP 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\&. .PP .PP .nf #include #include #include using namespace std; int main() { long a = 'a'; dynamic_bitset b(a); cout << 'b('a') is ' << b << endl; ostringstream s; s << b; string str = s\&.str(); cout << 'index 3 in the string is ' << str[3] << ' but\n' << 'index 3 in the bitset is ' << b[3] << endl; } .fi .PP .PP Also see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt12ch33s02.html for a description of extensions\&. .PP Most of the actual code isn't contained in dynamic_bitset<> itself, but in the base class \fB__dynamic_bitset_base\fP\&. The base class works with whole words, not with individual bits\&. This allows us to specialize \fB__dynamic_bitset_base\fP for the important special case where the dynamic_bitset is only a single word\&. .PP Extra confusion can result due to the fact that the storage for \fB__dynamic_bitset_base\fP \fIis\fP a vector, and is indexed as such\&. This is carefully encapsulated\&. .PP Definition at line 570 of file dynamic_bitset\&. .SH "Constructor & Destructor Documentation" .PP .SS "template> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBdynamic_bitset\fP (const allocator_type &__alloc = \fCallocator_type()\fP)\fC [inline]\fP, \fC [explicit]\fP" .PP All bits set to zero\&. .PP Definition at line 722 of file dynamic_bitset\&. .SS "template> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBdynamic_bitset\fP (size_type__nbits, unsigned long long__val = \fC0ULL\fP, const allocator_type &__alloc = \fCallocator_type()\fP)\fC [inline]\fP, \fC [explicit]\fP" .PP Initial bits bitwise-copied from a single word (others set to zero)\&. .PP Definition at line 728 of file dynamic_bitset\&. .SS "template> template \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBdynamic_bitset\fP (const \fBstd::basic_string\fP< _CharT, _Traits, _Alloc1 > &__str, typename \fBbasic_string\fP< _CharT, _Traits, _Alloc1 >::size_type__pos = \fC0\fP, typename \fBbasic_string\fP< _CharT, _Traits, _Alloc1 >::size_type__n = \fC\fBstd::basic_string\fP<_CharT, _Traits, _Alloc1>::npos\fP, _CharT__zero = \fC_CharT('0')\fP, _CharT__one = \fC_CharT('1')\fP, const allocator_type &__alloc = \fCallocator_type()\fP)\fC [inline]\fP, \fC [explicit]\fP" .PP Use a subset of a string\&. \fBParameters:\fP .RS 4 \fI__str\fP A string of '0' and '1' characters\&. .br \fI__pos\fP Index of the first character in \fC__str\fP to use\&. .br \fI__n\fP The number of characters to copy\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::out_of_range\fP\fP If \fC__pos\fP is bigger the size of \fC__str\fP\&. .br \fI\fBstd::invalid_argument\fP\fP If a character appears in the string which is neither '0' nor '1'\&. .RE .PP .PP Definition at line 750 of file dynamic_bitset\&. .PP References std::tr2::dynamic_bitset< _WordT, _Alloc >::resize(), and std::basic_string< _CharT, _Traits, _Alloc >::size()\&. .SS "template> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBdynamic_bitset\fP (const char *__str, const allocator_type &__alloc = \fCallocator_type()\fP)\fC [inline]\fP, \fC [explicit]\fP" .PP Construct from a string\&. \fBParameters:\fP .RS 4 \fI__str\fP A string of '0' and '1' characters\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::invalid_argument\fP\fP If a character appears in the string which is neither '0' nor '1'\&. .RE .PP .PP Definition at line 778 of file dynamic_bitset\&. .PP References std::tr2::dynamic_bitset< _WordT, _Alloc >::resize()\&. .SS "template> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBdynamic_bitset\fP (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__b)\fC [inline]\fP" .PP Copy constructor\&. .PP Definition at line 794 of file dynamic_bitset\&. .SS "template> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBdynamic_bitset\fP (\fBdynamic_bitset\fP< _WordT, _Alloc > &&__b)\fC [inline]\fP" .PP Move constructor\&. .PP Definition at line 801 of file dynamic_bitset\&. .SH "Member Function Documentation" .PP .SS "template> bool \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::all () const\fC [inline]\fP" .PP Tests whether all the bits are on\&. \fBReturns:\fP .RS 4 True if all the bits are set\&. .RE .PP .PP Definition at line 1187 of file dynamic_bitset\&. .SS "template> bool \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::any () const\fC [inline]\fP" .PP Tests whether any of the bits are on\&. \fBReturns:\fP .RS 4 True if at least one bit is set\&. .RE .PP .PP Definition at line 1195 of file dynamic_bitset\&. .SS "template> void \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::append (block_type__block)\fC [inline]\fP" .PP Append a block\&. .PP Definition at line 882 of file dynamic_bitset\&. .PP Referenced by std::tr2::dynamic_bitset< _WordT, _Alloc >::append()\&. .SS "template> template void \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::append (_BlockInputIterator__first, _BlockInputIterator__last)\fC [inline]\fP" .PP Append an iterator range of blocks\&. .PP Definition at line 900 of file dynamic_bitset\&. .PP References std::tr2::dynamic_bitset< _WordT, _Alloc >::append()\&. .SS "template> void \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::clear ()\fC [inline]\fP" .PP Clear the bitset\&. .PP Definition at line 860 of file dynamic_bitset\&. .SS "template> size_type \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::count () const\fC [inline]\fP" .PP Returns the number of bits which are set\&. .PP Definition at line 1144 of file dynamic_bitset\&. .SS "template> bool \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::empty () const\fC [inline]\fP" .PP Returns true if the \fBdynamic_bitset\fP is empty\&. .PP Definition at line 1158 of file dynamic_bitset\&. .SS "template> size_type \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::find_first () const\fC [inline]\fP" .PP Finds the index of the first 'on' bit\&. \fBReturns:\fP .RS 4 The index of the first bit set, or \fBsize()\fP if not found\&. .RE .PP \fBSee Also:\fP .RS 4 \fBfind_next\fP .RE .PP .PP Definition at line 1223 of file dynamic_bitset\&. .SS "template> size_type \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::find_next (size_t__prev) const\fC [inline]\fP" .PP Finds the index of the next 'on' bit after prev\&. \fBReturns:\fP .RS 4 The index of the next bit set, or \fBsize()\fP if not found\&. .RE .PP \fBParameters:\fP .RS 4 \fI__prev\fP Where to start searching\&. .RE .PP \fBSee Also:\fP .RS 4 \fBfind_first\fP .RE .PP .PP Definition at line 1233 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::flip ()\fC [inline]\fP" .PP Toggles every bit to its opposite value\&. .PP Definition at line 1039 of file dynamic_bitset\&. .PP Referenced by std::tr2::dynamic_bitset< _WordT, _Alloc >::operator~()\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::flip (size_type__pos)\fC [inline]\fP" .PP Toggles a given bit to its opposite value\&. \fBParameters:\fP .RS 4 \fI__pos\fP The index of the bit\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::out_of_range\fP\fP If \fI__pos\fP is bigger the size of the set\&. .RE .PP .PP Definition at line 1052 of file dynamic_bitset\&. .SS "template> allocator_type \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::get_allocator () const\fC [inline]\fP" .PP Return the allocator for the bitset\&. .PP Definition at line 842 of file dynamic_bitset\&. .SS "template> size_type \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::max_size () const\fC [inline]\fP" .PP Returns the maximum size of a \fBdynamic_bitset\fP object having the same type as *this\&. The real answer is \fBmax()\fP * bits_per_block but is likely to overflow\&. .PP Definition at line 1165 of file dynamic_bitset\&. .PP References std::numeric_limits< _Tp >::max()\&. .SS "template> bool \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::none () const\fC [inline]\fP" .PP Tests whether any of the bits are on\&. \fBReturns:\fP .RS 4 True if none of the bits are set\&. .RE .PP .PP Definition at line 1203 of file dynamic_bitset\&. .SS "template> size_type \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::num_blocks () const\fC [inline]\fP" .PP Returns the total number of blocks\&. .PP Definition at line 1153 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator&= (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)\fC [inline]\fP" .PP Operations on dynamic_bitsets\&. \fBParameters:\fP .RS 4 \fI__rhs\fP A same-sized \fBdynamic_bitset\fP\&. .RE .PP These should be self-explanatory\&. .PP Definition at line 915 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator&= (\fBdynamic_bitset\fP< _WordT, _Alloc > &&__rhs)\fC [inline]\fP" .PP Operations on dynamic_bitsets\&. \fBParameters:\fP .RS 4 \fI__rhs\fP A same-sized \fBdynamic_bitset\fP\&. .RE .PP These should be self-explanatory\&. .PP Definition at line 922 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator-= (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)\fC [inline]\fP" .PP Operations on dynamic_bitsets\&. \fBParameters:\fP .RS 4 \fI__rhs\fP A same-sized \fBdynamic_bitset\fP\&. .RE .PP These should be self-explanatory\&. .PP Definition at line 943 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator<< (size_type__pos) const\fC [inline]\fP" .PP Self-explanatory\&. .PP Definition at line 1209 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator<<= (size_type__pos)\fC [inline]\fP" .PP Operations on dynamic_bitsets\&. \fBParameters:\fP .RS 4 \fI__pos\fP The number of places to shift\&. .RE .PP These should be self-explanatory\&. .PP Definition at line 958 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator= (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__b)\fC [inline]\fP" .PP Assignment\&. .PP Definition at line 819 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator= (\fBdynamic_bitset\fP< _WordT, _Alloc > &&__b)\fC [inline]\fP" .PP Move assignment\&. .PP Definition at line 832 of file dynamic_bitset\&. .PP References std::tr2::dynamic_bitset< _WordT, _Alloc >::swap()\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator>> (size_type__pos) const\fC [inline]\fP" .PP Self-explanatory\&. .PP Definition at line 1213 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator>>= (size_type__pos)\fC [inline]\fP" .PP Operations on dynamic_bitsets\&. \fBParameters:\fP .RS 4 \fI__pos\fP The number of places to shift\&. .RE .PP These should be self-explanatory\&. .PP Definition at line 971 of file dynamic_bitset\&. .SS "template> \fBreference\fP \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator[] (size_type__pos)\fC [inline]\fP" .PP Array-indexing support\&. \fBParameters:\fP .RS 4 \fI__pos\fP Index into the dynamic_bitset\&. .RE .PP \fBReturns:\fP .RS 4 A bool for a 'const dynamic_bitset'\&. For non-const bitsets, an instance of the reference proxy class\&. .RE .PP \fBNote:\fP .RS 4 These operators do no range checking and throw no exceptions, as required by DR 11 to the standard\&. .RE .PP .PP Definition at line 1074 of file dynamic_bitset\&. .SS "template> const_reference \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator[] (size_type__pos) const\fC [inline]\fP" .PP Array-indexing support\&. \fBParameters:\fP .RS 4 \fI__pos\fP Index into the dynamic_bitset\&. .RE .PP \fBReturns:\fP .RS 4 A bool for a 'const dynamic_bitset'\&. For non-const bitsets, an instance of the reference proxy class\&. .RE .PP \fBNote:\fP .RS 4 These operators do no range checking and throw no exceptions, as required by DR 11 to the standard\&. .RE .PP .PP Definition at line 1078 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator^= (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)\fC [inline]\fP" .PP Operations on dynamic_bitsets\&. \fBParameters:\fP .RS 4 \fI__rhs\fP A same-sized \fBdynamic_bitset\fP\&. .RE .PP These should be self-explanatory\&. .PP Definition at line 936 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator|= (const \fBdynamic_bitset\fP< _WordT, _Alloc > &__rhs)\fC [inline]\fP" .PP Operations on dynamic_bitsets\&. \fBParameters:\fP .RS 4 \fI__rhs\fP A same-sized \fBdynamic_bitset\fP\&. .RE .PP These should be self-explanatory\&. .PP Definition at line 929 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::operator~ () const\fC [inline]\fP" .PP See the no-argument \fBflip()\fP\&. .PP Definition at line 1061 of file dynamic_bitset\&. .PP References std::tr2::dynamic_bitset< _WordT, _Alloc >::flip()\&. .SS "template> void \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::push_back (bool__bit)\fC [inline]\fP" .PP Push a bit onto the high end of the bitset\&. .PP Definition at line 870 of file dynamic_bitset\&. .PP References std::tr2::dynamic_bitset< _WordT, _Alloc >::size()\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::reset ()\fC [inline]\fP" .PP Sets every bit to false\&. .PP Definition at line 1014 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::reset (size_type__pos)\fC [inline]\fP" .PP Sets a given bit to false\&. \fBParameters:\fP .RS 4 \fI__pos\fP The index of the bit\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::out_of_range\fP\fP If \fI__pos\fP is bigger the size of the set\&. .RE .PP Same as writing \fCset(__pos, false)\fP\&. .PP Definition at line 1028 of file dynamic_bitset\&. .SS "template> void \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::resize (size_type__nbits, bool__value = \fCfalse\fP)\fC [inline]\fP" .PP Resize the bitset\&. .PP Definition at line 849 of file dynamic_bitset\&. .PP Referenced by std::tr2::dynamic_bitset< _WordT, _Alloc >::dynamic_bitset(), and std::tr2::operator>>()\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBset\fP ()\fC [inline]\fP" .PP Sets every bit to true\&. .PP Definition at line 989 of file dynamic_bitset\&. .SS "template> \fBdynamic_bitset\fP<_WordT, _Alloc>& \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::\fBset\fP (size_type__pos, bool__val = \fCtrue\fP)\fC [inline]\fP" .PP Sets a given bit to a particular value\&. \fBParameters:\fP .RS 4 \fI__pos\fP The index of the bit\&. .br \fI__val\fP Either true or false, defaults to true\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::out_of_range\fP\fP If \fI__pos\fP is bigger the size of the set\&. .RE .PP .PP Definition at line 1003 of file dynamic_bitset\&. .SS "template> size_type \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::size () const\fC [inline]\fP" .PP Returns the total number of bits\&. .PP Definition at line 1149 of file dynamic_bitset\&. .PP Referenced by std::tr2::operator>>(), and std::tr2::dynamic_bitset< _WordT, _Alloc >::push_back()\&. .SS "template> void \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::swap (\fBdynamic_bitset\fP< _WordT, _Alloc > &__b)\fC [inline]\fP" .PP Swap with another bitset\&. .PP Definition at line 809 of file dynamic_bitset\&. .PP Referenced by std::tr2::dynamic_bitset< _WordT, _Alloc >::operator=()\&. .SS "template> bool \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::test (size_type__pos) const\fC [inline]\fP" .PP Tests the value of a bit\&. \fBParameters:\fP .RS 4 \fI__pos\fP The index of a bit\&. .RE .PP \fBReturns:\fP .RS 4 The value at \fI__pos\fP\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::out_of_range\fP\fP If \fI__pos\fP is bigger the size of the set\&. .RE .PP .PP Definition at line 1175 of file dynamic_bitset\&. .SS "template> template, typename _Alloc1 = std::allocator<_CharT>> \fBstd::basic_string\fP<_CharT, _Traits, _Alloc1> \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::to_string (_CharT__zero = \fC_CharT('0')\fP, _CharT__one = \fC_CharT('1')\fP) const\fC [inline]\fP" .PP Returns a character interpretation of the dynamic_bitset\&. \fBReturns:\fP .RS 4 The string equivalent of the bits\&. .RE .PP Note the ordering of the bits: decreasing character positions correspond to increasing bit positions (see the main class notes for an example)\&. .PP Definition at line 1114 of file dynamic_bitset\&. .SS "template> unsigned long long \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::to_ullong () const\fC [inline]\fP" .PP Returns a numerical interpretation of the dynamic_bitset\&. \fBReturns:\fP .RS 4 The integral equivalent of the bits\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::overflow_error\fP\fP If there are too many bits to be represented in an \fCunsigned\fP \fClong\fP\&. .RE .PP .PP Definition at line 1099 of file dynamic_bitset\&. .SS "template> unsigned long \fBstd::tr2::dynamic_bitset\fP< _WordT, _Alloc >::to_ulong () const\fC [inline]\fP" .PP Returns a numerical interpretation of the dynamic_bitset\&. \fBReturns:\fP .RS 4 The integral equivalent of the bits\&. .RE .PP \fBExceptions:\fP .RS 4 \fI\fBstd::overflow_error\fP\fP If there are too many bits to be represented in an \fCunsigned\fP \fClong\fP\&. .RE .PP .PP Definition at line 1089 of file dynamic_bitset\&. .SH "Author" .PP Generated automatically by Doxygen for libstdc++ from the source code\&.