std::set_intersection

 

C++

Linguaggio

Concetti

Libreria di Utilità

Stringhe

Contenitori

Algoritmi

Iteratori

Libreria matematca

Input/output

Localizzazione

Espressioni regolari(C++11)

Operazioni atomicche(C++11)

Multithreading(C++11)

 

Algoritmo libreria

Funzioni Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Non modifica le operazioni di sequenza Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modifica delle operazioni di sequenza Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Partizionamento operazioni Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Ordinamento delle operazioni (su intervalli ordinati) Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binarie (le operazioni di ricerca sui campi ordinati) Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
Impostare le operazioni (su intervalli ordinati) Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap operazioni Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimo / massimo le operazioni Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Operazioni numeriche Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
Libreria C Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

Defined in header <algorithm>
template<class InputIt1, class InputIt2, class OutputIt > OutputIt set_intersection( InputIt1 first1, InputIt1 last1,                            InputIt2 first2, InputIt2 last2,                            OutputIt d_first );	(1)
template<class InputIt1, class InputIt2,           class OutputIt, class Compare > OutputIt set_intersection( InputIt1 first1, InputIt1 last1,                            InputIt2 first2, InputIt2 last2,                            OutputIt d_first, Compare comp );	(2)

Costruisce un inizio gamma smistati d_first costituito da elementi che si trovano in entrambe le gamme filtrate [first1, last1) e [first2, last2). La prima versione si aspetta che sia l'ingresso che varia da ordinare con operator<, la seconda versione si aspetta che essere ordinati con il confronto comp data funzione. Se qualche elemento si trova m volte in [first1, last1) e n volte [first2, last2), gli elementi std::min(m, n) primo verranno copiati dalla prima serie alla gamma di destinazione. L'ordine degli elementi equivalenti è conservato. L'intervallo risultante non possono sovrapporsi uno dei campi di ingresso.

Original:

Constructs a sorted range beginning at d_first consisting of elements that are found in both sorted ranges [first1, last1) and [first2, last2). The first version expects both input ranges to be sorted with operator<, the second version expects them to be sorted with the given comparison function comp. If some element is found m times in [first1, last1) and n times in [first2, last2), the first std::min(m, n) elements will be copied from the first range to the destination range. The order of equivalent elements is preserved. The resulting range cannot overlap with either of the input ranges.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parametri

first1, last1	-	la prima gamma di elementi da esaminare Original: the first 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	-	il secondo intervallo di elementi da esaminare Original: the second 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.
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:  bool cmp(const Type1 &a, const Type2 &b); The signature does not need to have const&, but the function must not modify the objects passed to it. The types Type1 and Type2 must be such that objects of types InputIt1 and InputIt2 can be dereferenced and then implicitly converted to Type1 and Type2 respectively. ​
Type requirements
- InputIt1 must meet the requirements of InputIterator.
- InputIt2 must meet the requirements of InputIterator.
- OutputIt must meet the requirements of OutputIterator.

Valore di ritorno

Iterator oltre la fine della gamma costruito.

Original:

Iterator past the end of the constructed range.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Complessità

A confronto la maggior parte 2·(N₁+N₂-1), dove N₁=std::distance(first1, last1) e N₂=std::distance(first2, last2).

Original:

At most 2·(N₁+N₂-1) comparisons, where N₁=std::distance(first1, last1) and N₂=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.

Possibile implementazione

First version
template<class InputIt1, class InputIt2, class OutputIt> OutputIt set_intersection(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first){while(first1 != last1 && first2 != last2){if(*first1 <*first2){++first1;}else{if(!(*first2 <*first1)){*d_first++=*first1++;}++first2;}}return d_first;}
Second version
template<class InputIt1, class InputIt2, class OutputIt, class Compare> OutputIt set_intersection(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first, Compare comp){while(first1 != last1 && first2 != last2){if(comp(*first1, *first2)){++first1;}else{if(!comp(*first2, *first1)){*d_first++=*first1++;}++first2;}}return d_first;}

Esempio

#include <iostream>#include <vector>#include <algorithm>#include <iterator>int main(){std::vector<int> v1{1,2,3,4,5,6,7,8};std::vector<int> v2{5, 7, 9,10};std::sort(v1.begin(), v1.end());std::sort(v2.begin(), v2.end());   std::vector<int> v_intersection;   std::set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), std::back_inserter(v_intersection));for(int n : v_intersection)std::cout<< n <<' ';}

Output:

5 7

Vedi anche

set_union	computes the union of two sets (funzione di modello)