cpp/algorithm/equal range: differenze tra le versioni

Da cppreference.com.
< cpp‎ | algorithm
m (r2.7.3) (Bot: Aggiungo de, en, es, fr, pt, zh)
m (Use {{lc}}. Update links. Various fixes.)
 
Riga 2:Riga 2:
 
{{cpp/title|equal_range}}
 
{{cpp/title|equal_range}}
 
{{cpp/algorithm/navbar}}
 
{{cpp/algorithm/navbar}}
−
{{ddcl list begin}}
+
{{dcl begin}}
−
{{ddcl list header | algorithm}}
+
{{dcl header | algorithm}}
−
{{ddcl list item | num=1 |
+
{{dcl | num=1 |
 
template< class ForwardIt, class T >
 
template< class ForwardIt, class T >
 
std::pair<ForwardIt,ForwardIt>  
 
std::pair<ForwardIt,ForwardIt>  
Riga 10:Riga 10:
 
                 const T& value );
 
                 const T& value );
 
}}
 
}}
−
{{ddcl list item | num=2 |
+
{{dcl | num=2 |
 
template< class ForwardIt, class T, class Compare >
 
template< class ForwardIt, class T, class Compare >
 
std::pair<ForwardIt,ForwardIt>  
 
std::pair<ForwardIt,ForwardIt>  
Riga 16:Riga 16:
 
                 const T& value, Compare comp );
 
                 const T& value, Compare comp );
 
}}
 
}}
−
{{ddcl list end}}
+
{{dcl end}}
  
 
{{tr|Restituisce un intervallo contenente tutti gli elementi uguali a {{tt|value}} nel {{tt|[first, last)}} campo ordinato. L'intervallo è definito da due iteratori, uno punta al primo elemento'''' non inferiore {{tt|value}} e un'altra punta al primo elemento'''' superiori rispetto {{tt|value}}. L'iteratore prima può essere alternativamente ottenuto con {{rlpf|lower_bound}}, il secondo - con {{rlpf|upper_bound}}.|Returns a range containing all elements equal to {{tt|value}} in the sorted range {{tt|[first, last)}}. The range is defined by two iterators, one pointing to the first element that is ''not less'' than {{tt|value}} and another pointing to the first element ''greater'' than {{tt|value}}. The first iterator may be alternatively obtained with {{rlpf|lower_bound}}, the second - with {{rlpf|upper_bound}}.}}
 
{{tr|Restituisce un intervallo contenente tutti gli elementi uguali a {{tt|value}} nel {{tt|[first, last)}} campo ordinato. L'intervallo è definito da due iteratori, uno punta al primo elemento'''' non inferiore {{tt|value}} e un'altra punta al primo elemento'''' superiori rispetto {{tt|value}}. L'iteratore prima può essere alternativamente ottenuto con {{rlpf|lower_bound}}, il secondo - con {{rlpf|upper_bound}}.|Returns a range containing all elements equal to {{tt|value}} in the sorted range {{tt|[first, last)}}. The range is defined by two iterators, one pointing to the first element that is ''not less'' than {{tt|value}} and another pointing to the first element ''greater'' than {{tt|value}}. The first iterator may be alternatively obtained with {{rlpf|lower_bound}}, the second - with {{rlpf|upper_bound}}.}}
Riga 23:Riga 23:
  
 
===Parametri===
 
===Parametri===
−
{{param list begin}}
+
{{par begin}}
−
{{param list item | first, last |{{tr| la gamma di elementi da esaminare| the range of elements to examine}}}}
+
{{par | first, last |{{tr| la gamma di elementi da esaminare| the range of elements to examine}}}}
−
{{param list item | value |{{tr| valore per confrontare gli elementi| value to compare the elements to}}}}
+
{{par | value |{{tr| valore per confrontare gli elementi| value to compare the elements to}}}}
−
{{param list cmp | comp | t1=T | p2=ForwardIt}}
+
{{par cmp | comp | t1=T | p2=ForwardIt}}
−
{{param list hreq}}
+
{{par hreq}}
−
{{param list req concept | ForwardIt | ForwardIterator}}
+
{{par req concept | ForwardIt | ForwardIterator}}
−
{{param list end}}
+
{{par end}}
  
 
===Valore di ritorno===
 
===Valore di ritorno===
−
{{tr|{{c|std::pair}} contenente una coppia di iteratori definiscono l'intervallo desiderato, il primo punta al primo elemento'''' non inferiore {{tt|value}} e la seconda punta al primo elemento'''' maggiore rispetto {{tt|value}}. |{{c|std::pair}} containing a pair of iterators defining the wanted range, the first pointing to the first element that is ''not less'' than {{tt|value}} and the second pointing to the first element ''greater'' than {{tt|value}}. }}
+
{{tr|{{lc|std::pair}} contenente una coppia di iteratori definiscono l'intervallo desiderato, il primo punta al primo elemento'''' non inferiore {{tt|value}} e la seconda punta al primo elemento'''' maggiore rispetto {{tt|value}}. |{{lc|std::pair}} containing a pair of iterators defining the wanted range, the first pointing to the first element that is ''not less'' than {{tt|value}} and the second pointing to the first element ''greater'' than {{tt|value}}. }}
  
 
{{tr|Se non vi sono elementi'''' non meno di {{tt|value}}, {{tt|last}} viene restituito come primo elemento. Allo stesso modo se non ci sono elementi'' superiore'' di {{tt|value}}, {{tt|last}} viene restituito come il secondo elemento|If there are no elements ''not less'' than {{tt|value}}, {{tt|last}} is returned as the first element. Similarly if there are no elements ''greater'' than {{tt|value}}, {{tt|last}} is returned as the second element}}
 
{{tr|Se non vi sono elementi'''' non meno di {{tt|value}}, {{tt|last}} viene restituito come primo elemento. Allo stesso modo se non ci sono elementi'' superiore'' di {{tt|value}}, {{tt|last}} viene restituito come il secondo elemento|If there are no elements ''not less'' than {{tt|value}}, {{tt|last}} is returned as the first element. Similarly if there are no elements ''greater'' than {{tt|value}}, {{tt|last}} is returned as the second element}}
Riga 104:Riga 104:
  
 
===Vedi anche===
 
===Vedi anche===
−
{{dcl list begin}}
+
{{dsc begin}}
−
{{dcl list template | cpp/algorithm/dcl list lower_bound}}
+
{{dsc inc | cpp/algorithm/dsc lower_bound}}
−
{{dcl list template | cpp/algorithm/dcl list upper_bound}}
+
{{dsc inc | cpp/algorithm/dsc upper_bound}}
−
{{dcl list template | cpp/algorithm/dcl list binary_search}}
+
{{dsc inc | cpp/algorithm/dsc binary_search}}
−
{{dcl list end}}
+
{{dsc end}}
  
 
[[de:cpp/algorithm/equal range]]
 
[[de:cpp/algorithm/equal range]]

Versione attuale delle 12:20, 2 lug 2013

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.

Click here for the English version of this page

 
C++
 
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
 
Elemento definito nell'header <algorithm>
template< class ForwardIt, class T >

std::pair<ForwardIt,ForwardIt>
    equal_range( ForwardIt first, ForwardIt last,

                 const T& value );
(1)
template< class ForwardIt, class T, class Compare >

std::pair<ForwardIt,ForwardIt>
    equal_range( ForwardIt first, ForwardIt last,

                 const T& value, Compare comp );
(2)
Restituisce un intervallo contenente tutti gli elementi uguali a value nel [first, last) campo ordinato. L'intervallo è definito da due iteratori, uno punta al primo elemento' non inferiore value e un'altra punta al primo elemento' superiori rispetto value. L'iteratore prima può essere alternativamente ottenuto con lower_bound(), il secondo - con upper_bound().
Original:
Returns a range containing all elements equal to value in the sorted range [first, last). The range is defined by two iterators, one pointing to the first element that is not less than value and another pointing to the first element greater than value. The first iterator may be alternatively obtained with lower_bound(), the second - with upper_bound().
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
La prima versione utilizza operator< di confrontare gli elementi, la seconda versione utilizza la funzione di confronto dato comp.
Original:
The first version uses operator< to compare the elements, the second version uses 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.

Indice

[modifica] Parametri

first, last-
la gamma di elementi da esaminare
Original:
the 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.
value-
valore per confrontare gli elementi
Original:
value to compare the elements to
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 type Type1 must be such that an object of type T can be implicitly converted to Type1. The type Type2 must be such that an object of type ForwardIt can be dereferenced and then implicitly converted to Type2. ​

Type requirements
-
ForwardIt must meet the requirements of ForwardIterator.

[modifica] Valore di ritorno

std::pair contenente una coppia di iteratori definiscono l'intervallo desiderato, il primo punta al primo elemento' non inferiore value e la seconda punta al primo elemento' maggiore rispetto value.
Original:
std::pair containing a pair of iterators defining the wanted range, the first pointing to the first element that is not less than value and the second pointing to the first element greater than value.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Se non vi sono elementi' non meno di value, last viene restituito come primo elemento. Allo stesso modo se non ci sono elementi superiore di value, last viene restituito come il secondo elemento
Original:
If there are no elements not less than value, last is returned as the first element. Similarly if there are no elements greater than value, last is returned as the second element
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[modifica] Complessità

Logaritmica della distanza tra first e last
Original:
Logarithmic in the distance between first and last
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[modifica] Possibile implementazione

First version
template<class ForwardIt, class T 
std::pair<ForwardIt,ForwardIt> 
    equal_range(ForwardIt first, ForwardIt last,
                const T& value)
{
    return std::make_pair(std::lower_bound(first, last, value),
                          std::upper_bound(first, last, value));
}
Second version
template<class ForwardIt, class T, class Compare>
std::pair<ForwardIt,ForwardIt> 
    equal_range(ForwardIt first, ForwardIt last,
                const T& value, Compare comp);
{
    return std::make_pair(std::lower_bound(first, last, value, comp),
                          std::upper_bound(first, last, value, comp));
}

[modifica] Esempio

#include <algorithm>
#include <vector>
#include <iostream>
 
struct S
{
    int number;
    char name;
 
    S ( int number, char name  )
        : number ( number ), name ( name )
    {}
 
    // only the number is relevant with this comparison
    bool operator< ( const S& s ) const
    {
        return number < s.number;
    }
};
 
 
int main()
{
    std::vector<S> vec = { {1,'A'}, {2,'B'}, {2,'C'}, {2,'D'}, {3,'F'}, {4,'G'} };
 
    S value ( 2, '?' );
 
    auto p = std::equal_range(vec.begin(),vec.end(),value);
 
    for ( auto i = p.first; i != p.second; ++i )
        std::cout << i->name << ' ';
}

Output:

B C D

[modifica] Vedi anche

restituisce un iteratore al primo elemento' non inferiore al valore dato
Original:
returns an iterator to the first element not less than the given value
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) [modifica]
ritorna un iteratore al primo elemento' maggiore di un certo valore
Original:
returns an iterator to the first element greater than a certain value
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) [modifica]
determina se un elemento è presente in un certo intervallo
Original:
determines if an element exists in a certain range
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) [modifica]
Estratto da "https://it.cppreference.com/mwiki/index.php?title=cpp/algorithm/equal_range&oldid=24932"