mirror of
https://github.com/boostorg/dynamic_bitset.git
synced 2026-01-24 18:02:09 +00:00
Compare commits
1 Commits
boost-1.36
...
boost-1.35
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
0cc2c1a773 |
@@ -1064,7 +1064,10 @@ dynamic_bitset <a name=
|
||||
<b>Returns:</b> a copy of <tt>*this</tt> shifted to the left by
|
||||
<tt>n</tt> bits. For each bit in the returned bitset, the bit at
|
||||
position pos takes on the value of the bit at position <tt>pos -
|
||||
n</tt> of this bitset, or zero if no such bit exists.<br>
|
||||
n</tt> of this bitset, or zero if no such bit exists. Note that
|
||||
the expression <tt>b << n</tt> is equivalent to
|
||||
constructing a temporary copy of <tt>b</tt> and then using
|
||||
<tt>operator<<=</tt>.<br>
|
||||
<b>Throws:</b> An allocation error if memory is exhausted
|
||||
(<tt>std::bad_alloc</tt> if <tt>Allocator=std::allocator</tt>).
|
||||
|
||||
@@ -1077,7 +1080,10 @@ dynamic_bitset <a name=
|
||||
<b>Returns:</b> a copy of <tt>*this</tt> shifted to the right by
|
||||
<tt>n</tt> bits. For each bit in the returned bitset, the bit at
|
||||
position pos takes on the value of the bit at position <tt>pos +
|
||||
n</tt> of this bitset, or zero if no such bit exists.<br>
|
||||
n</tt> of this bitset, or zero if no such bit exists. Note that
|
||||
the expression <tt>b >> n</tt> is equivalent to
|
||||
constructing a temporary copy of <tt>b</tt> and then using
|
||||
<tt>operator>>=</tt>.<br>
|
||||
<b>Throws:</b> An allocation error if memory is exhausted
|
||||
(<tt>std::bad_alloc</tt> if <tt>Allocator=std::allocator</tt>).
|
||||
|
||||
@@ -1390,7 +1396,10 @@ dynamic_bitset <a name=
|
||||
|
||||
<b>Requires:</b> <tt>a.size() == b.size()</tt><br>
|
||||
<b>Returns:</b> A new bitset that is the bitwise-AND of the
|
||||
bitsets <tt>a</tt> and <tt>b</tt>.<br>
|
||||
bitsets <tt>a</tt> and <tt>b</tt>. Note that the expression
|
||||
<tt>b1 & b2</tt> is equivalent to creating a temporary copy
|
||||
of <tt>b1</tt>, using <tt>operator&=</tt>, and returning the
|
||||
temporary copy.<br>
|
||||
<b>Throws:</b> An allocation error if memory is exhausted
|
||||
(<tt>std::bad_alloc</tt> if <tt>Allocator=std::allocator</tt>).
|
||||
|
||||
@@ -1402,7 +1411,10 @@ dynamic_bitset <a name=
|
||||
|
||||
<b>Requires:</b> <tt>a.size() == b.size()</tt><br>
|
||||
<b>Returns:</b> A new bitset that is the bitwise-OR of the
|
||||
bitsets <tt>a</tt> and <tt>b</tt>.<br>
|
||||
bitsets <tt>a</tt> and <tt>b</tt>. Note that the expression
|
||||
<tt>b1 & b2</tt> is equivalent to creating a temporary copy
|
||||
of <tt>b1</tt>, using <tt>operator&=</tt>, and returning the
|
||||
temporary copy.<br>
|
||||
<b>Throws:</b> An allocation error if memory is exhausted
|
||||
(<tt>std::bad_alloc</tt> if <tt>Allocator=std::allocator</tt>).
|
||||
|
||||
@@ -1414,7 +1426,10 @@ dynamic_bitset <a name=
|
||||
|
||||
<b>Requires:</b> <tt>a.size() == b.size()</tt><br>
|
||||
<b>Returns:</b> A new bitset that is the bitwise-XOR of the
|
||||
bitsets <tt>a</tt> and <tt>b</tt>.<br>
|
||||
bitsets <tt>a</tt> and <tt>b</tt>. Note that the expression
|
||||
<tt>b1 & b2</tt> is equivalent to creating a temporary copy
|
||||
of <tt>b1</tt>, using <tt>operator&=</tt>, and returning the
|
||||
temporary copy.<br>
|
||||
<b>Throws:</b> An allocation error if memory is exhausted
|
||||
(<tt>std::bad_alloc</tt> if <tt>Allocator=std::allocator</tt>).
|
||||
|
||||
@@ -1426,7 +1441,10 @@ dynamic_bitset <a name=
|
||||
|
||||
<b>Requires:</b> <tt>a.size() == b.size()</tt><br>
|
||||
<b>Returns:</b> A new bitset that is the set difference of the
|
||||
bitsets <tt>a</tt> and <tt>b</tt>.<br>
|
||||
bitsets <tt>a</tt> and <tt>b</tt>. Note that the expression
|
||||
<tt>b1 - b2</tt> is equivalent to creating a temporary copy of
|
||||
<tt>b1</tt>, using <tt>operator-=</tt>, and returning the
|
||||
temporary copy.<br>
|
||||
<b>Throws:</b> An allocation error if memory is exhausted
|
||||
(<tt>std::bad_alloc</tt> if <tt>Allocator=std::allocator</tt>).
|
||||
|
||||
|
||||
@@ -769,11 +769,11 @@ dynamic_bitset<Block, Allocator>::operator<<=(size_type n)
|
||||
b[div] = b[0];
|
||||
}
|
||||
|
||||
// disable std::fill_n deprecated warning in MSVC++ 8.0 (warning C4996)
|
||||
// This will only work in MSVC++ 8.0 SP1, which brings up the warning
|
||||
// in the line of user code; otherwise, the warning will come up
|
||||
// in the line in the header itself, so if the user includes stdlib
|
||||
// headers before dynamic_bitset, he will still get the warning.
|
||||
// disable std::fill_n deprecated warning in MSVC++ 8.0 (warning C4996)
|
||||
// This will only work in MSVC++ 8.0 SP1, which brings up the warning
|
||||
// in the line of user code; otherwise, the warning will come up
|
||||
// in the line in the header itself, so if the user includes stdlib
|
||||
// headers before dynamic_bitset, he will still get the warning.
|
||||
#if defined(_MSC_VER) && _MSC_VER >= 1400
|
||||
#pragma warning(push)
|
||||
#pragma warning(disable:4996)
|
||||
|
||||
Reference in New Issue
Block a user