bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix bitset example

This commit is contained in:
Antti H S Laaksonen 2017-03-07 17:54:11 +02:00
parent a3342ea45b
commit bc8772a6ee
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
chapter04.tex
View File

@ -479,12 +479,12 @@ For example, the following code creates
a bitset that contains 10 elements:
\begin{lstlisting}
bitset<10> s;
s[2] = 1;
s[5] = 1;
s[6] = 1;
s[8] = 1;
cout << s[4] << "\n"; // 0
cout << s[5] << "\n"; // 1
s[1] = 1;
s[3] = 1;
s[4] = 1;
s[7] = 1;
cout << s[4] << "\n"; // 1
cout << s[5] << "\n"; // 0
\end{lstlisting}
The benefit in using bitsets is that
@ -500,11 +500,11 @@ can be efficiently manipulated using
bit operators, which makes it possible to
optimize algorithms using bit sets.
The following code shows another way to create a bitset:
The following code shows another way to create the above bitset:
\begin{lstlisting}
bitset<10> s(string("0010011010"));
cout << s[4] << "\n"; // 0
cout << s[5] << "\n"; // 1
bitset<10> s(string("0010011010")); // from right to left
cout << s[4] << "\n"; // 1
cout << s[5] << "\n"; // 0
\end{lstlisting}
The function \texttt{count} returns the number