undefined | Better HN

0 pointsfroh3y ago0 comments

random access iterators provide exactly the pointer into array semantics, with a difference type and jumping to a location in the range.

they were conceived for c++'98 and transmogrified to a trait for c++20

the run time in GPs lower_bound link is log(n) for random access iterators and liner for non-random access.

0 comments

Yes.

But how does that change my observation about the differences in the two APIs?

j / k navigate · click thread line to collapse

0 pointsfroh3y ago0 comments

random access iterators provide exactly the pointer into array semantics, with a difference type and jumping to a location in the range.

they were conceived for c++'98 and transmogrified to a trait for c++20

the run time in GPs lower_bound link is log(n) for random access iterators and liner for non-random access.

Yes.

But how does that change my observation about the differences in the two APIs?

j / k navigate · click thread line to collapse