[alg.req.general] (original) (raw)

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 betweenindirectly_­readable and indirectly_­writable types:indirectly_­movable,indirectly_­copyable, andindirectly_­swappable.

There are three relational concepts for rearrangements:permutable,mergeable, andsortable.

There is one relational concept for comparing values from different sequences:indirectly_­comparable.