Re: [Ocaml-lib-devel] candidate functions

[Michal M. <mal...@pl...>]

On Wed, Feb 26, 2003 at 11:38:47AM -0500, Eric C. Cooper wrote:
> (* Invoke (f ()) n times, for side effects. *)
> 
> val repeat : int -> (unit -> unit) -> unit
> 
> (* Apply f to 0 .. n-1, for side effects. *)
> 
> val dotimes : int -> (int -> unit) -> unit

I belive for loop is more readable:

  repeat 20 f == for i = 1 to 20 do f () done
  dotimes 20 f == for i = 0 to 19 do f i done

and gives more possiblities.

Don't have strong opinions about other stuff here.

-- 
: Michal Moskal ::::: malekith/at/pld-linux.org :  GCS {C,UL}++++$ a? !tv
: PLD Linux ::::::: Wroclaw University, CS Dept :  {E-,w}-- {b++,e}>+++ h