How can std::bitset be faster than `std::vector<bool>`?
<p>According to <a href="http://stackoverflow.com/questions/4155847/choosing-between-setint-vs-vectorbool-vs-vectorboolean-t-to-use-as-a-bitm/4155985#4155985">this answer</a> the poster expects a <a href="http://www.cplusplus.com/reference/stl/bitset/">std::bitset</a> of size 100k bits to be faster than a <code>std::vector&lt;bool&gt;</code> when querying individual bits. How can this be possible? How could they even differ significantly in their implementation, if std::bitset apparently allows for arbitrary sizes just like std::vector?</p>
