There are several additional iterator concepts that are commonly applied
to families of algorithms.
These group together iterator requirements
of algorithm families.
There are three relational concepts that specify
how element values are transferred between
indirectly_readable and indirectly_writable types:
There are three relational concepts for rearrangements:
There is one relational concept for comparing values from different sequences: