]> On Mon, 22 Jul 2002, Xavier Leroy <xavier.leroy@inria.fr> wrote: > > > [...] one thing that will always be necessary is to make CAML > > functions act on arrays. > > [...] the time-critical computations are done by external libraries > such as BLAS, Lapack, etc. [...] Ok, that's reasonable for arithmetic operations or standard routines like linear equation solving --- and that's what I am moving towards. Now, the code uses all along some arbitrary functions f: float -> float, g : float -> float -> float,... that allow to run the program for a large class of equations. Of course, sooner or later I need to perform some operations on the bigarrays that involve these functions, the simplest form of which is map : ?out:('a, 'b, 'c) Bigarray.Array1.t -> ('a -> 'd) -> ('a, 'b, 'c) Array1.t -> ('d, 'b, 'c) Array1.t (the same as in Array except one can specify the output matrix). My questions are: * Wouldn't these kind of functions be great to have in the standard Bigarray module? (They would also make it closer to the Array one, hence easing the transition when needed.) * If I want to implement them myself, are there any hints to reach maximal efficiency? (Especially w.r.t. callbacks.) Regards, ChriS P.S. Since my code is experimental, efficiency it not the primary concern. It just doesn't have to be too slow... (we still need to make a great deal of runs to have an insight...) ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners