Document Deque.
Move in-place functions below their iterator variants.
Place union as the first function, for consistency.
Group union, intersect and difference in Bitv.
Document Bitv.
Document BitvSet.
Move intersection above difference and symmetric_differance.

So all comes in the order union, intersection, difference and
symmetric_difference.
Main bitv example: prime sieve.