std::includes
Da cppreference.com.
 |
Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.
La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui. |
<metanoindex/>
<tbody> </tbody>| Elemento definito nell'header <algorithm>
|
||
template< class InputIt1, class InputIt2 > bool includes( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2 ); |
(1) | |
template< class InputIt1, class InputIt2 > bool includes( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, Compare comp ); |
(2) | |
Restituisce
true se ogni elemento della gamma [first2, last2) ordinato si trova all'interno del campo di [first, last) ordinato. Anche se restituisce true [first2, last2) è vuoto. Original:
Returns
true if every element from the sorted range [first2, last2) is found within the sorted range [first, last). Also returns true if [first2, last2) is empty. The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
La prima versione si aspetta che entrambe le gamme da ordinare con
operator<, la seconda versione presume che saranno ordinati con la funzione di confronto dato comp.Original:
The first version expects both ranges to be sorted with
operator<, the second version expects them to be sorted with the given comparison function comp.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Parametri
| first1, last1 | - | la gamma ordinata di elementi da esaminare
Original: the sorted range of elements to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| first2, last2 | - | la gamma ordinato di elementi da ricercare
Original: the sorted range of elements to search for The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| comp | - | comparison function which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following:
The signature does not need to have |
| Type requirements | ||
-InputIt must meet the requirements of InputIterator.
| ||
Valore di ritorno
true se ogni elemento da [first2, last2) è un membro di [first, last).Original:
true if every element from [first2, last2) is a member of [first, last).The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Complessità
A confronto la maggior parte 2·(N1+N2-1), dove N1
= std::distance(first1, last1) e N2 = std::distance(first2, last2).Original:
At most 2·(N1+N2-1) comparisons, where N1
= std::distance(first1, last1) and N2 = std::distance(first2, last2).The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Possibile implementazione
| First version |
|---|
template<class InputIt1, class InputIt2>
bool includes(InputIt1 first1, InputIt1 last1,
InputIt2 first2, InputIt2 last2)
{
for (; first2 != last2; ++first1)
{
if (first1 == last1 || *first2 < *first1)
return false;
if ( !(*first1 < *first2) )
++first2;
}
return true;
}
|
| Second version |
template<class InputIt1, class InputIt2>
bool includes(InputIt1 first1, InputIt1 last1,
InputIt2 first2, InputIt2 last2, Compare comp)
{
for (; first2 != last2; ++first1)
{
if (first1 == last1 || comp(*first2, *first1))
return false;
if (!comp(*first1, *first2))
++first2;
}
return true;
}
|
Esempio
#include <iostream>
#include <algorithm>
#include <cctype>
int main()
{
std::vector<char> v1 {'a', 'b', 'c', 'f', 'h', 'x'};
std::vector<char> v2 {'a', 'b', 'c'};
std::vector<char> v3 {'a', 'c'};
std::vector<char> v4 {'g'};
std::vector<char> v5 {'a', 'c', 'g'};
std::vector<char> v6;
for (auto i : v1) std::cout << i << ' ';
std::cout << "includes:\n";
for (auto i : v2) std::cout << i << ' ';
std::cout << ": " << std::includes(v1.begin(), v1.end(), v2.begin(), v2.end()) << '\n';
for (auto i : v3) std::cout << i << ' ';
std::cout << ": " << std::includes(v1.begin(), v1.end(), v3.begin(), v3.end()) << '\n';
for (auto i : v4) std::cout << i << ' ';
std::cout << ": " << std::includes(v1.begin(), v1.end(), v4.begin(), v4.end()) << '\n';
for (auto i : v5) std::cout << i << ' ';
std::cout << ": " << std::includes(v1.begin(), v1.end(), v5.begin(), v5.end()) << '\n';
for (auto i : v6) std::cout << i << ' ';
std::cout << ": " << std::includes(v1.begin(), v1.end(), v6.begin(), v6.end()) << '\n';
auto cmp_nocase = [](char a, char b) {
return std::tolower(a) < std::tolower(b);
}
std::vector<char> v7 {'A', 'B', 'C'};
for (auto i : v7) std::cout << i << ' ';
std::cout << ": "
<< std::includes(v1.begin(), v1.end(), v7.begin(), v7.end(), cmp_nocase)
<< '\n';
}
Output:
a b c f h x includes:
a b c : 1
a c : 1
g : 0
a c g : 0
A B C : 1
Vedi anche
calcola la differenza tra due insiemi Original: computes the difference between two sets The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (funzione di modello) | |
| searches for a range of elements (funzione di modello) | |