From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@sympa.inria.fr Delivered-To: caml-list@sympa.inria.fr Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by sympa.inria.fr (Postfix) with ESMTPS id 4BB6B7ED45 for ; Mon, 25 Jun 2012 13:39:39 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AtEBABtN6E/AbSoIiWdsb2JhbABEhVqwRiIBAQEVEhQEI4IZAQUjVhALCRECJgICFBgxiB4EpimSIRSBDIoThHAyYAONYodLiSeJPA X-IronPort-AV: E=Sophos;i="4.77,471,1336341600"; d="scan'208";a="148667862" Received: from einhorn.in-berlin.de ([192.109.42.8]) by mail4-smtp-sop.national.inria.fr with ESMTP/TLS/DHE-RSA-AES256-SHA; 25 Jun 2012 13:39:38 +0200 X-Envelope-From: oliver@first.in-berlin.de Received: from first (e178018104.adsl.alicedsl.de [85.178.18.104]) (authenticated bits=0) by einhorn.in-berlin.de (8.13.6/8.13.6/Debian-1) with ESMTP id q5PBdaW0006183 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NOT); Mon, 25 Jun 2012 13:39:37 +0200 Received: by first (Postfix, from userid 1000) id AC83A1540135; Mon, 25 Jun 2012 13:39:36 +0200 (CEST) Date: Mon, 25 Jun 2012 13:39:36 +0200 From: oliver To: Diego Olivier Fernandez Pons Cc: Lukasz Stafiniak , OCaml Mailing List Message-ID: <20120625113936.GE1837@siouxsie> References: <20120624211840.124466j26yxz6rkg@webmail.in-berlin.de> <20120624.220220.2022399462583597382.Christophe.Troestler@umons.ac.be> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Disposition: inline In-Reply-To: User-Agent: Mutt/1.5.20 (2009-06-14) X-Scanned-By: MIMEDefang_at_IN-Berlin_e.V. on 192.109.42.8 Subject: Re: [Caml-list] print_int is too slow On Mon, Jun 25, 2012 at 02:09:47AM +0200, Diego Olivier Fernandez Pons wrote: [...] > There is a little trick however... I work mostly in combinatorial > optimization. If your input takes more than 1s to read or write, it > will take the age of the universe to solve given combinatorial > algorithms are exponential in the input size. And there is little > point in putting a printf on a branch-and-bound algorithm that opens > 10^6 nodes. [...] This looks like you really should use the Buffer-module. Ciao, Oliver