This is the mail archive of the libstdc++@gcc.gnu.org mailing list for the libstdc++ project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [RFC] libstdc++/19422: complexity of ass. containers range constr.


Paolo Carlini wrote:

Now, my immediate reaction: why we are not using instead the versions of insert_unique/insert_equal that take an hint iterator too? That version has guaranteed constant complexity if t is inserted right after p (Table 69) and that would be the case when [i, j) is already sorted, I think...

Forgot to add: in this application, the suited hint iterator would be end(), of course.


Paolo.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]