Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] How to do this properly with OCaml?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: David Thomas <david_hd@y...>
Subject: Re: [Caml-list] How to do this properly with OCaml?
Adding to stdlib is silly if no one is going to be
using the addition, particularly when the lack of
availability of the structure will promote better
programming.  I'm not saying that last bit will always
be the case, but in many cases it is.  Again, the list
is:

(1) See if there's a better algorithm.
(2) Write it inefficiently.
(3) If the program is running poorly, profile.  

If the inefficiency added in (2) is the cause, then
(3a) See if there's a better algorithm.
(3b) Talk about fixing the stdlib.

else, 
(4) fix bottleneck, and go back to (3)

Until you've reached (3b), the stdlib isn't deficient.



--- Jon Harrop <jon@ffconsultancy.com> wrote:

> On Wednesday 27 July 2005 16:34, you wrote:
> > I'm still curious what numerical algorithm is so
> > desperately in need of variable length arrays...
> 
> I've no idea. I think he just wants a fuller stdlib.
> :-)
> 
> -- 
> Dr Jon D Harrop, Flying Frog Consultancy Ltd.
> Objective CAML for Scientists
>
http://www.ffconsultancy.com/products/ocaml_for_scientists
> 


__________________________________________________
Do You Yahoo!?
Tired of spam?  Yahoo! Mail has the best spam protection around 
http://mail.yahoo.com