Very instructive and very clear While trying to reimplement containers for practice, I was wondering what iterators were and why they were used This talk clearly explained it to me and really helped deepen my understanding of the STL
Great material, especially the historical walkthrough. However, at 55:15, when talking about queue, there is a slight mistake. queue doesn’t work with vector, because vector lacks the pop_front() method. Probably carried over from the stack slide.
Had the same question, but later realised the caveat is for input iterators. In this case two input iterators can only compare equal when they point to the EOF.
This was a great talk! Bob is such a clear and concise speaker/presenter.
This guy is a good lecturer.
Extremely useful and connected overview. Thank you Bob.
Glad it was helpful!
Very instructive and very clear
While trying to reimplement containers for practice, I was wondering what iterators were and why they were used
This talk clearly explained it to me and really helped deepen my understanding of the STL
Great talk!
Great talk! Thanks for sharing!
actualy learning cpp i use these talks before jumping into code...
Bob's "millions" approaches Sagan's "billions". I like
Great material, especially the historical walkthrough. However, at 55:15, when talking about queue, there is a slight mistake. queue doesn’t work with vector, because vector lacks the pop_front() method. Probably carried over from the stack slide.
Great presentation
Glad you liked it
Amazing talk
What's the deal with input iterator equality. I did not understand what he meant 37:00
Had the same question, but later realised the caveat is for input iterators. In this case two input iterators can only compare equal when they point to the EOF.
People should stop calling it STL and refer instead to the language's standard library.
Well, it is literally the standard template library...