2 Sep
2004
2 Sep
'04
7:54 p.m.
On Thu, 2 Sep 2004 09:28:00 -0400, Arkadiy Vertleyb <vertleyb@hotmail.com> wrote:
"Peder Holt" <peder.holt@gmail.com> wrote in message
My guess is that implementing a linked list, and searching for the element at position N would require less compile time.
Why?
Basically the same argument that Daniel had. Probably cheaper to build than a vector, but since the lookup times are greater (at least for the latter elements in the sequence) you will probably not gain much anyway.
Again, please keep in mind per-translation unit versus per-typeof invocation issue.
Regards, Arkadiy
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost