Hi ! I'm ashamed not to have grasped this yet. Moreover it's pretty sure this subject was already discussed - but can't find again where. So, the basic...
... Well, there are two kind of dependency: - a module may need a type that is defined in another module - a module may need a value (a "let") that is defined...
... Yes, you need to break the cyclic dependence by parameterizing one definition over another. Having big cyclic dependencies is a bad idea anyway... -- Dr...
Thanks Remi ! ... If two.ml uses several one.ml components, so they appear in this order : one.ml two.ml in the Makefile, a cheat to access a two.ml component ...
Thanks Jon ! ... Please Jon, could you develop a bit more on this ? I'm unable to see what you mean here. ... Ah ! I wondered whether the need of such cyclic...
Hi again, So I am still trying to optimize my programm. After a few more tests I noticed, that it is actually pretty fast at the beginning and then the speed...
... [...] ... Sort of as an aside about enums ... The libvirt API bindings that I wrote have to deal with enums which are set by the C (libvirt) code. As a...
... XML-Light (http://tech.motion-twin.com/xmllight.html) uses a simple n-ary tree to represent XML documents. ... I recently got into zippers (hmmm, that...
... Jon's right. It'd be interesting to know what code you think needs circular dependencies. I've rarely come across any, and each time it turned out to be...
... You're looking in the wrong place. The minor heap always grows until it hits some maximum size (32 K words IIRC, but you can adjust it) at which point the...
... We wrote a memory profiler with the intent of releasing it as a commercial product but never got around to it. You most likely have a cache somewhere that...
... Well, as I forget this possibility in my late post, I will show you here: For type: you have in one.ml: type t1 = Foo of Two.t2 ... in two.ml type t2 = ...
... If the reference is a function, you can also use this : in one.ml: let f : (int -> string -> string) ref = ref(fun _ _ _ -> failwith "not implemented yet")...
... Sure. Consider a pair of mutually recursive functions: # let rec even ?(xs=[]) ?(ys=[]) = function ... and odd ?(xs=[]) ?(ys=[]) = function ... # even...
... I am not sure I really understand the information in the maps file. I had a look at it, as well as the smaps file on my system. I also made two snapshots...
... No, to is not what is meant : minor_words : Number of words allocated in the minor heap since the program was started. This number is accurate in byte-code...
... Thanks for the references. Reins also implements zippers and I've been meaning to study them. I do use xml-light (lightly), and so might be interested in...
... I do believe that it would be possible to handle such common cases, that are quite frequent (it occures in this case for GnuTLS, but also in openGL). ...
Florent Monnier
fmonnier@...
Dec 1, 2007 7:38 pm
9080
... CamlIDL handles the case when an unknown value for an enum is given by raising an exception: invalid_argument("enum ty: bad enum ty value");...
Florent Monnier
fmonnier@...
Dec 1, 2007 8:25 pm
9081
... Interesting ... How well could camlidl deal with the infamous virDomainPinVcpu function? http://libvirt.org/html/libvirt-libvirt.html#virDomainPinVcpu To...
... This Perl script might help you to interpret /proc/pid/maps: http://annexia.org/tmp/maps.pl ... [...] ... Remi covered this already, but I'll add that this...
Thanks for your answer, ... There is a "viewer" file module in this project : it is a movable an "zoomable" window on a universe computed by another file ...
... That is interesting, thanks ! But It makes me think to this now : even forgetting these circular dependencies, IMHO any initialization of a reference that...
... Thanks, Regards, Fabrice Nothing to do with the subject : The listing paper is nice. IMHO it would be even cooler with pale green strips instead of grey...
... You just supply "-pp camlp4oof" on the command line: $ cat >tmp.ml parser [< >] -> [];; $ ocamlc -pp camlp4oof tmp.ml -o tmp -- Dr Jon D Harrop, Flying...
... I would like to do the same thing for the parsed HTML tree that OcamlNet generates. Assuming I ever have time (and that someone hasn't beaten me to it.)...
