8 Mar
2015
8 Mar
'15
4:59 p.m.
Hi, The following two calls have constant complexity (according to docs) for all indices: iterator iterator_to(const value_type& x); const_iterator iterator_to(const value_type& x) const; As far as I understand, the single way to reach the constant complexity in searching by pointer is to store the objects in continuous memory area. Is it correct?