<Dybbuk> Hmmm.
kjs3 has joined #ocaml
<Dybbuk> Anybody looking at that findprimes example posted to the list?
<Dybbuk> Is it faster to call List.append for every result, or to use :: and then List.reverse it afterwards?
gl has quit [Read error: 113 (No route to host)]
<exarkun> which list?
exarkun has quit ["A yawn is a silent shout."]
skylan has quit [Read error: 104 (Connection reset by peer)]
Dybbuk has quit [Read error: 110 (Connection timed out)]
skylan has joined #ocaml
kjs3 has quit [Read error: 110 (Connection timed out)]
gl has joined #ocaml
gl has quit [Read error: 104 (Connection reset by peer)]
gl has joined #ocaml
yangsx has joined #ocaml
cymonts has joined #ocaml
yangsx has quit ["Client Exiting"]
cymonts has quit [Read error: 60 (Operation timed out)]
cymonts has joined #ocaml
cymonts has quit [Read error: 111 (Connection refused)]
Beleg has joined #ocaml
Beleg has left #ocaml []
Dybbuk has joined #ocaml
nkoza has joined #ocaml
<nkoza> hi
<Dybbuk> Howdy there.
<nkoza> there is an url with a comparison between ocaml and common lisp ?
<Dybbuk> Hmmm...not that I can think of.
<Dybbuk> You might want to read the comp.lang.functional faq, which describes some differences.
<nkoza> ok, tnx
<Dybbuk> One of the biggest ones that you'll run into is that common lisp isn't really a good example of a functional language, and a lot of its built-in functions depend on side effects.
whee has quit ["Leaving"]
taw has joined #ocaml
<taw> hello
<smkl> hi taw
<taw> could you explain to me how to define pair of types where A refers to B in definition and B refers to A ?
<taw> i got "Unbound type constructor" error
<smkl> type a = A of b and b = B of a;; ?
ght-lsm has joined #ocaml
<taw> with "and" ?
<taw> cool it works ;)
<taw> thanks
<taw> bye
taw has left #ocaml []
gl has quit [Read error: 113 (No route to host)]
ght-lsm has left #ocaml []
gl has joined #ocaml
exarkun has joined #ocaml
<exarkun> hello
<smkl> hi exarkun
<exarkun> hmm, I had a question but I just realized the solution
<exarkun> smkl: thanks for the help yesterday :)
<exarkun> hmm, here's one. Is there a function to shift Big_ints? like lsl and lsr for regular ints
<exarkun> or should I just divide by powers of two?
FamiGold has joined #ocaml
<Dybbuk> exarkun: It depends on what you're trying to do...with a language like O'Caml I'm not sure if you can depend on the internal representations of Big_ints to be what you expect them to be.
<FamiGold> vot bliad
nkoza has quit [Read error: 110 (Connection timed out)]
nkoza has joined #ocaml
nkoza has left #ocaml []
<exarkun> Dybbuk: *nod*
<exarkun> Related question.. Is there a way to get the ieee754 repr of a float?
<smkl> do you mean like Int64.bits_of_float ?
<exarkun> That looks just like what I mean, yea. :)
<exarkun> I've been using the oreilly book as a module reference, it seems pretty good/complete, but not too searchable. Do you guys have a particular reference you use, or...?
FamiGold has quit [Read error: 110 (Connection timed out)]
<smkl> i use the manual
* exarkun nods.
<Dybbuk> exarkun: I use the O'Reilly book and if that fails, I check the .mli files. :)
<exarkun> ok, cool :)
* gl is away: I'm busy
<Dybbuk> I find that the mli files are actually pretty well-documented themselves.
<smkl> manual pages for the modules are autogenerated from .mli files
<Dybbuk> Oh, neat.
<bbdab> val dirname : string -> string
<bbdab> See Filename.dirname.
<bbdab> err?
<smkl> should be Dirname.basename
<bbdab> hehe
<exarkun> Would anyone mind taking a quick look at http://meson.dyndns.org:8080/int64.ml (~10 lines)?
<smkl> note that ocaml native ints are 31 bits
<exarkun> oops