Karl Dahlke <[email protected]> writes: > Chris used the list class, but I'm thinking more about the vector class.
Sounds like the way to go. I hadn't realized that vector completely removes the need for that temporary data structure! Also, don't worry about pushing elements onto the end. It's very efficient (constant time), and it doesn't call realloc on every push. It doubles the capacity with each realloc, though I'm sure that's an implementation detail of GNU's STL. -- Chris _______________________________________________ Edbrowse-dev mailing list [email protected] http://lists.the-brannons.com/mailman/listinfo/edbrowse-dev
