difference b/w iterators and indexing for STL
-
hi every one, we for an STL container we can use both iterator or indexing method to access the container data, but still y iterators are preferred i mean what is advantage of using iterator over legecy indexing... please answer me... if u feel silly still iam the begineer and even tried to google but didnt found the destiny..
-
hi every one, we for an STL container we can use both iterator or indexing method to access the container data, but still y iterators are preferred i mean what is advantage of using iterator over legecy indexing... please answer me... if u feel silly still iam the begineer and even tried to google but didnt found the destiny..
Hi, This is about the only book you will ever need on the STL. http://www.amazon.co.uk/C-Standard-Library-Tutorial-Reference/dp/0201379260/ref=sr_1_3?ie=UTF8&s=books&qid=1247072015&sr=8-3[^ :) As for your question, it depends on which container you have. If you have a List you cannot use indexing. You must use an iterator to access it. Vector, dequeue offer indexing (random access) and so are faster to access than iterating through every element.
-
hi every one, we for an STL container we can use both iterator or indexing method to access the container data, but still y iterators are preferred i mean what is advantage of using iterator over legecy indexing... please answer me... if u feel silly still iam the begineer and even tried to google but didnt found the destiny..
Iterators are a more generic and flexible concept than indices. They allow you to access the item they reference without having to refer to the parent container. Indices can't do that - they need to be explicitly used with the container they index. Things like polymorphic algorithms (like in the STL header algorithm) would be tricky to implement with indices... The Wikipedia page on iterators[^] has quite a good explanation.
Java, Basic, who cares - it's all a bunch of tree-hugging hippy cr*p