Standard library header <algorithm>
From cppreference.net
Cet en-tête fait partie de la bibliothèque algorithm .
Inclusions |
|
|
(C++11)
|
std::initializer_list modèle de classe |
Classes |
|
|
Défini dans l'espace de noms
std::ranges
|
|
Types de retour (C++20) |
|
|
(C++20)
|
fournit un moyen de stocker un itérateur et un objet fonction comme une seule unité
(modèle de classe) |
|
(C++20)
|
fournit un moyen de stocker deux itérateurs comme une seule unité
(modèle de classe) |
|
(C++20)
|
fournit un moyen de stocker deux itérateurs comme une seule unité
(modèle de classe) |
|
(C++20)
|
fournit un moyen de stocker trois itérateurs comme une seule unité
(modèle de classe) |
|
(C++20)
|
fournit un moyen de stocker trois itérateurs comme une seule unité
(modèle de classe) |
|
(C++20)
|
fournit un moyen de stocker deux objets ou références du même type en tant qu'unité unique
(modèle de classe) |
|
(C++20)
|
fournit un moyen de stocker un itérateur et un indicateur booléen comme une seule unité
(modèle de classe) |
|
(C++23)
|
fournit un moyen de stocker un itérateur et une valeur comme une seule unité
(modèle de classe) |
|
(C++23)
|
fournit un moyen de stocker un itérateur et une valeur comme une seule unité
(modèle de classe) |
Fonctions |
|
Opérations de séquence non modifiantes |
|
|
(C++11)
(C++11)
(C++11)
|
vérifie si un prédicat est
true
pour tous, certains ou aucun des éléments dans une plage
(modèle de fonction) |
|
applique un
objet fonction
unaire aux éléments d'un
intervalle
(modèle de fonction) |
|
|
(C++17)
|
applique un objet fonction aux N premiers éléments d'une séquence
(modèle de fonction) |
|
renvoie le nombre d'éléments satisfaisant des critères spécifiques
(modèle de fonction) |
|
|
trouve la première position où deux plages diffèrent
(modèle de fonction) |
|
|
(C++11)
|
trouve le premier élément satisfaisant des critères spécifiques
(modèle de fonction) |
|
trouve la dernière séquence d'éléments dans une certaine plage
(modèle de fonction) |
|
|
recherche l'un quelconque des éléments d'un ensemble
(modèle de fonction) |
|
|
trouve les deux premiers éléments adjacents qui sont égaux (ou qui satisfont un prédicat donné)
(modèle de fonction) |
|
|
recherche la première occurrence d'une séquence d'éléments
(modèle de fonction) |
|
|
recherche la première occurrence d'un nombre de copies consécutives d'un élément dans une plage
(modèle de fonction) |
|
Opérations de modification de séquence |
|
|
(C++11)
|
copie une série d'éléments vers un nouvel emplacement
(modèle de fonction) |
|
(C++11)
|
copie un nombre d'éléments vers un nouvel emplacement
(modèle de fonction) |
|
copie une plage d'éléments dans l'ordre inverse
(modèle de fonction) |
|
|
(C++11)
|
déplace une plage d'éléments vers un nouvel emplacement
(modèle de fonction) |
|
(C++11)
|
déplace une plage d'éléments vers un nouvel emplacement dans l'ordre inverse
(modèle de fonction) |
|
assigner par copie la valeur donnée à chaque élément d'une plage
(modèle de fonction) |
|
|
assigner par copie la valeur donnée à N éléments dans une plage
(modèle de fonction) |
|
|
applique une fonction à une plage d'éléments, stockant les résultats dans une plage de destination
(modèle de fonction) |
|
|
assigne les résultats d'appels successifs de fonction à chaque élément d'une plage
(modèle de fonction) |
|
|
assigne les résultats d'appels successifs de fonction à N éléments dans une plage
(modèle de fonction) |
|
|
supprime les éléments satisfaisant des critères spécifiques
(modèle de fonction) |
|
|
copie une plage d'éléments en omettant ceux qui satisfont des critères spécifiques
(modèle de fonction) |
|
|
remplace toutes les valeurs satisfaisant des critères spécifiques par une autre valeur
(modèle de fonction) |
|
|
copie une plage d'éléments en remplaçant les éléments satisfaisant des critères spécifiques par une autre valeur
(modèle de fonction) |
|
|
échange les valeurs de deux objets
(modèle de fonction) |
|
|
échange deux plages d'éléments
(modèle de fonction) |
|
|
échange les éléments pointés par deux itérateurs
(modèle de fonction) |
|
|
inverse l'ordre des éléments dans une plage
(modèle de fonction) |
|
|
crée une copie d'une plage qui est inversée
(modèle de fonction) |
|
|
fait pivoter l'ordre des éléments dans une plage
(modèle de fonction) |
|
|
copie et fait pivoter une plage d'éléments
(modèle de fonction) |
|
|
(C++20)
|
décale les éléments dans une plage
(modèle de fonction) |
|
(until C++17)
(C++11)
|
réorganise aléatoirement les éléments dans une plage
(modèle de fonction) |
|
(C++17)
|
sélectionne N éléments aléatoires d'une séquence
(modèle de fonction) |
|
supprime les éléments en double consécutifs dans une plage
(modèle de fonction) |
|
|
crée une copie d'une plage d'éléments qui ne contient pas de doublons consécutifs
(modèle de fonction) |
|
Opérations de partitionnement |
|
|
(C++11)
|
détermine si la plage est partitionnée par le prédicat donné
(modèle de fonction) |
|
divise une plage d'éléments en deux groupes
(modèle de fonction) |
|
|
(C++11)
|
copie une plage en divisant les éléments en deux groupes
(modèle de fonction) |
|
divise les éléments en deux groupes tout en préservant leur ordre relatif
(modèle de fonction) |
|
|
(C++11)
|
localise le point de partition d'une plage partitionnée
(modèle de fonction) |
Opérations de tri |
|
|
(C++11)
|
vérifie si une plage est triée en ordre croissant
(modèle de fonction) |
|
(C++11)
|
trouve le plus grand sous-intervalle trié
(modèle de fonction) |
|
trie une plage en ordre croissant
(modèle de fonction) |
|
|
trie les N premiers éléments d'une plage
(modèle de fonction) |
|
|
copie et trie partiellement une plage d'éléments
(modèle de fonction) |
|
|
trie une plage d'éléments en préservant l'ordre entre les éléments égaux
(modèle de fonction) |
|
|
trie partiellement la plage donnée en s'assurant qu'elle est partitionnée par l'élément donné
(modèle de fonction) |
|
Opérations de recherche binaire (sur des plages triées) |
|
|
retourne un itérateur vers le premier élément
non inférieur
à la valeur donnée
(modèle de fonction) |
|
|
retourne un itérateur vers le premier élément
supérieur
à une certaine valeur
(modèle de fonction) |
|
|
détermine si un élément existe dans une plage partiellement ordonnée
(modèle de fonction) |
|
|
retourne la plage d'éléments correspondant à une clé spécifique
(modèle de fonction) |
|
Autres opérations sur les plages triées |
|
|
fusionne deux plages triées
(modèle de fonction) |
|
|
fusionne deux plages ordonnées en place
(modèle de fonction) |
|
Opérations sur les ensembles (sur des plages triées) |
|
|
renvoie
true
si une séquence est une sous-séquence d'une autre
(modèle de fonction) |
|
|
calcule la différence entre deux ensembles
(modèle de fonction) |
|
|
calcule l'intersection de deux ensembles
(modèle de fonction) |
|
|
calcule la différence symétrique entre deux ensembles
(modèle de fonction) |
|
|
calcule l'union de deux ensembles
(modèle de fonction) |
|
Opérations sur le tas |
|
|
(C++11)
|
vérifie si la plage donnée est un tas maximum
(modèle de fonction) |
|
(C++11)
|
trouve la plus grande sous-plage qui est un tas maximum
(modèle de fonction) |
|
crée un tas maximal à partir d'une plage d'éléments
(modèle de fonction) |
|
|
ajoute un élément à un tas max
(modèle de fonction) |
|
|
supprime le plus grand élément d'un tas maximum
(modèle de fonction) |
|
|
transforme un tas maximum en une plage d'éléments triés par ordre croissant
(modèle de fonction) |
|
Opérations minimum/maximum |
|
|
renvoie la plus grande des valeurs données
(modèle de fonction) |
|
|
renvoie le plus grand élément dans une plage
(modèle de fonction) |
|
|
renvoie la plus petite des valeurs données
(modèle de fonction) |
|
|
renvoie le plus petit élément dans une plage
(modèle de fonction) |
|
|
(C++11)
|
renvoie le plus petit et le plus grand de deux éléments
(modèle de fonction) |
|
(C++11)
|
renvoie les plus petits et les plus grands éléments dans une plage
(modèle de fonction) |
|
(C++17)
|
limite une valeur entre une paire de valeurs limites
(modèle de fonction) |
Opérations de comparaison |
|
|
détermine si deux ensembles d'éléments sont identiques
(modèle de fonction) |
|
|
renvoie
true
si une plage est lexicographiquement inférieure à une autre
(modèle de fonction) |
|
|
compare deux plages en utilisant la comparaison à trois voies
(modèle de fonction) |
|
Opérations de permutation |
|
|
(C++11)
|
détermine si une séquence est une permutation d'une autre séquence
(modèle de fonction) |
|
génère la prochaine permutation lexicographique supérieure d'une plage d'éléments
(modèle de fonction) |
|
|
génère la permutation lexicographique suivante plus petite d'une plage d'éléments
(modèle de fonction) |
|
Entités de type fonction (C++20) |
|
|
Défini dans l'espace de noms
std::ranges
|
|
Opérations de séquence non modifiantes |
|
|
(C++20)
(C++20)
(C++20)
|
vérifie si un prédicat est
true
pour tous, certains ou aucun des éléments d'une plage
(objet fonction algorithme) |
|
(C++20)
|
applique un
objet fonction
unaire aux éléments d'un
intervalle
(objet fonction d'algorithme) |
|
(C++20)
|
applique un objet fonction aux N premiers éléments d'une séquence
(objet fonction algorithme) |
|
(C++20)
(C++20)
|
retourne le nombre d'éléments satisfaisant des critères spécifiques
(objet fonction algorithme) |
|
(C++20)
|
trouve la première position où deux plages diffèrent
(objet fonction algorithme) |
|
(C++20)
(C++20)
(C++20)
|
trouve le premier élément satisfaisant des critères spécifiques
(objet fonction algorithme) |
|
(C++23)
(C++23)
(C++23)
|
trouve le dernier élément satisfaisant des critères spécifiques
(objet fonction algorithme) |
|
(C++20)
|
trouve la dernière séquence d'éléments dans une certaine plage
(objet fonction algorithme) |
|
(C++20)
|
recherche l'un quelconque des éléments d'un ensemble
(objet fonction algorithme) |
|
(C++20)
|
trouve les deux premiers éléments adjacents qui sont égaux (ou satisfont un prédicat donné)
(objet fonction algorithme) |
|
(C++20)
|
recherche la première occurrence d'une plage d'éléments
(objet fonction algorithme) |
|
(C++20)
|
recherche la première occurrence d'un nombre de copies consécutives d'un élément dans une plage
(objet fonction d'algorithme) |
|
(C++23)
(C++23)
|
vérifie si la plage contient l'élément ou la sous-plage donnée
(objet fonction algorithme) |
|
(C++23)
|
vérifie si une plage commence par une autre plage
(objet fonction algorithme) |
|
(C++23)
|
vérifie si une plage se termine par une autre plage
(objet fonction algorithme) |
Opérations de repli |
|
|
(C++23)
|
plie à gauche une plage d'éléments
(objet fonction algorithme) |
|
(C++23)
|
plie à gauche une plage d'éléments en utilisant le premier élément comme valeur initiale
(objet fonction algorithme) |
|
(C++23)
|
plie à droite une plage d'éléments
(objet fonction algorithme) |
|
(C++23)
|
effectue un pliage à droite d'une plage d'éléments en utilisant le dernier élément comme valeur initiale
(objet fonction algorithme) |
|
(C++23)
|
réduit par la gauche une plage d'éléments et retourne une
paire
(itérateur, valeur)
(objet fonction algorithme) |
|
Effectue un pliage à gauche d'une plage d'éléments en utilisant le premier élément comme valeur initiale, et retourne une
paire
(itérateur,
optional
)
(objet fonction algorithme) |
|
Opérations de modification de séquence |
|
|
(C++20)
(C++20)
|
copie une plage d'éléments vers un nouvel emplacement
(objet fonction algorithme) |
|
(C++20)
|
copie un certain nombre d'éléments vers un nouvel emplacement
(objet fonction algorithme) |
|
(C++20)
|
copie une plage d'éléments dans l'ordre inverse
(objet fonction algorithme) |
|
(C++20)
|
déplace une plage d'éléments vers un nouvel emplacement
(objet fonction algorithme) |
|
(C++20)
|
déplace une plage d'éléments vers un nouvel emplacement dans l'ordre inverse
(objet fonction algorithme) |
|
(C++20)
|
assigne une plage d'éléments à une certaine valeur
(objet fonction algorithme) |
|
(C++20)
|
assigne une valeur à un nombre d'éléments
(objet fonction algorithme) |
|
(C++20)
|
applique une fonction à une plage d'éléments
(objet fonction algorithme) |
|
(C++20)
|
sauvegarde le résultat d'une fonction dans une plage
(objet fonction algorithme) |
|
(C++20)
|
sauvegarde le résultat de N applications d'une fonction
(objet fonction algorithme) |
|
(C++20)
(C++20)
|
supprime les éléments satisfaisant des critères spécifiques
(objet fonction algorithme) |
|
(C++20)
(C++20)
|
copie une plage d'éléments en omettant ceux qui satisfont des critères spécifiques
(objet fonction algorithme) |
|
(C++20)
(C++20)
|
remplace toutes les valeurs satisfaisant des critères spécifiques par une autre valeur
(objet fonction algorithme) |
|
(C++20)
(C++20)
|
copie une plage en remplaçant les éléments satisfaisant des critères spécifiques par une autre valeur
(objet fonction algorithme) |
|
(C++20)
|
échange deux plages d'éléments
(objet fonction algorithme) |
|
(C++20)
|
inverse l'ordre des éléments dans une plage
(objet fonction algorithme) |
|
(C++20)
|
crée une copie d'une plage qui est inversée
(objet fonction algorithme) |
|
(C++20)
|
fait pivoter l'ordre des éléments dans une plage
(objet fonction algorithme) |
|
(C++20)
|
copie et fait pivoter une plage d'éléments
(objet fonction algorithme) |
|
décale les éléments dans une plage
(objet fonction algorithme) |
|
|
(C++20)
|
sélectionne N éléments aléatoires d'une séquence
(objet fonction algorithme) |
|
(C++20)
|
réorganise aléatoirement les éléments dans une plage
(fonction objet algorithme) |
|
(C++20)
|
supprime les éléments dupliqués consécutifs dans une plage
(objet fonction algorithme) |
|
(C++20)
|
crée une copie d'une plage d'éléments qui ne contient pas de doublons consécutifs
(objet fonction algorithme) |
Opérations de partitionnement |
|
|
(C++20)
|
détermine si la plage est partitionnée par le prédicat donné
(objet fonction algorithme) |
|
(C++20)
|
divise une plage d'éléments en deux groupes
(objet fonction algorithme) |
|
(C++20)
|
copie une plage en divisant les éléments en deux groupes
(objet fonction algorithme) |
|
(C++20)
|
divise les éléments en deux groupes tout en préservant leur ordre relatif
(objet fonction algorithme) |
|
(C++20)
|
localise le point de partition d'une plage partitionnée
(objet fonction algorithme) |
Opérations de tri |
|
|
(C++20)
|
vérifie si une plage est triée par ordre croissant
(objet fonction algorithme) |
|
(C++20)
|
trouve la plus grande sous-plage triée
(objet fonction algorithme) |
|
(C++20)
|
trie une plage en ordre croissant
(objet fonction algorithme) |
|
(C++20)
|
trie les N premiers éléments d'une plage
(objet fonction algorithme) |
|
(C++20)
|
copie et trie partiellement une plage d'éléments
(objet fonction algorithme) |
|
(C++20)
|
trie une plage d'éléments en préservant l'ordre entre les éléments égaux
(objet fonction algorithme) |
|
(C++20)
|
trie partiellement la plage donnée en s'assurant qu'elle est partitionnée par l'élément donné
(objet fonction algorithme) |
Opérations de recherche binaire (sur des plages triées) |
|
|
(C++20)
|
retourne un itérateur vers le premier élément
non inférieur
à la valeur donnée
(objet fonction algorithme) |
|
(C++20)
|
retourne un itérateur vers le premier élément
supérieur
à une certaine valeur
(objet fonction algorithme) |
|
(C++20)
|
détermine si un élément existe dans une plage partiellement ordonnée
(objet fonction algorithme) |
|
(C++20)
|
retourne la plage d'éléments correspondant à une clé spécifique
(objet fonction algorithme) |
Autres opérations sur les plages triées |
|
|
(C++20)
|
fusionne deux plages triées
(objet fonction algorithme) |
|
(C++20)
|
fusionne deux plages ordonnées en place
(objet fonction algorithme) |
Opérations sur les ensembles (sur plages triées) |
|
|
(C++20)
|
renvoie
true
si une séquence est une sous-séquence d'une autre
(objet fonction algorithme) |
|
(C++20)
|
calcule la différence entre deux ensembles
(objet fonction algorithme) |
|
(C++20)
|
calcule l'intersection de deux ensembles
(objet fonction algorithme) |
|
(C++20)
|
calcule la différence symétrique entre deux ensembles
(objet fonction algorithme) |
|
(C++20)
|
calcule l'union de deux ensembles
(objet fonction algorithme) |
Opérations sur les tas |
|
|
(C++20)
|
vérifie si la plage donnée est un tas maximum
(objet fonction algorithme) |
|
(C++20)
|
trouve le plus grand sous-intervalle qui est un tas maximum
(objet fonction algorithme) |
|
(C++20)
|
crée un tas maximum à partir d'une plage d'éléments
(objet fonction algorithme) |
|
(C++20)
|
ajoute un élément à un tas maximum
(objet fonction algorithme) |
|
(C++20)
|
supprime le plus grand élément d'un tas maximum
(objet fonction algorithme) |
|
(C++20)
|
transforme un tas maximum en une plage d'éléments triés par ordre croissant
(objet fonction algorithme) |
Opérations minimum/maximum |
|
|
(C++20)
|
retourne la plus grande des valeurs données
(objet fonction algorithme) |
|
(C++20)
|
retourne le plus grand élément dans une plage
(objet fonction algorithme) |
|
(C++20)
|
renvoie la plus petite des valeurs données
(objet fonction algorithme) |
|
(C++20)
|
retourne le plus petit élément dans une plage
(objet fonction algorithme) |
|
(C++20)
|
retourne le plus petit et le plus grand de deux éléments
(objet fonction algorithme) |
|
(C++20)
|
retourne les plus petits et les plus grands éléments dans une plage
(objet fonction algorithme) |
|
(C++20)
|
limite une valeur entre une paire de valeurs limites
(fonction objet d'algorithme) |
Opérations de comparaison |
|
|
(C++20)
|
détermine si deux ensembles d'éléments sont identiques
(objet fonction algorithme) |
|
(C++20)
|
retourne
true
si une plage est lexicographiquement inférieure à une autre
(objet fonction algorithme) |
Opérations de permutation |
|
|
(C++20)
|
détermine si une séquence est une permutation d'une autre séquence
(objet fonction algorithme) |
|
(C++20)
|
génère la prochaine permutation lexicographique supérieure d'une plage d'éléments
(objet fonction algorithme) |
|
(C++20)
|
génère la permutation lexicographique précédente d'une plage d'éléments
(objet fonction algorithme) |
Synopsis
// principalement autonome #include <initializer_list> namespace std { namespace ranges { // types de résultats d'algorithmes template<class I, class F> struct in_fun_result; template<class I1, class I2> struct in_in_result; template<class I, class O> struct in_out_result; template<class I1, class I2, class O> struct in_in_out_result; template<class I, class O1, class O2> struct in_out_out_result; template<class T> struct min_max_result; template<class I> struct in_found_result; template<class I, class T> struct in_value_result; template<class O, class T> struct out_value_result; } // opérations de séquence non modifiantes // tout de template<class InputIter, class Pred> constexpr bool all_of(InputIter first, InputIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> bool all_of(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr bool all_of(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr bool all_of(R&& r, Pred pred, Proj proj = {}); } // n'importe lequel template<class InputIter, class Pred> constexpr bool any_of(InputIter first, InputIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> bool any_of(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr bool any_of(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr bool any_of(R&& r, Pred pred, Proj proj = {}); } // aucun de template<class InputIter, class Pred> constexpr bool none_of(InputIter first, InputIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> bool none_of(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr bool none_of(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr bool none_of(R&& r, Pred pred, Proj proj = {}); } // contient namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>> requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> constexpr bool contains(I first, S last, const T& value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>> requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> constexpr bool contains(R&& r, const T& value, Proj proj = {}); template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr bool contains_subrange(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr bool contains_subrange(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // pour chaque template<class InputIter, class Function> constexpr Function for_each(InputIter first, InputIter last, Function f); template<class ExecutionPolicy, class ForwardIter, class Function> void for_each(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Function f); namespace ranges { template<class I, class F> using for_each_result = in_fun_result<I, F>; template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirectly_unary_invocable<projected<I, Proj>> Fun> constexpr for_each_result<I, Fun> for_each(I first, S last, Fun f, Proj proj = {}); template<input_range R, class Proj = identity, indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun> constexpr for_each_result<borrowed_iterator_t<R>, Fun> for_each(R&& r, Fun f, Proj proj = {}); } template<class InputIter, class Size, class Function> constexpr InputIter for_each_n(InputIter first, Size n, Function f); template<class ExecutionPolicy, class ForwardIter, class Size, class Function> ForwardIter for_each_n(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, Size n, Function f); namespace ranges { template<class I, class F> using for_each_n_result = in_fun_result<I, F>; template<input_iterator I, class Proj = identity, indirectly_unary_invocable<projected<I, Proj>> Fun> constexpr for_each_n_result<I, Fun> for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); } // trouver template<class InputIter, class T = typename iterator_traits<InputIter>::value_type> constexpr InputIter find(InputIter first, InputIter last, const T& value); template<class ExecutionPolicy, class ForwardIter, class T = typename iterator_traits<InputIter>::value_type> ForwardIter find(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, const T& value); template<class InputIter, class Pred> constexpr InputIter find_if(InputIter first, InputIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> ForwardIter find_if(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); template<class InputIter, class Pred> constexpr InputIter find_if_not(InputIter first, InputIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> ForwardIter find_if_not(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity class T = projected_value_t<I, Proj>> requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> constexpr I find(I first, S last, const T& value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>> requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> constexpr borrowed_iterator_t<R> find(R&& r, const T& value, Proj proj = {}); template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr borrowed_iterator_t<R> find_if(R&& r, Pred pred, Proj proj = {}); template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr borrowed_iterator_t<R> find_if_not(R&& r, Pred pred, Proj proj = {}); } // trouver dernier namespace ranges { template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity> requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> constexpr subrange<I> find_last(I first, S last, const T& value, Proj proj = {}); template<forward_range R, class T, class Proj = identity> requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> constexpr borrowed_subrange_t<R> find_last(R&& r, const T& value, Proj proj = {}); template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr borrowed_subrange_t<R> find_last_if(R&& r, Pred pred, Proj proj = {}); template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr borrowed_subrange_t<R> find_last_if_not(R&& r, Pred pred, Proj proj = {}); } // trouver la fin template<class ForwardIter1, class ForwardIter2> constexpr ForwardIter1 find_end(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ForwardIter1, class ForwardIter2, class BinaryPred> constexpr ForwardIter1 find_end(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter1 find_end(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> ForwardIter1 find_end(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); namespace ranges { template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr subrange<I1> find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr borrowed_subrange_t<R1> find_end(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // trouver premier template<class InputIter, class ForwardIter> constexpr InputIter find_first_of(InputIter first1, InputIter last1, ForwardIter first2, ForwardIter last2); template<class InputIter, class ForwardIter, class BinaryPred> constexpr InputIter find_first_of(InputIter first1, InputIter last1, ForwardIter first2, ForwardIter last2, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter1 find_first_of(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> ForwardIter1 find_first_of(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); namespace ranges { template<input_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr I1 find_first_of(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr borrowed_iterator_t<R1> find_first_of(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // recherche d'éléments adjacents template<class ForwardIter> constexpr ForwardIter adjacent_find(ForwardIter first, ForwardIter last); template<class ForwardIter, class BinaryPred> constexpr ForwardIter adjacent_find(ForwardIter first, ForwardIter last, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter> ForwardIter adjacent_find(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last); template<class ExecutionPolicy, class ForwardIter, class BinaryPred> ForwardIter adjacent_find(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, BinaryPred pred); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_binary_predicate<projected<I, Proj>, projected<I, Proj>> Pred = ranges::equal_to> constexpr I adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_binary_predicate<projected<iterator_t<R>, Proj>, projected<iterator_t<R>, Proj>> Pred = ranges::equal_to> constexpr borrowed_iterator_t<R> adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); } // compter template<class InputIter, class T = typename iterator_traits<InputIter>::value_type> constexpr typename iterator_traits<InputIter>::difference_type count(InputIter first, InputIter last, const T& value); template<class ExecutionPolicy, class ForwardIter, class T = typename iterator_traits<InputIterator>::value_type> typename iterator_traits<ForwardIter>::difference_type count(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, const T& value); template<class InputIter, class Pred> constexpr typename iterator_traits<InputIter>::difference_type count_if(InputIter first, InputIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> typename iterator_traits<ForwardIter>::difference_type count_if(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>> requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> constexpr iter_difference_t<I> count(I first, S last, const T& value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>> requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> constexpr range_difference_t<R> count(R&& r, const T& value, Proj proj = {}); template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr iter_difference_t<I> count_if(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr range_difference_t<R> count_if(R&& r, Pred pred, Proj proj = {}); } // mismatch template<class InputIter1, class InputIter2> constexpr pair<InputIter1, InputIter2> mismatch(InputIter1 first1, InputIter1 last1, InputIter2 first2); template<class InputIter1, class InputIter2, class BinaryPred> constexpr pair<InputIter1, InputIter2> mismatch(InputIter1 first1, InputIter1 last1, InputIter2 first2, BinaryPred pred); template<class InputIter1, class InputIter2> constexpr pair<InputIter1, InputIter2> mismatch(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2); template<class InputIter1, class InputIter2, class BinaryPred> constexpr pair<InputIter1, InputIter2> mismatch(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> pair<ForwardIter1, ForwardIter2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> pair<ForwardIter1, ForwardIter2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> pair<ForwardIter1, ForwardIter2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> pair<ForwardIter1, ForwardIter2> mismatch(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); namespace ranges { template<class I1, class I2> using mismatch_result = in_in_result<I1, I2>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr mismatch_result<I1, I2> mismatch(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr mismatch_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // égal template<class InputIter1, class InputIter2> constexpr bool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2); template<class InputIter1, class InputIter2, class BinaryPred> constexpr bool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2, BinaryPred pred); template<class InputIter1, class InputIter2> constexpr bool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2); template<class InputIter1, class InputIter2, class BinaryPred> constexpr bool equal(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> bool equal(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> bool equal(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> bool equal(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> bool equal(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); namespace ranges { template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr bool equal(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr bool equal(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // est une permutation template<class ForwardIter1, class ForwardIter2> constexpr bool is_permutation(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2); template<class ForwardIter1, class ForwardIter2, class BinaryPred> constexpr bool is_permutation(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, BinaryPred pred); template<class ForwardIter1, class ForwardIter2> constexpr bool is_permutation(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ForwardIter1, class ForwardIter2, class BinaryPred> constexpr bool is_permutation(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); namespace ranges { template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, class Proj1 = identity, class Proj2 = identity, indirect_equivalence_relation<projected<I1, Proj1>, projected<I2, Proj2>> Pred = ranges::equal_to> constexpr bool is_permutation(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Proj1 = identity, class Proj2 = identity, indirect_equivalence_relation<projected<iterator_t<R1>, Proj1>, projected<iterator_t<R2>, Proj2>> Pred = ranges::equal_to> constexpr bool is_permutation(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // recherche template<class ForwardIter1, class ForwardIter2> constexpr ForwardIter1 search(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ForwardIter1, class ForwardIter2, class BinaryPred> constexpr ForwardIter1 search(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter1 search(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> ForwardIter1 search(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, BinaryPred pred); namespace ranges { template<forward_iterator I1, sentinel_for<I1> S1, forward_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr subrange<I1> search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<forward_range R1, forward_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr borrowed_subrange_t<R1> search(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } template<class ForwardIter, class Size, class T = typename iterator_traits<ForwardIter>::value_type> constexpr ForwardIter search_n(ForwardIter first, ForwardIter last, Size count, const T& value); template<class ForwardIter, class Size, class T = typename iterator_traits<ForwardIter>::value_type, class BinaryPred> constexpr ForwardIter search_n(ForwardIter first, ForwardIter last, Size count, const T& value, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter, class Size, class T = typename iterator_traits<ForwardIter>::value_type> ForwardIter search_n(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Size count, const T& value); template<class ExecutionPolicy, class ForwardIter, class Size, class T = typename iterator_traits<ForwardIter>::value_type, class BinaryPred> ForwardIter search_n(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Size count, const T& value, BinaryPred pred); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Pred = ranges::equal_to, class Proj = identity, class T = projected_value_t<I, Proj>> requires indirectly_comparable<I, const T*, Pred, Proj> constexpr subrange<I> search_n(I first, S last, iter_difference_t<I> count, const T& value, Pred pred = {}, Proj proj = {}); template<forward_range R, class Pred = ranges::equal_to, class Proj = identity, projected_value_t<iterator_t<R>, Proj>> requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj> constexpr borrowed_subrange_t<R> search_n(R&& r, range_difference_t<R> count, const T& value, Pred pred = {}, Proj proj = {}); } template<class ForwardIter, class Searcher> constexpr ForwardIter search(ForwardIter first, ForwardIter last, const Searcher& searcher); namespace ranges { // commence par template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr bool starts_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr bool starts_with(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // se termine par template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires (forward_iterator<I1> || sized_sentinel_for<S1, I1>) && (forward_iterator<I2> || sized_sentinel_for<S2, I2>) && indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr bool ends_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires (forward_range<R1> || sized_range<R1>) && (forward_range<R2> || sized_range<R2>) && indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr bool ends_with(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // plier template<class F> class /* inversé */ { // exposition uniquement F f; // exposition uniquement public: template<class T, class U> requires invocable<F&, U, T> invoke_result_t<F&, U, T> operator()(T&&, U&&); }; template<class F, class T, class I, class U> concept /* indirectly-binary-left-foldable-impl */ = // exposition uniquement movable<T> && movable<U> && convertible_to<T, U> && invocable<F&, U, iter_reference_t<I>> && assignable_from<U&, invoke_result_t<F&, U, iter_reference_t<I>>>; template<class F, class T, class I> concept /* indirectement-pliable-binaire-à-gauche */ = // exposition uniquement copy_constructible<F> && indirectly_readable<I> && invocable<F&, T, iter_reference_t<I>> && convertible_to<invoke_result_t<F&, T, iter_reference_t<I>>, decay_t<invoke_result_t<F&, T, iter_reference_t<I>>>> && /* indirectly-binary-left-foldable-impl */ <F, T, I, decay_t<invoke_result_t<F&, T, iter_reference_t<I>>>>; template<class F, class T, class I> concept /* indirectement-pliable-droite-binaire */ = // exposition uniquement /* indirectement-pliable-binaire-à-gauche */</* inversé */<F>, T, I>; template<input_iterator I, sentinel_for<I> S, class T = iter_value_t<I>, /* indirectement-pliable-binaire-à-gauche */<T, I> F> constexpr auto fold_left(I first, S last, T init, F f); template<input_range R, class T = range_value_t<R>, /* indirectement-pliable-binaire-à-gauche */<T, iterator_t<R>> F> constexpr auto fold_left(R&& r, T init, F f); template<input_iterator I, sentinel_for<I> S, /* indirectement-binaire-pliage-gauche */<iter_value_t<I>, I> F> requires constructible_from<iter_value_t<I>, iter_reference_t<I>> constexpr auto fold_left_first(I first, S last, F f); template<input_range R, /* indirectement-pliable-binaire-à-gauche */<range_value_t<R>, iterator_t<R>> F> requires constructible_from<range_value_t<R>, range_reference_t<R>> constexpr auto fold_left_first(R&& r, F f); template<bidirectional_iterator I, sentinel_for<I> S, class T = iter_value_t<I>, /* indirectement-pliable-droite-binaire */<T, I> F> constexpr auto fold_right(I first, S last, T init, F f); template<bidirectional_range R, class T = range_value_t<R>, /* indirectement-pliable-droite-binaire */<T, iterator_t<R>> F> constexpr auto fold_right(R&& r, T init, F f); template<bidirectional_iterator I, sentinel_for<I> S, /* indirectement-pliable-droite-binaire */<iter_value_t<I>, I> F> requires constructible_from<iter_value_t<I>, iter_reference_t<I>> constexpr auto fold_right_last(I first, S last, F f); template<bidirectional_range R, /* indirectement-pliable-droite-binaire */<range_value_t<R>, iterator_t<R>> F> requires constructible_from<range_value_t<R>, range_reference_t<R>> constexpr auto fold_right_last(R&& r, F f); template<class I, class T> using fold_left_with_iter_result = in_value_result<I, T>; template<class I, class T> using fold_left_first_with_iter_result = in_value_result<I, T>; template<input_iterator I, sentinel_for<I> S, class T = iter_value_t<I>, /* indirectement-pliable-binaire-à-gauche */<T, I> F> constexpr /* voir description */ fold_left_with_iter(I first, S last, T init, F f); template<input_range R, class T = range_value_t<R>, /* indirectement-binaire-pliage-gauche */<T, iterator_t<R>> F> constexpr /* voir description */ fold_left_with_iter(R&& r, T init, F f); template<input_iterator I, sentinel_for<I> S, /* indirectement-pliable-binaire-à-gauche */<iter_value_t<I>, I> F> requires constructible_from<iter_value_t<I>, iter_reference_t<I>> constexpr /* voir description */ fold_left_first_with_iter(I first, S last, F f); template<input_range R, /* indirectement-pliable-binaire-à-gauche */<range_value_t<R>, iterator_t<R>> F> requires constructible_from<range_value_t<R>, range_reference_t<R>> constexpr /* voir description */ fold_left_first_with_iter(R&& r, F f); } // opérations de mutation de séquence // copie template<class InputIter, class OutputIter> constexpr OutputIter copy(InputIter first, InputIter last, OutputIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter2 copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result); namespace ranges { template<class I, class O> using copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O> requires indirectly_copyable<I, O> constexpr copy_result<I, O> copy(I first, S last, O result); template<input_range R, weakly_incrementable O> requires indirectly_copyable<iterator_t<R>, O> constexpr copy_result<borrowed_iterator_t<R>, O> copy(R&& r, O result); } template<class InputIter, class Size, class OutputIter> constexpr OutputIter copy_n(InputIter first, Size n, OutputIter result); template<class ExecutionPolicy, class ForwardIter1, class Size, class ForwardIter2> ForwardIter2 copy_n(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, Size n, ForwardIter2 result); namespace ranges { template<class I, class O> using copy_n_result = in_out_result<I, O>; template<input_iterator I, weakly_incrementable O> requires indirectly_copyable<I, O> constexpr copy_n_result<I, O> copy_n(I first, iter_difference_t<I> n, O result); } template<class InputIter, class OutputIter, class Pred> constexpr OutputIter copy_if(InputIter first, InputIter last, OutputIter result, Pred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class Pred> ForwardIter2 copy_if(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result, Pred pred); namespace ranges { template<class I, class O> using copy_if_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> requires indirectly_copyable<I, O> constexpr copy_if_result<I, O> copy_if(I first, S last, O result, Pred pred, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires indirectly_copyable<iterator_t<R>, O> constexpr copy_if_result<borrowed_iterator_t<R>, O> copy_if(R&& r, O result, Pred pred, Proj proj = {}); } template<class BidirectionalIter1, class BidirectionalIter2> constexpr BidirectionalIter2 copy_backward(BidirectionalIter1 first, BidirectionalIter1 last, BidirectionalIter2 result); namespace ranges { template<class I1, class I2> using copy_backward_result = in_out_result<I1, I2>; template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2> requires indirectly_copyable<I1, I2> constexpr copy_backward_result<I1, I2> copy_backward(I1 first, S1 last, I2 result); template<bidirectional_range R, bidirectional_iterator I> requires indirectly_copyable<iterator_t<R>, I> constexpr copy_backward_result<borrowed_iterator_t<R>, I> copy_backward(R&& r, I result); } // déplacer template<class InputIter, class OutputIter> constexpr OutputIter move(InputIter first, InputIter last, OutputIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter2 move(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result); namespace ranges { template<class I, class O> using move_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O> requires indirectly_movable<I, O> constexpr move_result<I, O> move(I first, S last, O result); template<input_range R, weakly_incrementable O> requires indirectly_movable<iterator_t<R>, O> constexpr move_result<borrowed_iterator_t<R>, O> move(R&& r, O result); } template<class BidirectionalIter1, class BidirectionalIter2> constexpr BidirectionalIter2 move_backward(BidirectionalIter1 first, BidirectionalIter1 last, BidirectionalIter2 result); namespace ranges { template<class I1, class I2> using move_backward_result = in_out_result<I1, I2>; template<bidirectional_iterator I1, sentinel_for<I1> S1, bidirectional_iterator I2> requires indirectly_movable<I1, I2> constexpr move_backward_result<I1, I2> move_backward(I1 first, S1 last, I2 result); template<bidirectional_range R, bidirectional_iterator I> requires indirectly_movable<iterator_t<R>, I> constexpr move_backward_result<borrowed_iterator_t<R>, I> move_backward(R&& r, I result); } // échanger template<class ForwardIter1, class ForwardIter2> constexpr ForwardIter2 swap_ranges(ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter2 swap_ranges(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2); namespace ranges { template<class I1, class I2> using swap_ranges_result = in_in_result<I1, I2>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2> requires indirectly_swappable<I1, I2> constexpr swap_ranges_result<I1, I2> swap_ranges(I1 first1, S1 last1, I2 first2, S2 last2); template<input_range R1, input_range R2> requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>> constexpr swap_ranges_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> swap_ranges(R1&& r1, R2&& r2); } template<class ForwardIter1, class ForwardIter2> constexpr void iter_swap(ForwardIter1 a, ForwardIter2 b); // transform template<class InputIter, class OutputIter, class UnaryOperation> constexpr OutputIter transform(InputIter first1, InputIter last1, OutputIter result, UnaryOperation op); template<class InputIter1, class InputIter2, class OutputIter, class BinaryOperation> constexpr OutputIter transform(InputIter1 first1, InputIter1 last1, InputIter2 first2, OutputIter result, BinaryOperation binary_op); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class UnaryOperation> ForwardIter2 transform(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 result, UnaryOperation op); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter, class BinaryOperation> ForwardIter transform(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter result, BinaryOperation binary_op); namespace ranges { template<class I, class O> using unary_transform_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, copy_constructible F, class Proj = identity> requires indirectly_writable<O, indirect_result_t<F&, projected<I, Proj>>> constexpr unary_transform_result<I, O> transform(I first1, S last1, O result, F op, Proj proj = {}); template<input_range R, weakly_incrementable O, copy_constructible F, class Proj = identity> requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>> constexpr unary_transform_result<borrowed_iterator_t<R>, O> transform(R&& r, O result, F op, Proj proj = {}); template<class I1, class I2, class O> using binary_transform_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, weakly_incrementable O, copy_constructible F, class Proj1 = identity, class Proj2 = identity> requires indirectly_writable<O, indirect_result_t<F&, projected<I1, Proj1>, projected<I2, Proj2>>> constexpr binary_transform_result<I1, I2, O> transform(I1 first1, S1 last1, I2 first2, S2 last2, O result, F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, weakly_incrementable O, copy_constructible F, class Proj1 = identity, class Proj2 = identity> requires indirectly_writable <O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>, projected<iterator_t<R2>, Proj2>>> constexpr binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> transform(R1&& r1, R2&& r2, O result, F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); } // remplacer template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> constexpr void replace(ForwardIter first, ForwardIter last, const T& old_value, const T& new_value); template<class ExecutionPolicy, class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> void replace(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, const T& old_value, const T& new_value); template<class ForwardIter, class Pred, class T = typename iterator_traits<ForwardIter>::value_type> constexpr void replace_if(ForwardIter first, ForwardIter last, Pred pred, const T& new_value); template<class ExecutionPolicy, class ForwardIter, class Pred, class T = typename iterator_traits<ForwardIter>::value_type> void replace_if(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred, const T& new_value); namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity, class T1 = projected_value_t<I, Proj>, class T2 = T1> requires indirectly_writable<I, const T2&> && indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> constexpr I replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); template<input_range R, class Proj = identity, class T1 = projected_value_t<iterator_t<R>, Proj>, class T2 = T1> requires indirectly_writable<iterator_t<R>, const T2&> && indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*> constexpr borrowed_iterator_t<R> replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); template<input_iterator I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_unary_predicate<projected<I, Proj>> Pred> requires indirectly_writable<I, const T&> constexpr I replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); template<input_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires indirectly_writable<iterator_t<R>, const T&> constexpr borrowed_iterator_t<R> replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); } template<class InputIter, class OutputIter, class T> constexpr OutputIter replace_copy(InputIter first, InputIter last, OutputIter result, const T& old_value, const T& new_value); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class T> ForwardIter2 replace_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result, const T& old_value, const T& new_value); template<class InputIter, class OutputIter, class Pred, class T = typename iterator_traits<OutputIter>::value_type> constexpr OutputIter replace_copy_if(InputIter first, InputIter last, OutputIter result, Pred pred, const T& new_value); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class Pred, class T = typename iterator_traits<ForwardIter2>::value_type> ForwardIter2 replace_copy_if(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result, Pred pred, const T& new_value); namespace ranges { template<class I, class O> using replace_copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, class O, class Proj = identity, class T1 = projected_value_t<I, Proj>, class T2 = iter_value_t<O>> requires indirectly_copyable<I, O> && indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T1*> && output_iterator<O, const T2&> constexpr replace_copy_result<I, O> replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value, Proj proj = {}); template<input_range R, class O, class Proj = identity, class T1 = projected_value_t<iterator_t<R>, Proj>, class T2 = iter_value_t<O>> requires indirectly_copyable<iterator_t<R>, O> && indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*> && output_iterator<O, const T2&> constexpr replace_copy_result<borrowed_iterator_t<R>, O> replace_copy(R&& r, O result, const T1& old_value, const T2& new_value, Proj proj = {}); template<class I, class O> using replace_copy_if_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, class O, class T = iter_value_t<O>, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> requires indirectly_copyable<I, O> && output_iterator<O, const T&> constexpr replace_copy_if_result<I, O> replace_copy_if(I first, S last, O result, Pred pred, const T& new_value, Proj proj = {}); template<input_range R, class O, class T = iter_value_t<O>, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires indirectly_copyable<iterator_t<R>, O> && output_iterator<O, const T&> constexpr replace_copy_if_result<borrowed_iterator_t<R>, O> replace_copy_if(R&& r, O result, Pred pred, const T& new_value, Proj proj = {}); } // remplir template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> constexpr void fill(ForwardIter first, ForwardIter last, const T& value); template<class ExecutionPolicy, class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> void fill(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, const T& value); template<class OutputIter, class Size, class T = typename iterator_traits<OutputIter>::value_type> constexpr OutputIter fill_n(OutputIter first, Size n, const T& value); template<class ExecutionPolicy, class ForwardIter, class Size, class T = typename iterator_traits<OutputIter>::value_type> ForwardIter fill_n(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, Size n, const T& value); namespace ranges { template<class O, sentinel_for<O> S, class T = iter_value_t<O>> requires output_iterator<O, const T&> constexpr O fill(O first, S last, const T& value); template<class R, class T = range_value_t<R>> requires output_range<R, const T&> constexpr borrowed_iterator_t<R> fill(R&& r, const T& value); template<class O, class T = iter_value_t<O>> requires output_iterator<O, const T&> constexpr O fill_n(O first, iter_difference_t<O> n, const T& value); } // générer template<class ForwardIter, class Generator> constexpr void generate(ForwardIter first, ForwardIter last, Generator gen); template<class ExecutionPolicy, class ForwardIter, class Generator> void generate(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Generator gen); template<class OutputIter, class Size, class Generator> constexpr OutputIter generate_n(OutputIter first, Size n, Generator gen); template<class ExecutionPolicy, class ForwardIter, class Size, class Generator> ForwardIter generate_n(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, Size n, Generator gen); namespace ranges { template<input_or_output_iterator O, sentinel_for<O> S, copy_constructible F> requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> constexpr O generate(O first, S last, F gen); template<class R, copy_constructible F> requires invocable<F&> && output_range<R, invoke_result_t<F&>> constexpr borrowed_iterator_t<R> generate(R&& r, F gen); template<input_or_output_iterator O, copy_constructible F> requires invocable<F&> && indirectly_writable<O, invoke_result_t<F&>> constexpr O generate_n(O first, iter_difference_t<O> n, F gen); } // supprimer template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> constexpr ForwardIter remove(ForwardIter first, ForwardIter last, const T& value); template<class ExecutionPolicy, class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> ForwardIter remove(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, const T& value); template<class ForwardIter, class Pred> constexpr ForwardIter remove_if(ForwardIter first, ForwardIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> ForwardIter remove_if(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<permutable I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>> requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> constexpr subrange<I> remove(I first, S last, const T& value, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>> requires permutable<iterator_t<R>> && indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> constexpr borrowed_subrange_t<R> remove(R&& r, const T& value, Proj proj = {}); template<permutable I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr subrange<I> remove_if(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires permutable<iterator_t<R>> constexpr borrowed_subrange_t<R> remove_if(R&& r, Pred pred, Proj proj = {}); } template<class InputIter, class OutputIter, class T = typename iterator_traits<InputIter>::value_type> constexpr OutputIter remove_copy(InputIter first, InputIter last, OutputIter result, const T& value); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class T = typename iterator_traits<ForwardIter1>::value_type> ForwardIter2 remove_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result, const T& value); template<class InputIter, class OutputIter, class Pred> constexpr OutputIter remove_copy_if(InputIter first, InputIter last, OutputIter result, Pred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class Pred> ForwardIter2 remove_copy_if(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result, Pred pred); namespace ranges { template<class I, class O> using remove_copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, class T = projected_value_t<I, Proj>> requires indirectly_copyable<I, O> && indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> constexpr remove_copy_result<I, O> remove_copy(I first, S last, O result, const T& value, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>> requires indirectly_copyable<iterator_t<R>, O> && indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> constexpr remove_copy_result<borrowed_iterator_t<R>, O> remove_copy(R&& r, O result, const T& value, Proj proj = {}); template<class I, class O> using remove_copy_if_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> requires indirectly_copyable<I, O> constexpr remove_copy_if_result<I, O> remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires indirectly_copyable<iterator_t<R>, O> constexpr remove_copy_if_result<borrowed_iterator_t<R>, O> remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); } // unique template<class ForwardIter> constexpr ForwardIter unique(ForwardIter first, ForwardIter last); template<class ForwardIter, class BinaryPred> constexpr ForwardIter unique(ForwardIter first, ForwardIter last, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter> ForwardIter unique(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last); template<class ExecutionPolicy, class ForwardIter, class BinaryPred> ForwardIter unique(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, BinaryPred pred); namespace ranges { template<permutable I, sentinel_for<I> S, class Proj = identity, indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to> constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_equivalence_relation <projected<iterator_t<R>, Proj>> C = ranges::equal_to> requires permutable<iterator_t<R>> constexpr borrowed_subrange_t<R> unique(R&& r, C comp = {}, Proj proj = {}); } template<class InputIter, class OutputIter> constexpr OutputIter unique_copy(InputIter first, InputIter last, OutputIter result); template<class InputIter, class OutputIter, class BinaryPred> constexpr OutputIter unique_copy(InputIter first, InputIter last, OutputIter result, BinaryPred pred); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter2 unique_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class BinaryPred> ForwardIter2 unique_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 last, ForwardIter2 result, BinaryPred pred); namespace ranges { template<class I, class O> using unique_copy_result = in_out_result<I, O>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Proj = identity, indirect_equivalence_relation<projected<I, Proj>> C = ranges::equal_to> requires indirectly_copyable<I, O> && (forward_iterator<I> || (input_iterator<O> && same_as<iter_value_t<I>, iter_value_t<O>>) || indirectly_copyable_storable<I, O>) constexpr unique_copy_result<I, O> unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); template<input_range R, weakly_incrementable O, class Proj = identity, indirect_equivalence_relation <projected<iterator_t<R>, Proj>> C = ranges::equal_to> requires indirectly_copyable<iterator_t<R>, O> && (forward_iterator<iterator_t<R>> || (input_iterator<O> && same_as<range_value_t<R>, iter_value_t<O>>) || indirectly_copyable_storable<iterator_t<R>, O>) constexpr unique_copy_result<borrowed_iterator_t<R>, O> unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); } // inverser template<class BidirectionalIter> constexpr void reverse(BidirectionalIter first, BidirectionalIter last); template<class ExecutionPolicy, class BidirectionalIter> void reverse(ExecutionPolicy&& exec, // freestanding-deleted BidirectionalIter first, BidirectionalIter last); namespace ranges { template<bidirectional_iterator I, sentinel_for<I> S> requires permutable<I> constexpr I reverse(I first, S last); template<bidirectional_range R> requires permutable<iterator_t<R>> constexpr borrowed_iterator_t<R> reverse(R&& r); } template<class BidirectionalIter, class OutputIter> constexpr OutputIter reverse_copy(BidirectionalIter first, BidirectionalIter last, OutputIter result); template<class ExecutionPolicy, class BidirectionalIter, class ForwardIter> ForwardIter reverse_copy(ExecutionPolicy&& exec, // freestanding-deleted BidirectionalIter first, BidirectionalIter last, ForwardIter result); namespace ranges { template<class I, class O> using reverse_copy_result = in_out_result<I, O>; template<bidirectional_iterator I, sentinel_for<I> S, weakly_incrementable O> requires indirectly_copyable<I, O> constexpr reverse_copy_result<I, O> reverse_copy(I first, S last, O result); template<bidirectional_range R, weakly_incrementable O> requires indirectly_copyable<iterator_t<R>, O> constexpr reverse_copy_result<borrowed_iterator_t<R>, O> reverse_copy(R&& r, O result); } // rotation template<class ForwardIter> constexpr ForwardIter rotate(ForwardIter first, ForwardIter middle, ForwardIter last); template<class ExecutionPolicy, class ForwardIter> ForwardIter rotate(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter middle, ForwardIter last); namespace ranges { template<permutable I, sentinel_for<I> S> constexpr subrange<I> rotate(I first, I middle, S last); template<forward_range R> requires permutable<iterator_t<R>> constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); } template<class ForwardIter, class OutputIter> constexpr OutputIter rotate_copy(ForwardIter first, ForwardIter middle, ForwardIter last, OutputIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> ForwardIter2 rotate_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first, ForwardIter1 middle, ForwardIter1 last, ForwardIter2 result); namespace ranges { template<class I, class O> using rotate_copy_result = in_out_result<I, O>; template<forward_iterator I, sentinel_for<I> S, weakly_incrementable O> requires indirectly_copyable<I, O> constexpr rotate_copy_result<I, O> rotate_copy(I first, I middle, S last, O result); template<forward_range R, weakly_incrementable O> requires indirectly_copyable<iterator_t<R>, O> constexpr rotate_copy_result<borrowed_iterator_t<R>, O> rotate_copy(R&& r, iterator_t<R> middle, O result); } // échantillon template<class PopulationIter, class SampleIter, class Distance, class UniformRandomBitGenerator> SampleIter sample(PopulationIter first, PopulationIter last, SampleIter out, Distance n, UniformRandomBitGenerator&& g); namespace ranges { template<input_iterator I, sentinel_for<I> S, weakly_incrementable O, class Gen> requires (forward_iterator<I> || random_access_iterator<O>) && indirectly_copyable<I, O> && uniform_random_bit_generator<remove_reference_t<Gen>> O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g); template<input_range R, weakly_incrementable O, class Gen> requires (forward_range<R> || random_access_iterator<O>) && indirectly_copyable<iterator_t<R>, O> && uniform_random_bit_generator<remove_reference_t<Gen>> O sample(R&& r, O out, range_difference_t<R> n, Gen&& g); } // mélanger template<class RandomAccessIter, class UniformRandomBitGenerator> void shuffle(RandomAccessIter first, RandomAccessIter last, UniformRandomBitGenerator&& g); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Gen> requires permutable<I> && uniform_random_bit_generator<remove_reference_t<Gen>> I shuffle(I first, S last, Gen&& g); template<random_access_range R, class Gen> requires permutable<iterator_t<R>> && uniform_random_bit_generator<remove_reference_t<Gen>> borrowed_iterator_t<R> shuffle(R&& r, Gen&& g); } // décalage template<class ForwardIter> constexpr ForwardIter shift_left(ForwardIter first, ForwardIter last, typename iterator_traits<ForwardIter>::difference_type n); template<class ExecutionPolicy, class ForwardIter> ForwardIter shift_left(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, typename iterator_traits<ForwardIter>::difference_type n); namespace ranges { template<permutable I, sentinel_for<I> S> constexpr subrange<I> shift_left(I first, S last, iter_difference_t<I> n); template<forward_range R> requires permutable<iterator_t<R>> constexpr borrowed_subrange_t<R> shift_left(R&& r, range_difference_t<R> n); } template<class ForwardIter> constexpr ForwardIter shift_right(ForwardIter first, ForwardIter last, typename iterator_traits<ForwardIter>::difference_type n); template<class ExecutionPolicy, class ForwardIter> ForwardIter shift_right(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, typename iterator_traits<ForwardIter>::difference_type n); namespace ranges { template<permutable I, sentinel_for<I> S> constexpr subrange<I> shift_right(I first, S last, iter_difference_t<I> n); template<forward_range R> requires permutable<iterator_t<R>> constexpr borrowed_subrange_t<R> shift_right(R&& r, range_difference_t<R> n); } // tri et opérations associées // tri template<class RandomAccessIter> constexpr void sort(RandomAccessIter first, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr void sort(RandomAccessIter first, RandomAccessIter last, Compare comp); template<class ExecutionPolicy, class RandomAccessIter> void sort(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter last); template<class ExecutionPolicy, class RandomAccessIter, class Compare> void sort(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr I sort(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr borrowed_iterator_t<R> sort(R&& r, Comp comp = {}, Proj proj = {}); } template<class RandomAccessIter> void stable_sort(RandomAccessIter first, RandomAccessIter last); // hébergé template<class RandomAccessIter, class Compare> void stable_sort(RandomAccessIter first, RandomAccessIter last, Compare comp); // hébergé template<class ExecutionPolicy, class RandomAccessIter> void stable_sort(ExecutionPolicy&& exec, // hébergé RandomAccessIter first, RandomAccessIter last); template<class ExecutionPolicy, class RandomAccessIter, class Compare> void stable_sort(ExecutionPolicy&& exec, // hébergé RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> I stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // hébergé template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> borrowed_iterator_t<R> stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // hébergé } template<class RandomAccessIter> constexpr void partial_sort(RandomAccessIter first, RandomAccessIter middle, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr void partial_sort(RandomAccessIter first, RandomAccessIter middle, RandomAccessIter last, Compare comp); template<class ExecutionPolicy, class RandomAccessIter> void partial_sort(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter middle, RandomAccessIter last); template<class ExecutionPolicy, class RandomAccessIter, class Compare> void partial_sort(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter middle, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr I partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr borrowed_iterator_t<R> partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); } template<class InputIter, class RandomAccessIter> constexpr RandomAccessIter partial_sort_copy(InputIter first, InputIter last, RandomAccessIter result_first, RandomAccessIter result_last); template<class InputIter, class RandomAccessIter, class Compare> constexpr RandomAccessIter partial_sort_copy(InputIter first, InputIter last, RandomAccessIter result_first, RandomAccessIter result_last, Compare comp); template<class ExecutionPolicy, class ForwardIter, class RandomAccessIter> RandomAccessIter partial_sort_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, RandomAccessIter result_first, RandomAccessIter result_last); template<class ExecutionPolicy, class ForwardIter, class RandomAccessIter, class Compare> RandomAccessIter partial_sort_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, RandomAccessIter result_first, RandomAccessIter result_last, Compare comp); namespace ranges { template<class I, class O> using partial_sort_copy_result = in_out_result<I, O>; template<input_iterator I1, sentinel_for<I1> S1, random_access_iterator I2, sentinel_for<I2> S2, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires indirectly_copyable<I1, I2> && sortable<I2, Comp, Proj2> && indirect_strict_weak_order<Comp, projected<I1, Proj1>, projected<I2, Proj2>> constexpr partial_sort_copy_result<I1, I2> partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, random_access_range R2, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> && sortable<iterator_t<R2>, Comp, Proj2> && indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>, projected<iterator_t<R2>, Proj2>> constexpr partial_sort_copy_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>> partial_sort_copy(R1&& r, R2&& result_r, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } template<class ForwardIter> constexpr bool is_sorted(ForwardIter first, ForwardIter last); template<class ForwardIter, class Compare> constexpr bool is_sorted(ForwardIter first, ForwardIter last, Compare comp); template<class ExecutionPolicy, class ForwardIter> bool is_sorted(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last); template<class ExecutionPolicy, class ForwardIter, class Compare> bool is_sorted(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> constexpr bool is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr bool is_sorted(R&& r, Comp comp = {}, Proj proj = {}); } template<class ForwardIter> constexpr ForwardIter is_sorted_until(ForwardIter first, ForwardIter last); template<class ForwardIter, class Compare> constexpr ForwardIter is_sorted_until(ForwardIter first, ForwardIter last, Compare comp); template<class ExecutionPolicy, class ForwardIter> ForwardIter is_sorted_until(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last); template<class ExecutionPolicy, class ForwardIter, class Compare> ForwardIter is_sorted_until(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> constexpr I is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr borrowed_iterator_t<R> is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); } // Élément N-ième template<class RandomAccessIter> constexpr void nth_element(RandomAccessIter first, RandomAccessIter nth, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr void nth_element(RandomAccessIter first, RandomAccessIter nth, RandomAccessIter last, Compare comp); template<class ExecutionPolicy, class RandomAccessIter> void nth_element(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter nth, RandomAccessIter last); template<class ExecutionPolicy, class RandomAccessIter, class Compare> void nth_element(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter nth, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr I nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr borrowed_iterator_t<R> nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); } // recherche binaire template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> constexpr ForwardIter lower_bound(ForwardIter first, ForwardIter last, const T& value); template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type, class Compare> constexpr ForwardIter lower_bound(ForwardIter first, ForwardIter last, const T& value, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> constexpr I lower_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>, indirect_strict_weak_order <const T*, projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr borrowed_iterator_t<R> lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); } template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> constexpr ForwardIter upper_bound(ForwardIter first, ForwardIter last, const T& value); template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type, class Compare> constexpr ForwardIter upper_bound(ForwardIter first, ForwardIter last, const T& value, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class T, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>, indirect_strict_weak_order <const T*, projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr borrowed_iterator_t<R> upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); } template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> constexpr pair<ForwardIter, ForwardIter> equal_range(ForwardIter first, ForwardIter last, const T& value); template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type, class Compare> constexpr pair<ForwardIter, ForwardIter> equal_range(ForwardIter first, ForwardIter last, const T& value, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> constexpr subrange<I> equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>, indirect_strict_weak_order <const T*, projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr borrowed_subrange_t<R> equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); } template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type> constexpr bool binary_search(ForwardIter first, ForwardIter last, const T& value); template<class ForwardIter, class T = typename iterator_traits<ForwardIter>::value_type, class Compare> constexpr bool binary_search(ForwardIter first, ForwardIter last, const T& value, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, class T = projected_value_t<I, Proj>, indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> constexpr bool binary_search(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>, indirect_strict_weak_order <const T*, projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr bool binary_search(R&& r, const T& value, Comp comp = {}, Proj proj = {}); } // partitions template<class InputIter, class Pred> constexpr bool is_partitioned(InputIter first, InputIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> bool is_partitioned(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<input_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr bool is_partitioned(I first, S last, Pred pred, Proj proj = {}); template<input_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr bool is_partitioned(R&& r, Pred pred, Proj proj = {}); } template<class ForwardIter, class Pred> constexpr ForwardIter partition(ForwardIter first, ForwardIter last, Pred pred); template<class ExecutionPolicy, class ForwardIter, class Pred> ForwardIter partition(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<permutable I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr subrange<I> partition(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires permutable<iterator_t<R>> constexpr borrowed_subrange_t<R> partition(R&& r, Pred pred, Proj proj = {}); } template<class BidirectionalIter, class Pred> BidirectionalIter stable_partition(BidirectionalIter first, // hébergé BidirectionalIter last, Pred pred); template<class ExecutionPolicy, class BidirectionalIter, class Pred> BidirectionalIter stable_partition(ExecutionPolicy&& exec, // hébergé BidirectionalIter first, BidirectionalIter last, Pred pred); namespace ranges { template<bidirectional_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> requires permutable<I> subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // hébergé template<bidirectional_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires permutable<iterator_t<R>> borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // hébergé } template<class InputIter, class OutputIter1, class OutputIter2, class Pred> constexpr pair<OutputIter1, OutputIter2> partition_copy(InputIter first, InputIter last, OutputIter1 out_true, OutputIter2 out_false, Pred pred); template<class ExecutionPolicy, class ForwardIter, class ForwardIter1, class ForwardIter2, class Pred> pair<ForwardIter1, ForwardIter2> partition_copy(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, ForwardIter1 out_true, ForwardIter2 out_false, Pred pred); namespace ranges { template<class I, class O1, class O2> using partition_copy_result = in_out_out_result<I, O1, O2>; template<input_iterator I, sentinel_for<I> S, weakly_incrementable O1, weakly_incrementable O2, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2> constexpr partition_copy_result<I, O1, O2> partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); template<input_range R, weakly_incrementable O1, weakly_incrementable O2, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> requires indirectly_copyable<iterator_t<R>, O1> && indirectly_copyable<iterator_t<R>, O2> constexpr partition_copy_result<borrowed_iterator_t<R>, O1, O2> partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); } template<class ForwardIter, class Pred> constexpr ForwardIter partition_point(ForwardIter first, ForwardIter last, Pred pred); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred> constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> constexpr borrowed_iterator_t<R> partition_point(R&& r, Pred pred, Proj proj = {}); } // fusionner template<class InputIter1, class InputIter2, class OutputIter> constexpr OutputIter merge(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result); template<class InputIter1, class InputIter2, class OutputIter, class Compare> constexpr OutputIter merge(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result, Compare comp); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter> ForwardIter merge(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter, class Compare> ForwardIter merge(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result, Compare comp); namespace ranges { template<class I1, class I2, class O> using merge_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<I1, I2, O, Comp, Proj1, Proj2> constexpr merge_result<I1, I2, O> merge(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> constexpr merge_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> merge(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } template<class BidirectionalIter> void inplace_merge(BidirectionalIter first, BidirectionalIter middle, // hébergé BidirectionalIter last); template<class BidirectionalIter, class Compare> void inplace_merge(BidirectionalIter first, BidirectionalIter middle, // hébergé BidirectionalIter last, Compare comp); template<class ExecutionPolicy, class BidirectionalIter> void inplace_merge(ExecutionPolicy&& exec, // hébergé BidirectionalIter first, BidirectionalIter middle, BidirectionalIter last); template<class ExecutionPolicy, class BidirectionalIter, class Compare> void inplace_merge(ExecutionPolicy&& exec, // hébergé BidirectionalIter first, BidirectionalIter middle, BidirectionalIter last, Compare comp); namespace ranges { template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // hébergé template<bidirectional_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> borrowed_iterator_t<R> inplace_merge(R&& r, iterator_t<R> middle, // hébergé Comp comp = {}, Proj proj = {}); } // opérations sur les ensembles template<class InputIter1, class InputIter2> constexpr bool includes(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2); template<class InputIter1, class InputIter2, class Compare> constexpr bool includes(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, Compare comp); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> bool includes(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class Compare> bool includes(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, Compare comp); namespace ranges { template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order <projected<I1, Proj1>, projected<I2, Proj2>> Comp = ranges::less> constexpr bool includes(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order <projected<iterator_t<R1>, Proj1>, projected<iterator_t<R2>, Proj2>> Comp = ranges::less> constexpr bool includes(R1&& r1, R2&& r2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } template<class InputIter1, class InputIter2, class OutputIter> constexpr OutputIter set_union(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result); template<class InputIter1, class InputIter2, class OutputIter, class Compare> constexpr OutputIter set_union(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result, Compare comp); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter> ForwardIter set_union(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter, class Compare> ForwardIter set_union(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result, Compare comp); namespace ranges { template<class I1, class I2, class O> using set_union_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<I1, I2, O, Comp, Proj1, Proj2> constexpr set_union_result<I1, I2, O> set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> set_union(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } template<class InputIter1, class InputIter2, class OutputIter> constexpr OutputIter set_intersection(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result); template<class InputIter1, class InputIter2, class OutputIter, class Compare> constexpr OutputIter set_intersection(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result, Compare comp); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter> ForwardIter set_intersection(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter, class Compare> ForwardIter set_intersection(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result, Compare comp); namespace ranges { template<class I1, class I2, class O> using set_intersection_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<I1, I2, O, Comp, Proj1, Proj2> constexpr set_intersection_result<I1, I2, O> set_intersection(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> constexpr set_intersection_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> set_intersection(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } template<class InputIter1, class InputIter2, class OutputIter> constexpr OutputIter set_difference(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result); template<class InputIter1, class InputIter2, class OutputIter, class Compare> constexpr OutputIter set_difference(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result, Compare comp); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter> ForwardIter set_difference(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter, class Compare> ForwardIter set_difference(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result, Compare comp); namespace ranges { template<class I, class O> using set_difference_result = in_out_result<I, O>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<I1, I2, O, Comp, Proj1, Proj2> constexpr set_difference_result<I1, O> set_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> constexpr set_difference_result<borrowed_iterator_t<R1>, O> set_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } template<class InputIter1, class InputIter2, class OutputIter> constexpr OutputIter set_symmetric_difference(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result); template<class InputIter1, class InputIter2, class OutputIter, class Compare> constexpr OutputIter set_symmetric_difference(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, OutputIter result, Compare comp); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter> ForwardIter set_symmetric_difference(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class ForwardIter, class Compare> ForwardIter set_symmetric_difference(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, ForwardIter result, Compare comp); namespace ranges { template<class I1, class I2, class O> using set_symmetric_difference_result = in_in_out_result<I1, I2, O>; template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<I1, I2, O, Comp, Proj1, Proj2> constexpr set_symmetric_difference_result<I1, I2, O> set_symmetric_difference(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, weakly_incrementable O, class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O> set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // opérations de tas template<class RandomAccessIter> constexpr void push_heap(RandomAccessIter first, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr void push_heap(RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr I push_heap(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr borrowed_iterator_t<R> push_heap(R&& r, Comp comp = {}, Proj proj = {}); } template<class RandomAccessIter> constexpr void pop_heap(RandomAccessIter first, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr void pop_heap(RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr I pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr borrowed_iterator_t<R> pop_heap(R&& r, Comp comp = {}, Proj proj = {}); } template<class RandomAccessIter> constexpr void make_heap(RandomAccessIter first, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr void make_heap(RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr I make_heap(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr borrowed_iterator_t<R> make_heap(R&& r, Comp comp = {}, Proj proj = {}); } template<class RandomAccessIter> constexpr void sort_heap(RandomAccessIter first, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr void sort_heap(RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr I sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr borrowed_iterator_t<R> sort_heap(R&& r, Comp comp = {}, Proj proj = {}); } template<class RandomAccessIter> constexpr bool is_heap(RandomAccessIter first, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr bool is_heap(RandomAccessIter first, RandomAccessIter last, Compare comp); template<class ExecutionPolicy, class RandomAccessIter> bool is_heap(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter last); template<class ExecutionPolicy, class RandomAccessIter, class Compare> bool is_heap(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); } template<class RandomAccessIter> constexpr RandomAccessIter is_heap_until(RandomAccessIter first, RandomAccessIter last); template<class RandomAccessIter, class Compare> constexpr RandomAccessIter is_heap_until(RandomAccessIter first, RandomAccessIter last, Compare comp); template<class ExecutionPolicy, class RandomAccessIter> RandomAccessIter is_heap_until(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter last); template<class ExecutionPolicy, class RandomAccessIter, class Compare> RandomAccessIter is_heap_until(ExecutionPolicy&& exec, // freestanding-deleted RandomAccessIter first, RandomAccessIter last, Compare comp); namespace ranges { template<random_access_iterator I, sentinel_for<I> S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); template<random_access_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr borrowed_iterator_t<R> is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); } // minimum et maximum template<class T> constexpr const T& min(const T& a, const T& b); template<class T, class Compare> constexpr const T& min(const T& a, const T& b, Compare comp); template<class T> constexpr T min(initializer_list<T> t); template<class T, class Compare> constexpr T min(initializer_list<T> t, Compare comp); namespace ranges { template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); template<copyable T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); template<input_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> constexpr range_value_t<R> min(R&& r, Comp comp = {}, Proj proj = {}); } template<class T> constexpr const T& max(const T& a, const T& b); template<class T, class Compare> constexpr const T& max(const T& a, const T& b, Compare comp); template<class T> constexpr T max(initializer_list<T> t); template<class T, class Compare> constexpr T max(initializer_list<T> t, Compare comp); namespace ranges { template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); template<copyable T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); template<input_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> constexpr range_value_t<R> max(R&& r, Comp comp = {}, Proj proj = {}); } template<class T> constexpr pair<const T&, const T&> minmax(const T& a, const T& b); template<class T, class Compare> constexpr pair<const T&, const T&> minmax(const T& a, const T& b, Compare comp); template<class T> constexpr pair<T, T> minmax(initializer_list<T> t); template<class T, class Compare> constexpr pair<T, T> minmax(initializer_list<T> t, Compare comp); namespace ranges { template<class T> using minmax_result = min_max_result<T>; template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> constexpr minmax_result<const T&> minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); template<copyable T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> constexpr minmax_result<T> minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); template<input_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*> constexpr minmax_result<range_value_t<R>> minmax(R&& r, Comp comp = {}, Proj proj = {}); } template<class ForwardIter> constexpr ForwardIter min_element(ForwardIter first, ForwardIter last); template<class ForwardIter, class Compare> constexpr ForwardIter min_element(ForwardIter first, ForwardIter last, Compare comp); template<class ExecutionPolicy, class ForwardIter> ForwardIter min_element(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last); template<class ExecutionPolicy, class ForwardIter, class Compare> ForwardIter min_element(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {}); } template<class ForwardIter> constexpr ForwardIter max_element(ForwardIter first, ForwardIter last); template<class ForwardIter, class Compare> constexpr ForwardIter max_element(ForwardIter first, ForwardIter last, Compare comp); template<class ExecutionPolicy, class ForwardIter> ForwardIter max_element(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last); template<class ExecutionPolicy, class ForwardIter, class Compare> ForwardIter max_element(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Compare comp); namespace ranges { template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> constexpr I max_element(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr borrowed_iterator_t<R> max_element(R&& r, Comp comp = {}, Proj proj = {}); } template<class ForwardIter> constexpr pair<ForwardIter, ForwardIter> minmax_element(ForwardIter first, ForwardIter last); template<class ForwardIter, class Compare> constexpr pair<ForwardIter, ForwardIter> minmax_element(ForwardIter first, ForwardIter last, Compare comp); template<class ExecutionPolicy, class ForwardIter> pair<ForwardIter, ForwardIter> minmax_element(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last); template<class ExecutionPolicy, class ForwardIter, class Compare> pair<ForwardIter, ForwardIter> minmax_element(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter first, ForwardIter last, Compare comp); namespace ranges { template<class I> using minmax_element_result = min_max_result<I>; template<forward_iterator I, sentinel_for<I> S, class Proj = identity, indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> constexpr minmax_element_result<I> minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); template<forward_range R, class Proj = identity, indirect_strict_weak_order <projected<iterator_t<R>, Proj>> Comp = ranges::less> constexpr minmax_element_result<borrowed_iterator_t<R>> minmax_element(R&& r, Comp comp = {}, Proj proj = {}); } // valeur bornée template<class T> constexpr const T& clamp(const T& v, const T& lo, const T& hi); template<class T, class Compare> constexpr const T& clamp(const T& v, const T& lo, const T& hi, Compare comp); namespace ranges { template<class T, class Proj = identity, indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less> constexpr const T& clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); } // comparaison lexicographique template<class InputIter1, class InputIter2> constexpr bool lexicographical_compare(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2); template<class InputIter1, class InputIter2, class Compare> constexpr bool lexicographical_compare(InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, Compare comp); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2> bool lexicographical_compare(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2); template<class ExecutionPolicy, class ForwardIter1, class ForwardIter2, class Compare> bool lexicographical_compare(ExecutionPolicy&& exec, // freestanding-deleted ForwardIter1 first1, ForwardIter1 last1, ForwardIter2 first2, ForwardIter2 last2, Compare comp); namespace ranges { template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order <projected<I1, Proj1>, projected<I2, Proj2>> Comp = ranges::less> constexpr bool lexicographical_compare(I1 first1, S1 last1, I2 first2, S2 last2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Proj1 = identity, class Proj2 = identity, indirect_strict_weak_order <projected<iterator_t<R1>, Proj1>, projected<iterator_t<R2>, Proj2>> Comp = ranges::less> constexpr bool lexicographical_compare(R1&& r1, R2&& r2, Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); } // algorithmes de comparaison à trois voies template<class InputIter1, class InputIter2, class Cmp> constexpr auto lexicographical_compare_three_way(InputIter1 b1, InputIter1 e1, InputIter2 b2, InputIter2 e2, Cmp comp) -> decltype(comp(*b1, *b2)); template<class InputIter1, class InputIter2> constexpr auto lexicographical_compare_three_way(InputIter1 b1, InputIter1 e1, InputIter2 b2, InputIter2 e2); // permutations template<class BidirectionalIter> constexpr bool next_permutation(BidirectionalIter first, BidirectionalIter last); template<class BidirectionalIter, class Compare> constexpr bool next_permutation(BidirectionalIter first, BidirectionalIter last, Compare comp); namespace ranges { template<class I> using next_permutation_result = in_found_result<I>; template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr next_permutation_result<I> next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); template<bidirectional_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr next_permutation_result<borrowed_iterator_t<R>> next_permutation(R&& r, Comp comp = {}, Proj proj = {}); } template<class BidirectionalIter> constexpr bool prev_permutation(BidirectionalIter first, BidirectionalIter last); template<class BidirectionalIter, class Compare> constexpr bool prev_permutation(BidirectionalIter first, BidirectionalIter last, Compare comp); namespace ranges { template<class I> using prev_permutation_result = in_found_result<I>; template<bidirectional_iterator I, sentinel_for<I> S, class Comp = ranges::less, class Proj = identity> requires sortable<I, Comp, Proj> constexpr prev_permutation_result<I> prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); template<bidirectional_range R, class Comp = ranges::less, class Proj = identity> requires sortable<iterator_t<R>, Comp, Proj> constexpr prev_permutation_result<borrowed_iterator_t<R>> prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); } }
Modèle de classe std::ranges::in_fun_result
namespace std::ranges { template<class I, class F> struct in_fun_result { [[no_unique_address]] I in; [[no_unique_address]] F fun; template<class I2, class F2> requires convertible_to<const I&, I2> && convertible_to<const F&, F2> constexpr operator in_fun_result<I2, F2>() const & { return {in, fun}; } template<class I2, class F2> requires convertible_to<I, I2> && convertible_to<F, F2> constexpr operator in_fun_result<I2, F2>() && { return {std::move(in), std::move(fun)}; } }; }
Modèle de classe std::ranges::in_in_result
namespace std::ranges { template<class I1, class I2> struct in_in_result { [[no_unique_address]] I1 in1; [[no_unique_address]] I2 in2; template<class II1, class II2> requires convertible_to<const I1&, II1> && convertible_to<const I2&, II2> constexpr operator in_in_result<II1, II2>() const & { return {in1, in2}; } template<class II1, class II2> requires convertible_to<I1, II1> && convertible_to<I2, II2> constexpr operator in_in_result<II1, II2>() && { return {std::move(in1), std::move(in2)}; } }; }
` et contient des termes spécifiques au C++. Seul le texte environnant (s'il y en avait) aurait été traduit en français.
Modèle de classe std::ranges::in_out_result
namespace std::ranges { template<class I, class O> struct in_out_result { [[no_unique_address]] I in; [[no_unique_address]] O out; template<class I2, class O2> requires convertible_to<const I&, I2> && convertible_to<const O&, O2> constexpr operator in_out_result<I2, O2>() const & { return {in, out}; } template<class I2, class O2> requires convertible_to<I, I2> && convertible_to<O, O2> constexpr operator in_out_result<I2, O2>() && { return {std::move(in), std::move(out)}; } }; }
Modèle de classe std::ranges::in_in_out_result
namespace std::ranges { template<class I1, class I2, class O> struct in_in_out_result { [[no_unique_address]] I1 in1; [[no_unique_address]] I2 in2; [[no_unique_address]] O out; template<class II1, class II2, class OO> requires convertible_to<const I1&, II1> && convertible_to<const I2&, II2> && convertible_to<const O&, OO> constexpr operator in_in_out_result<II1, II2, OO>() const & { return {in1, in2, out}; } template<class II1, class II2, class OO> requires convertible_to<I1, II1> && convertible_to<I2, II2> && convertible_to<O, OO> constexpr operator in_in_out_result<II1, II2, OO>() && { return {std::move(in1), std::move(in2), std::move(out)}; } }; }
Modèle de classe std::ranges::in_out_out_result
namespace std::ranges { template<class I, class O1, class O2> struct in_out_out_result { [[no_unique_address]] I in; [[no_unique_address]] O1 out1; [[no_unique_address]] O2 out2; template<class II, class OO1, class OO2> requires convertible_to<const I&, II> && convertible_to<const O1&, OO1> && convertible_to<const O2&, OO2> constexpr operator in_out_out_result<II, OO1, OO2>() const & { return {in, out1, out2}; } template<class II, class OO1, class OO2> requires convertible_to<I, II> && convertible_to<O1, OO1> && convertible_to<O2, OO2> constexpr operator in_out_out_result<II, OO1, OO2>() && { return {std::move(in), std::move(out1), std::move(out2)}; } }; }
Modèle de classe std::ranges::min_max_result
namespace std::ranges { template<class T> struct min_max_result { [[no_unique_address]] T min; [[no_unique_address]] T max; template<class T2> requires convertible_to<const T&, T2> constexpr operator min_max_result<T2>() const & { return {min, max}; } template<class T2> requires convertible_to<T, T2> constexpr operator min_max_result<T2>() && { return {std::move(min), std::move(max)}; } }; }
Modèle de classe std::ranges::in_found_result
namespace std::ranges { template<class I> struct in_found_result { [[no_unique_address]] I in; bool found; template<class I2> requires convertible_to<const I&, I2> constexpr operator in_found_result<I2>() const & { return {in, found}; } template<class I2> requires convertible_to<I, I2> constexpr operator in_found_result<I2>() && { return {std::move(in), found}; } }; }
Modèle de classe std::ranges::in_value_result
namespace std::ranges { template<class I, class T> struct in_value_result { [[no_unique_address]] I in; [[no_unique_address]] T value; template<class I2, class T2> requires convertible_to<const I&, I2> && convertible_to<const T&, T2> constexpr operator in_value_result<I2, T2>() const & { return {in, value}; } template<class I2, class T2> requires convertible_to<I, I2> && convertible_to<T, T2> constexpr operator in_value_result<I2, T2>() && { return {std::move(in), std::move(value)}; } }; }
Modèle de classe std::ranges::out_value_result
namespace std::ranges { template<class O, class T> struct out_value_result { [[no_unique_address]] O out; [[no_unique_address]] T value; template<class O2, class T2> requires convertible_to<const O&, O2> && convertible_to<const T&, T2> constexpr operator out_value_result<O2, T2>() const & { return {out, value}; } template<class O2, class T2> requires convertible_to<O, O2> && convertible_to<T, T2> constexpr operator out_value_result<O2, T2>() && { return {std::move(out), std::move(value)}; } }; }