mirror of
https://github.com/boostorg/dynamic_bitset.git
synced 2026-01-19 04:12:09 +00:00
e00b0048f9
This commit: - Sorts the #include directives: The #includes of the ""-form come first, those of the <>-form come later (this helps checking if any include file is not self-sufficient); in each of the two groups, the names of the headers or source files are sorted alphabetically (this eases searching for a specific #include and avoids duplicates). - Uses the ""-form when including Boost files; using the <>-form is a relic of the past. This was even discussed on the developers list many years ago and led to core issue 370. Note that some parts of DynamicBitset were already using the ""-form and that has never caused any problem, AFAIK. - Removes some comments attached to the directives themselves which seemed pretty useless and prone to get out of sync.
36 lines
963 B
C++
36 lines
963 B
C++
// (C) Copyright Jeremy Siek 2001.
|
|
// Distributed under the Boost Software License, Version 1.0. (See
|
|
// accompanying file LICENSE_1_0.txt or copy at
|
|
// http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
|
|
|
|
// An example of setting and reading some bits. Note that operator[]
|
|
// goes from the least-significant bit at 0 to the most significant
|
|
// bit at size()-1. The operator<< for dynamic_bitset prints the
|
|
// bitset from most-significant to least-significant, since that is
|
|
// the format most people are used to reading.
|
|
//
|
|
// The output is:
|
|
//
|
|
// 11001
|
|
// 10011
|
|
// ---------------------------------------------------------------------
|
|
|
|
#include "boost/dynamic_bitset.hpp"
|
|
#include <iostream>
|
|
|
|
int main()
|
|
{
|
|
boost::dynamic_bitset<> x(5); // all 0's by default
|
|
x[0] = 1;
|
|
x[1] = 1;
|
|
x[4] = 1;
|
|
for (boost::dynamic_bitset<>::size_type i = 0; i < x.size(); ++i)
|
|
std::cout << x[i];
|
|
std::cout << "\n";
|
|
std::cout << x << "\n";
|
|
|
|
return 0;
|
|
}
|