[Ilugc] gcc stl

  • From: sridharinfinity@xxxxxxxxx (Sridhar R)
  • Date: Wed, 28 Jan 2004 07:26:36 -0800 (PST)

--- Sajith T S <sajithts@xxxxxxxxxxxxx> wrote:

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. 

Well?

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++.

  Know that.  But I was looking for more specific
information.  For example, what is the constant
factor, what is the exact O(x) in current
implementation.

  Seems like source code is the ultimate choice.
 
Regards,
Sajith.


=====
Windows 2000 is more secure than Linux...
Since the machine is offline half of the time because of crashes, it cannot be 
accessed globally, therefore producing higher security.
---
Sridhar R 
Email: r_sridhar@xxxxxxxxxxxx
WWW:   http://sridhar.has.it

__________________________________
Do you Yahoo!?
Yahoo! SiteBuilder - Free web site building tool. Try it!
http://webhosting.yahoo.com/ps/sb/

Other related posts: