12 Apr
2012
12 Apr
'12
1:44 p.m.
on Thu Apr 12 2012, Francisco José Tapia <fjtapia-AT-gmail.com> wrote:
The iterators are random access , and you can subtract two iterators in a O(log N) time for to know the number of nodes between them (even with the end( ) and rend( ) iterators)
If by "are random access" you mean they satisfy the random access iterator requirements, then this is a contradiction. Iterator subtraction is required to be O(1) for random access iterators. -- Dave Abrahams BoostPro Computing http://www.boostpro.com