tand why bin_prot ends up comparing
bigarrays of different layouts: is this an oversight in the test suite
or a strong requirement?
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.y
)
Indeed, it should work, and I see no reason why nested callbacks could
fail. Callbacks do save some Caml-specific state and restore it
before returning, but they use the stack to do so, so they should be
reentrant. Please file a bug report if you find out they are not.
- Xavier Leroy
--
ome to try the trunk sources and let me know of any
problems encountered.
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
hat document. Unfortunately, the LaTeX sources appear to be lost.
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
r issue is resolved before asking our network admins
anything else :-)
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
with the GC
(declared with one of the CAMLlocal macros).
If both conditions are met, your code should be all right. If it
still misbehaves, feel free to post a repro case on the bug tracker
http://caml.inria.fr/mantis
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archive
ork correctly on Zarith's
big integers, provided OCaml 3.12.1 or later is used.
Feedback is welcome, preferably through the bug tracker at
http://forge.ocamlcore.org/projects/zarith/
Enjoy,
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.i
hat partial application of fprintf?
(Inline f at point of call, or eta-expand yourself.) The Printf
module takes a lot of liberties with the type system (ahem), so it is
one of the usual suspects in such a case.
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https
Nipkow. "Term Rewriting and All That".
http://www4.in.tum.de/~nipkow/TRaAT/
Hope this helps,
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
only comparisons are much faster,
but you can use Patricia trees for your environments.
- Compiling to bytecode is probably overkill.
Hope this helps.
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
or developers to work on the
Windows port(s) of OCaml and never found any. Finally, at the latest OCaml
consortium meeting, the idea of splitting Camlp4 off the core distribution
was floated around; volunteers to take over its maintenance would be most
welcome.
All right. Let me stop here and pray for
;> Maybe a translation would be sufficient ?
>
> I have contacted Xavier Leroy and Pierre Weis a few years ago to get
> the TeX sources of the book. I didn't intend to translate from French
> to English, but only, for a start, from Caml Light to Objective Caml.
> Neither
Smaller contributions
are most welcome as well, such as commenting on the PRs, testing
changes, new features and release candidates, PR triaging, helping to
identify the top little things to be resolved by the next release,
etc.
That's a much more low-key approach, but one that is more likel
IIRC, the Web pages for the Murmur family of hashes gives some
statistical evidence that this approach works.
> How to get a random number that is good enough?
Hmm. /dev/random is your friend on the platforms that support it.
Otherwise, there's always the Random module, but Random.se
On 01/01/2012 01:52 PM, Richard W.M. Jones wrote:
> On Fri, Dec 30, 2011 at 06:06:26PM +0100, Xavier Leroy wrote:
>> Indeed. The optional "seed" parameter to Hashtbl.create does exactly
>> this in the new implementation of Hashtbl (the one based on Murmur3).
>
> I
quot; stay constant.
What happens if you run your test in an infinite loop? Does memory
usage (as reported by "top") stays constant or increases as a function
of time? Only the latter case is really problematic.
- Xavier Leroy
--
Caml-list mailing list. Subscription management and
ad (Lwt) or more general (pa_monad).
Regards,
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
is to restrict the size of the hashtables coming from untrusted
> sources.
A much better fix is to replace your hash tables with references to
AVL maps. Guaranteed O(log n) is the way to go for Web app developers
to sleep soundly at night.
Resignedly awaiting a CVE about association lists,
- X
ey want, better use maps, indeed.
The joke was that we don't need a CVE to know this, just basic
algorithmic reasoning.
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://gro
nt: if you're in need of
cryptographically-strong random data,
http://forge.ocamlcore.org/projects/cryptokit/
is what you need.)
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
nt to do with your equations.
HTH,
- Xavier Leroy
--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs
21 matches
Mail list logo