#
The
permutable
concept specifies the common requirements of algorithms that reorder elements in place by moving or swapping them
.
template
<
class
I
>
concept
permutable
=
forward_
iterator
<
I
>
&
&
indirectly_
movable_
storable
<
I, I
>
&
&
indirectly_
swappable
<
I, I
>
;