[Ilugc] gcc stl
- From: sajithts@xxxxxxxxxxxxx (Sajith T S)
- Date: Wed, 28 Jan 2004 19:56:27 +0530
Sridhar R wrote:
I actually saw this before, but missed to dig
further. I was actually looking for the complexity of
algorithms implemented by them. Now it's there.
The permissible minimum time complexity of every STL component is
clearly specified in the standards - if a vector member can't be
accessed in O(1) time, then it isn't a vector, for example. That
isn't special to libstdc++.
Other related posts: