From: Michal M. <mal...@pl...> - 2003-03-20 14:41:53
|
Hi, If there is any interest in this module, I can clean it up, document and so on. Now I'm dropping it here just for comments. -- : Michal Moskal ::::: malekith/at/pld-linux.org : GCS {C,UL}++++$ a? !tv : PLD Linux ::::::: Wroclaw University, CS Dept : {E-,w}-- {b++,e}>+++ h |
From: Nicolas C. <war...@fr...> - 2003-03-24 08:28:43
|
> If there is any interest in this module, I can clean it up, document and > so on. Now I'm dropping it here just for comments. Thanks, this is a nice library, but I'm not really sure that the average Ocaml user are really needing an circular list ( I actually never have used theses since my first caml days ) , but of course I would be more convinced if somehow bring up some samples of common usage of them. Nicolas Cannasse |
From: Michal M. <mal...@pl...> - 2003-03-24 08:37:11
|
On Mon, Mar 24, 2003 at 05:27:45PM +0900, Nicolas Cannasse wrote: > > If there is any interest in this module, I can clean it up, document and > > so on. Now I'm dropping it here just for comments. > > Thanks, this is a nice library, but I'm not really sure that the average > Ocaml user are really needing an circular list ( I actually never have used > theses since my first caml days ) , but of course I would be more convinced > if somehow bring up some samples of common usage of them. I needed (well, will need :-) it for some algorithm for control flow graph processing. Simply algorithm relays on it. And there was a post on caml-list recently asking about data structure allowing fast adding of elements, lists of elements, removal of specific elements, and with tail recursive fold functions. Somebody suggested priority queue (that have more features, but better to much then to less), that will do all of this in O(log n). My circular list will do all of this in O(1). -- : Michal Moskal ::::: malekith/at/pld-linux.org : GCS {C,UL}++++$ a? !tv : PLD Linux ::::::: Wroclaw University, CS Dept : {E-,w}-- {b++,e}>+++ h |