Browse thread
Sorted list
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Julien Moutinho <julien.moutinho@g...> |
| Subject: | Re: [Caml-list] Sorted list |
On Sun, Aug 05, 2007 at 01:42:21AM +1000, skaller wrote: > 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. I am quite half-hearted about the idea of an Inrians' veto, despite the fact that, they sure know how to select. However if this could allow extra-Inrians to actually contribute to (and learn) the jewelery, in a more _visible_ and _fast_ way, which is _hardly_ the case currently, why not! Let us be pragmatic. That said... do they have enough manpower for such a peer-review task? > So please would the High Priests of the Cathedral like > to run a little Bazaar for their disciples? Yep, Bazaar or another free software with a distributed repository model. Amen.