Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages

  
 
  

home | help
std::permutable(3)	      C++ Standard Libary	    std::permutable(3)

NAME
       std::permutable - std::permutable

Synopsis
	  Defined in header <iterator>
	  template< class I >

	  concept permutable =
	  std::forward_iterator<I> &&		     (since C++20)
	  std::indirectly_movable_storable<I, I> &&

	  std::indirectly_swappable<I, I>;

	  The  concept	permutable refines std::forward_iterator by adding re-
       quirements for
	  reordering through moves and swaps.

	 Semantic requirements

	  I models permutable only if all concepts it subsumes are modeled.

See also
	  sortable		   specifies the common	requirements of	 algo-
       rithms that
	  (C++20)		   permute sequences into ordered sequences
				   (concept)
	  ranges::remove
	  ranges::remove_if	   removes elements satisfying specific	crite-
       ria
	  (C++20)		   (niebloid)
	  (C++20)
	  ranges::unique	   removes consecutive duplicate elements in a
       range
	  (C++20)		   (niebloid)
	  ranges::reverse	   reverses the	order of elements in a range
	  (C++20)		   (niebloid)
	  ranges::rotate	   rotates the order of	elements in a range
	  (C++20)		   (niebloid)
	  ranges::shuffle	   randomly re-orders elements in a range
	  (C++20)		   (niebloid)
	  ranges::partition	   divides a range of elements into two	groups
	  (C++20)		   (niebloid)
	  ranges::stable_partition divides elements into two groups while pre-
       serving their
	  (C++20)		   relative order
				   (niebloid)

http://cppreference.com		  2022.07.31		    std::permutable(3)

Want to link to this manual page? Use this URL:
<https://man.freebsd.org/cgi/man.cgi?query=std::permutable&sektion=3&manpath=FreeBSD+Ports+15.0>

home | help