;
> Thanks!
>
> ___
> Caml-list mailing list. Subscription management:
> http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
> Archives: http://caml.inria.fr
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
&g
en thousands of connections, you'll probably want to
consider epoll. select does not scale well.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info markus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
http:
s should still be very
easy. S-expressions are either a Sexp.Atom or Sexp.List. It should
only require a handful of lines to convert these to whatever other
string representation you prefer. Writing a corresponding parser may
be more effort.
Regards,
Markus
--
Markus Mottl
t; when data is read back in.
>
> How can I do this? Appreciate any pointers.
The I/O and parsing routines in the S-expression library should take
care of escaped strings just fine. Btw., the escaping conventions are
absolutely identical to the ones used by OCaml.
Regards,
Marku
alization, i.e. a generic (= slow) comparison function
will be called. E.g. if your array contains integers or floats, this
is likely to make a significant difference. Try constraining the type
of your min function to the one of the array elements. This will
probably make the problem go away.
Re
uot;noalloc", but later change the C-code in
ways that breaks this property. The tiny extra performance may not be
worth that risk.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing li
; ext'
You will need to constrain a pattern with a type again if you want to
make sure that the pattern match fails in the right place (match case)
if unsupported tags are added. You could also turn warnings into
errors, which should also f
On Sun, Dec 20, 2009 at 23:30, Jon Harrop wrote:
> Traffic here:
>
> 2007: 5814
> 2008: 4051
> 2009: 3071
That's because I don't have much time to post here nowaydays. I'm
sure if Jon followed my example, we would have a parallel GC for OCaml
by the end of the year
.
The library and manual can be downloaded from here:
http://www.ocaml.info/home/ocaml_sources.html#gpr
A Godi package (gpr) is already available, too.
Enjoy!
Best regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
irtually impossible
to miss changes.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archiv
The new Jane Street Core library is now also available through Godi
and is tested to build on Linux.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
http
On Tue, Sep 1, 2009 at 12:32, John
Whitington wrote:
> Has anyone managed this? Bytecode seems fine, native not so.
I haven't compiled it under 10.6, but FWIW my 64bit Godi installation
of OCaml kept working just fine after the upgrade.
Regards,
Markus
--
Markus Mottl
t; (*pp gcc -E -xc $ARCH_FLAGS *)
>
> Unfortunately, I don't know how to "productize" such change.
This problem is already fixed in my version and the one in Godi
(1.2.14), but not the one distributed by Jane Street.
Regards,
Markus
--
Markus Mottlhttp://www.o
ease. I cannot tell how long this will take since I'm
not directly involved in the release process for this library itself,
but I guess one might already start holding one's breath...
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.
re this feature is documented?
I don't think this is documented anywhere, since this is an
implementation detail that (though unlikely) might even change in the
future.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
uess the
documentation could still be clarified in this respect, because the
explicit prohibition of using the local root (de)registration
functions suggests that these operations are not guaranteed to be
sound and that this might also extend to global roots.
Regards,
Markus
--
Markus M
e runtime code
in detail to learn more, but maybe the OCaml team can clarify this
issue more quickly?
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
htt
need to be called after a collection in a table. Maybe
something similar can be done for C-finalizers?
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
http://yque
callbacks into OCaml). Registering
the finalizer from within C during allocation rather than having to
wrap up the value a second time with an OCaml-finalizer would seem
much simpler.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.
-heap is large and you allocate
regular expressions at very high rates.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman
y. A still reasonable higher setting would
probably not solve performance bugs of the sort above anyway.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
htt
This setting works fine for
just about any application I've seen, because virtually nobody has to
create patterns dynamically at rates so high that this matters.
Thus, try hoisting out the compilation of the regexp first...
Markus
--
Markus Mottlhttp://www.ocaml.
xp "...") and pass it in with label "~rex" to
solve this problem.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
http://yqu
s than they solve. Ideological quick fixes do not exist,
just as the optimal type sytem doesn't so no more flames please...
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscri
ackers, our company
makes it cheaper for people to invest their hard-earned money by
providing extra liquidity on financial markets.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list.
his indicates that your type-conv library, on which bin-prot depends,
is not up-to-date. It is also highly recommended to upgrade to the
newest compiler release.
Cheers,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
aid. Does this mean that eventually
polymorphic recursion might be supported by OCaml? What's still
missing for that feature?
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list
sult with the
user-provided type declaration, i.e. when it's too late.
Of course, there are workarounds (recursive modules, polymorphic
record fields), but, as you said, they are clunky indeed...
Cheers,
Markus
--
Markus Mottlhttp://www.oca
a truly recursive way, you'd
essentially end up with polymorphic recursion, which is undecidable.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
htt
" :: foo ()
and bla () = 42 :: foo ()
You can apply the same trick in your specific example by simply moving
the type definition of x1 out of the cycle with x2 and x3.
Cheers,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
r matrices (probably > 10x10).
I guess you should be fine rolling your own implementation for such
small matrices.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscripti
you need.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.infomarkus.mo...@gmail.com
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginn
uld do is to copy one of the static libraries to
your build directory, remove the offending symbol using the "ar"
command line tool, and then link the resulting library and the other
one statically into your executable. Dirty, but what you're gonna
do...
Regards,
Markus
--
rol
repository, where you can also look at individual files without
downloading the archive, is here:
http://hg.ocaml.info/release/pure-fun
Note that leftist heaps are in chapter 3:
http://hg.ocaml.info/release/pure-fun/file/tip/chp3.ml
Regards,
Markus
--
Markus Mottlhttp://
ppy cases. It is such a great tool
> that I find myself using it everywhere, hence the inevitability of every
> now and then running into problems...
Thanks for the feedback!
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.info[EMAIL PROTECTED]
e
may not even be such an extensional representation for theoretical
reasons. E.g. think of encoding exactly all terminating programs
extensionally, which would be very nice but is clearly impossible.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.info[EMAIL PROTECTED]
_
g format like the one I'm working on.
I'd go for the protocol translator. Especially if two protocols share
a lot of structure, it should be trivial to define translations.
Another very reasonable approach, which does not diminish performance,
would be to exchange protocol version
n nowadays so hardly anybody on this list should be
affected).
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.info[EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo
needs to
be shared.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.info[EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner&#x
fined datatypes in OCaml, and there are no
plans to change their representation. I think it is fair to say that
both of them are reasonably future-safe.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.info[EMAIL PROTECTED]
__
g only marginally slower. It also requires a little less
storage space. Main problem here is actually that it doesn't support
shared / cyclic datastructures. I don't think anybody would blame it
for not being human-readable, because that's the nature of binary
protocols ;-)
Regards,
Mark
uot; library is badly out of date, and
needs to be updated to work with newer releases of bin-prot. We will
make a release within (probably) the next few weeks. In the meanwhile
you might want to downgrade bin-prot to make it work with "core".
I'll add a patch to bin-prot to make
ew version will be released
within the next few weeks. You might want to downgrade the bin-prot
package installed in your Godi tree to an older version.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.info[EMAIL PROTECTED]
___
C
alty,
since almost all of the computation time is spent in external
libraries written in Fortran or C.
Regards,
Markus
--
Markus Mottlhttp://www.ocaml.info[EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://y
2008/9/24 Rich Neswold <[EMAIL PROTECTED]>:
> On Thu, Sep 11, 2008 at 11:31 AM, Markus Mottl <[EMAIL PROTECTED]>
> wrote:
>>
>> Look at our Core-library. It contains a module "Bigstring", which
>> provides many efficient I/O-functions for those. Lo
cessary"
rather than the adverb "unnecessarily"... ;-)
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-
ions:
there the lock would be released, too, to exploit parallelism, improve
throughput, and avoid latency spikes.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yque
/O-size) is more efficient. That way you can have many threads
performing I/O-system calls simultaneously.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.f
espectively. "Epoll.wait" allows you to wait for received events
(similar to "select").
Note, however, that "select" is usually more efficient for small (=
tens) numbers of descriptors!
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED
and you can reasonably expect releases to happen in somewhat
infrequent time intervals.
Best regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailm
never used them in structures, only in signatures.
That's why this bug went unspotted until now.
An updated version is online already, including the Godi-package.
Best regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list
d of "sexplib" as package, add "-syntax
camlp4o", and drop "-I +camlp4 -pp camlp4orf". This should fix the
problem.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscrip
glad to update the sexplib
distribution quickly.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inr
f a dummy type
is the following:
module type B = sig
type x = X
include A with type t = x
end
Regards,
Markus
P.S.: A commentator on one of our blog articles also ran into a
similar issue: http://ocaml.janestcapital.com/?q=node/26
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED
es write out data in little endian format (only the C-stubs
need to be adapted), then I'll gladly add that patch...
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http:
On Thu, May 15, 2008 at 11:59 AM, Markus Mottl <[EMAIL PROTECTED]> wrote:
> It seems that this is related to the PPC architecture defaulting to
> unsigned as opposed to signed chars. I don't know what the best fix
> for this is. Maybe gcc 4.3.0 changes this default behavi
3.0 changes this default behavior. I guess
that using the compilation flag "-no-unsigned-char" might fix this in
the general case. Could anybody with access to a PPC platform please
verify, whether this flag solved this compilation problem for the
binary p
tion there,
which should solve this problem once and for all.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: h
m on our Fedora 5 boxes (32 and 64bit) using any (including
older) OCaml-compiler.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/l
highly kernel-dependent.
Note, too, that the upcoming OCaml-release will (probably) feature
improved page table handling using sparse representations, thus
solving this problem generally.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
ext release. In the meanwhile you may want to execute
"#thread" before "requiring" the core library.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http:/
o see a patch to fully support all
architectures...
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://
version should work fine now.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria
the same byte layout, should work, too,
with the current binary protocol. At least if you do not mix 32/64bit
machines there...
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription ma
ux extension library, i.e. this
allows you to scale your applications to thousands of descriptors.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/m
-prot to GODI, the other two packages are already
available.
Regards,
Markus
--
Markus Mottl http://www.ocaml.info [EMAIL PROTECTED]
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archiv
66 matches
Mail list logo
