Is there a std iterator I could use to insert elements into std::map using a std algorithm (for example std::copy) ?
I need a container to link one object to a string, and I thought about using std::map. Is there a better container? Forgot to say - items needs to be sorted.
Return Value: The function returns a pair, with its member pair::first set to an iterator pointing to either the newly inserted element or to the element with an equivalent key in the map.
Time complexity: k*log(n) where n is size of map, k is no. of elements inserted.
set() The set() method adds or updates an entry in a Map object with a specified key and a value.
I think what the OP is looking for is std::inserter(mymap, mymap.end())
so you can do:
std::copy( inp.begin(), inp.end(), std::inserter(mymap, mymap.end()) );
The input types must be a pair type that your map takes, otherwise your algorithm would need to be std::transform
with a function/functor to convert the input type into such a std::pair
.
inserter is not actually an iterator but a templated function that produces an iterator (std::insert_iterator
, which is a templated type but the type is automatically resolved in the function call).
In order to insert into std::map
you need to use std::make_pair()
.
For example:
std::map<int,std::string> Map; Map.insert(std::make_pair(5,"Hello"));
Try something similar. :)
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With