Re: [Caml-list] Sorted list

[skaller <skaller@users.sourceforge.net>]

On Sat, 2007-08-04 at 11:09 -0400, Brian Hurt wrote:

> Unortunately, the standard Ocaml solution in a situation like this is to 
> implement your own data structure.  The good news is that this is easy. 
> The bad news is that, because this is easy, there is little pressure on 
> the maintainers of Ocaml to add features to the core library.

Well, I would like to see a community process for selecting,
implementing, documenting and maintaining a set of good algorithms
which go IN THE STANDARD DISTRIBUTION (under the usual LGPL+X licence,
with a disclaimer the code base isn't maintained by Inria, merely
distributed on behalf of the community).

So Inria should provide the repository, and the Ocaml team has
a final veto on selection .. but the work is done by outside
volunteers.

So please would the High Priests of the Cathedral like
to run a little Bazaar for their disciples?

-- 
John Skaller <skaller at users dot sf dot net>
Felix, successor to C++: http://felix.sf.net