You can think of lower_bound() as the first value in the range greater than or equal to the value we need to find. While upper_bound() gives us the value strictly greater than the value we wish to find in the list. It is a binary search implementation and have many applications in solving problems.
Great explanation. But I think there is a small correction when you say that pair range, range.first is first element while range.second should be iterator after last element and not last element.
Man I really love your tutorial, I though stl is really hard until I saw your playlist. It really helps me to prepare for internship next year! Big love from Australia!
just did the multimap from a map without knowing multimap worked like that :) i did a map[object] = value1; and also value 2 etc its basically a map how i did it? 1) custom object need operator< to be redefined (to place the object in the RBTree) 2) List: public extend std::list with operator= redifined as push_back(something) well if i knew i could iterator so easy in that multimap with range i wouldnt bother myself making that "version of multimap"
I think the main problem is if using a map with a vector you can have O(n) lookup time, but when using multimap you have guaranteed O(logn) lookup time
Yes that should be very easy you just have to to write into text file and read from it, aur check out serialisation and deserialization using text file.
If second pair of function equal_range returns the iterator pointing to last key value So how you write in for loop it!=range.second Will it print all the values of key 'a'
![[#2024MAMA] G-DRAGON - 무제(Untitled, 2014)+POWER+HOME SWEET HOME+뱅뱅뱅+FANTASTIC BABY | Mnet 241123 방송](http://i.ytimg.com/vi/Ox29z5Nf1Uk/mqdefault.jpg)
You can think of lower_bound() as the first value in the range greater than or equal to the value we need to find. While upper_bound() gives us the value strictly greater than the value we wish to find in the list. It is a binary search implementation and have many applications in solving problems.
knowing stl is the jumb from c to c++. you do a great job explaining stl in this series. thanks!
Thanks man!!
Great explanation. But I think there is a small correction when you say that pair range, range.first is first element while range.second should be iterator after last element and not last element.
Man I really love your tutorial, I though stl is really hard until I saw your playlist. It really helps me to prepare for internship next year! Big love from Australia!
I also found this channel yesterday and I love it . It's very helpful
Thanks dude..
absolutely in love with this channel
Thanks..
The way you explain is the one of the best way to explain ...thank you sir !!!😇😇😇
It's my pleasure!!
ruclips.net/video/uGWCMPRDYIw/видео.html
im giving a comment for algorithm just cuz this helped me
Line 33 was really cool.
Teetan Robotics
Hey there I'm not able to get line 33 can u kindly explain me this ?
@@behindthescene4406 Without the auto keyword , writing the line would have been bery hard.
NOT SURE Something like std::multimap Multimap ::range
Teetan Robotics thanks 😃
Nice. Please make it on Multiset as well.
Sure dude!!
can you please explain more on iterators
Sure, this is left in the series.
Thanks
Very very much thanks
thank you so much!
Thanks !!
just did the multimap from a map without knowing multimap worked like that :)
i did a map[object] = value1; and also value 2 etc
its basically a map
how i did it?
1) custom object need operator< to be redefined (to place the object in the RBTree)
2) List: public extend std::list with operator= redifined as push_back(something)
well if i knew i could iterator so easy in that multimap with range i wouldnt bother myself making that "version of multimap"
I think the main problem is if using a map with a vector you can have O(n) lookup time, but when using multimap you have guaranteed O(logn) lookup time
Thank you
You are welcome..
God You;
Thanks dude..
how to insert elements in multimap mp; ??? if its possible can you tell how?
where can we get all these codes? Can you put these in a github repo? It would be extremely handy.
Hi,
Can u suggest me any channel where i can learn Embedded c ,Linux and IPC?
No idea dude.
do you know how to create ,save or load this map into a txt file ?
Yes that should be very easy you just have to to write into text file and read from it, aur check out serialisation and deserialization using text file.
why iterator can be moved it ++;
is the operation it + = 2 impossible?
Do u have Linkedin?
Yes..
@@CppNuts can we connect??? What's the ID?
Link is given in about section of my channel.
@@CppNuts ohh thanks bhai!!!
If second pair of function equal_range returns the iterator pointing to last key value
So how you write in for loop it!=range.second
Will it print all the values of key 'a'
👍
Whats your gpu
RTX 2070.
Sir pls don't display sentence on video bcoz we could not see what operation or output is coming
find returns iterator and not pair..