From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Delivered-To: caml-list@yquem.inria.fr Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by yquem.inria.fr (Postfix) with ESMTP id 2659ABC88 for ; Fri, 4 Feb 2005 23:01:05 +0100 (CET) Received: from mail.physik.uni-muenchen.de (mail.physik.uni-muenchen.de [192.54.42.129]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id j14M1419020601 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=FAIL) for ; Fri, 4 Feb 2005 23:01:05 +0100 Received: from localhost (unknown [127.0.0.1]) by mail.physik.uni-muenchen.de (Postfix) with ESMTP id 5819B20031; Fri, 4 Feb 2005 23:01:04 +0100 (CET) Received: from mail.physik.uni-muenchen.de ([127.0.0.1]) by localhost (mail.physik.uni-muenchen.de [127.0.0.1]) (amavisd-new, port 10024) with LMTP id 25933-01-79; Fri, 4 Feb 2005 23:01:02 +0100 (CET) Received: from mailhost.cip.physik.uni-muenchen.de (kaiser.cip.physik.uni-muenchen.de [141.84.136.1]) by mail.physik.uni-muenchen.de (Postfix) with ESMTP id 739D820032; Fri, 4 Feb 2005 23:01:02 +0100 (CET) Received: from eiger.cip.physik.uni-muenchen.de (eiger.cip.physik.uni-muenchen.de [141.84.136.54]) by mailhost.cip.physik.uni-muenchen.de (Postfix) with ESMTP id 3BFE426E87; Fri, 4 Feb 2005 23:01:02 +0100 (CET) Received: by eiger.cip.physik.uni-muenchen.de (Postfix, from userid 3092) id 2F40B3CBC; Fri, 4 Feb 2005 23:01:02 +0100 (CET) Received: from localhost (localhost [127.0.0.1]) by eiger.cip.physik.uni-muenchen.de (Postfix) with ESMTP id 2CF482D716; Fri, 4 Feb 2005 23:01:02 +0100 (CET) Date: Fri, 4 Feb 2005 23:01:02 +0100 (CET) From: Thomas Fischbacher To: Oliver Bandel Cc: caml-list@yquem.inria.fr Subject: Re: [Caml-list] Estimating the size of the ocaml community In-Reply-To: <20050204105326.GB498@first.in-berlin.de> Message-ID: References: <891bd33905020213315a2ebb18@mail.gmail.com> <8008871f05020213362d21ba87@mail.gmail.com> <000f01c50971$baad4840$0100a8c0@mshome.net> <1107403128.32586.223.camel@pelican.wigram> <20050203173556.4acec1c5.ocaml-erikd@mega-nerd.com> <009a01c50a1e$f6c92080$0100a8c0@mshome.net> <4202A6AA.3030807@trdlnk.com> <20050204105326.GB498@first.in-berlin.de> X-BOFH: Daemons did it MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Virus-Scanned: amavisd-new at physik.uni-muenchen.de X-Miltered: at concorde with ID 4203F0A0.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; caml-list:01 ocaml:01 oliver:01 bandel:01 wrote:01 ocaml:01 serialize:01 binary:01 symbolic:01 heap:01 bug:01 hash:01 hair:98 ...:98 cip:98 X-Spam-Checker-Version: SpamAssassin 3.0.2 (2004-11-16) on yquem.inria.fr X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.2 X-Spam-Level: On Fri, 4 Feb 2005, Oliver Bandel wrote: > > Oh, by the way, there is one more thing which I consider a really > > grave issue, which gave us quite a lot of grey hair already: Ocaml > > strings have this stupid limitation to 16 MB, which means in particular > > that if you serialize a truly large intermediate state of, say, a long > > and complicated calculation which accidentally got a bit larger than this > > limit (while you did not expect that), well... > > Well, maybe there should be a BigStrings- or LongStrings-Module > introduced into OCaml-stdlib? Well, there is something for opaque binary data, but the problem is that not all functions one would like to have on them are readily available. > But: When you mean with "a long and complicated calculation" > using larger int/float-values you may use > the num-library. No, I actually meant serializing an approximation-to-a-continuation in long running symbolic calculations that accumulate quite a sizable heap of expressions representing terms, say for checkpointing. > E.g. in module Num there is a string_of_num-function. > Do you really think, the results will be larger than 16MB? In my case, I indeed had precisely this problem of some serializations failing due to data breaking the 16MB limit. Oh, by the way, I also have indications that at least for 3.07, there is a bug in serializing and re-serializing hash tables. Unfortunately, my test case is quite complicated, and I so far could not strip it down to something more useful for debuggers. -- regards, tf@cip.physik.uni-muenchen.de (o_ Thomas Fischbacher - http://www.cip.physik.uni-muenchen.de/~tf //\ (lambda (n) ((lambda (p q r) (p p q r)) (lambda (g x y) V_/_ (if (= x 0) y (g g (- x 1) (* x y)))) n 1)) (Debian GNU)