
22 Nov
2009
22 Nov
'09
3:28 p.m.
On Nov 22, 2009, at 15:25 , Stephen Tetley wrote:
2009/11/22 Daniel Fischer
: I never noticed the docs didn't say anything about the complexity of length. That should indeed be mentioned.
Maybe not too usual, neither the OCaml or MzScheme docs mention that length is not constant time (caveat - I'm not at the latest release of either).
But laziness means that it's not always obvious what time complexity a given function has, so it's a good idea to document it in all cases. -- brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery@kf8nh.com system administrator [openafs,heimdal,too many hats] allbery@ece.cmu.edu electrical and computer engineering, carnegie mellon university KF8NH