close
Namensräume
Varianten

std::map::find

Aus cppreference.com

<metanoindex/>

 
 
 
std::map
Member-Funktionen
Original:
Member functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::map
map::~map
map::operator=
map::get_allocator
Elementzugriff zerstört
Original:
Element access
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::at
map::operator[]
Iteratoren
Original:
Iterators
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::begin
map::cbegin

(C++11)
map::end
map::cend

(C++11)
map::rbegin
map::crbegin

(C++11)
map::rend
map::crend

(C++11)
Kapazität
Original:
Capacity
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::empty
map::size
map::max_size
Modifiers
Original:
Modifiers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::clear
map::insert
map::emplace(C++11)
map::emplace_hint(C++11)
map::erase
map::swap
Lookup
Original:
Lookup
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::count
map::find
map::equal_range
map::lower_bound
map::upper_bound
Beobachter
Original:
Observers
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
map::key_comp
map::value_comp
 
<tbody> </tbody>
iterator find( const Key& key );
const_iterator find( const Key& key ) const;
Sucht ein Element mit Schlüssel key.
Original:
Finds an element with key key.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parameter

key -
Schlüsselwert des Elements zu suchen
Original:
key value of the element 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.

Rückgabewert

Iterator auf ein Element mit Schlüssel key. Wenn kein solches Element gefunden wird, past-the-Ende (siehe end()) Iterator zurückgegeben .
Original:
Iterator to an element with key key. If no such element is found, past-the-end (see end()) iterator is returned.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Komplexität

Logarithmic in the size of the container.

Siehe auch

liefert die Anzahl der Elemente zu einem Schlüssel
Original:
returns the number of elements matching specific key
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(öffentliche Elementfunktion) [edit]
Bandbreite der Rendite von Elementen übereinstimmenden eine bestimmte Taste
Original:
returns range of elements matching a specific key
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

(öffentliche Elementfunktion) [edit]


Beispiel

Demonstrates the risk of accessing non-existing elements via operator [].

#include <string>
#include <iostream>
#include <map>

int main()
{
    typedef std::map<std::string,int>  mapT;

    mapT my_map;
    my_map["first"]=  11;
    my_map["second"]= 23;
    
    mapT::iterator  it= my_map.find("first");
    if( it != my_map.end() ) std::cout << "A: " << it->second << "\n";

    it= my_map.find("third");
    if( it != my_map.end() ) std::cout << "B: " << it->second << "\n";

    // Accessing a non-existing element creates it
    if( my_map["third"] == 42 ) std::cout << "Oha!\n";
    
    it= my_map.find("third");
    if( it != my_map.end() ) std::cout << "C: " << it->second << "\n";
  
    return 0;
}

Output:

A: 11
C: 0