* [Caml-list] Queue.fold?
@ 2002-07-16 20:13 Alessandro Baretta
2002-07-17 7:19 ` Francois Pottier
0 siblings, 1 reply; 3+ messages in thread
From: Alessandro Baretta @ 2002-07-16 20:13 UTC (permalink / raw)
To: Ocaml
Is there any specific reason for not having a Queue.fold
function in the standard library? Is it not as simple as this?
let rec fold f initial queue =
try
fold f ( f initial (take queue) ) queue
with Empty -> initial
Alex
-------------------
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
^ permalink raw reply [flat|nested] 3+ messages in thread* Re: [Caml-list] Queue.fold? 2002-07-16 20:13 [Caml-list] Queue.fold? Alessandro Baretta @ 2002-07-17 7:19 ` Francois Pottier 2002-07-17 8:20 ` Alessandro Baretta 0 siblings, 1 reply; 3+ messages in thread From: Francois Pottier @ 2002-07-17 7:19 UTC (permalink / raw) To: caml-list > Is there any specific reason for not having a Queue.fold > function in the standard library? Your version of fold empties the queue as a side effect, which is usually not part of the semantics of fold. That said, there is an implementation of Queue.fold in the CVS version of O'Caml (along with a slightly more efficient implementation of all Queue functions). -- François Pottier Francois.Pottier@inria.fr http://pauillac.inria.fr/~fpottier/ ------------------- 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 ^ permalink raw reply [flat|nested] 3+ messages in thread
* Re: [Caml-list] Queue.fold? 2002-07-17 7:19 ` Francois Pottier @ 2002-07-17 8:20 ` Alessandro Baretta 0 siblings, 0 replies; 3+ messages in thread From: Alessandro Baretta @ 2002-07-17 8:20 UTC (permalink / raw) To: Francois.Pottier, Ocaml Francois Pottier wrote: >>Is there any specific reason for not having a Queue.fold >>function in the standard library? > > > Your version of fold empties the queue as a side effect, which is > usually not part of the semantics of fold. > > That said, there is an implementation of Queue.fold in the CVS version of > O'Caml (along with a slightly more efficient implementation of all Queue > functions). Give me O'Caml 3.05! Please... Thank you for pointing out the nasty side-effects of my implementation. Now I fixed it. Alex ------------------- 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 ^ permalink raw reply [flat|nested] 3+ messages in thread
end of thread, other threads:[~2002-07-17 8:13 UTC | newest] Thread overview: 3+ messages (download: mbox.gz / follow: Atom feed) -- links below jump to the message on this page -- 2002-07-16 20:13 [Caml-list] Queue.fold? Alessandro Baretta 2002-07-17 7:19 ` Francois Pottier 2002-07-17 8:20 ` Alessandro Baretta
This is a public inbox, see mirroring instructions for how to clone and mirror all data and code used for this inbox; as well as URLs for NNTP newsgroup(s).