From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 1FCD6BB81 for ; Fri, 24 Feb 2006 12:39:50 +0100 (CET) Received: from ext.lri.fr (ext.lri.fr [129.175.15.4]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id k1OBdnOw000934 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO) for ; Fri, 24 Feb 2006 12:39:50 +0100 Received: from smtp.lri.fr (serveur3-5 [129.175.3.5]) by ext.lri.fr (Postfix) with ESMTP id 98F66202646; Fri, 24 Feb 2006 12:39:49 +0100 (CET) Received: from pc9-152 (pc9-152 [129.175.9.152]) by smtp.lri.fr (Postfix) with ESMTP id 7BC5BCED98; Fri, 24 Feb 2006 12:39:47 +0100 (CET) Received: from filliatr by pc9-152 with local (Exim 3.36 #1 (Debian)) id 1FCbHv-0004tq-00; Fri, 24 Feb 2006 12:39:07 +0100 MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Message-ID: <17406.61526.236550.40544@gargle.gargle.HOWL> Date: Fri, 24 Feb 2006 12:39:02 +0100 To: "Bauer, Christoph" Cc: "'EEK Cooper'" , caml-list@yquem.inria.fr Subject: Re: AW: [Caml-list] Map.fold behavior changed In-Reply-To: <26EB47FDD566A7469FC862DAF373792F07D7AE@kaiserslautern1.lmsintl.com> References: <26EB47FDD566A7469FC862DAF373792F07D7AE@kaiserslautern1.lmsintl.com> X-Mailer: VM 7.19 under Emacs 21.4.1 From: Jean-Christophe Filliatre X-Virus-Scanned: by amavisd-new at lri.fr X-Miltered: at nez-perce with ID 43FEF085.002 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; caml-list:01 filliatre:01 filliatr:01 lri:01 binary:01 filliatre:01 lri:01 filliatr:01 resp:01 resp:01 writes:01 exceptions:01 tree:02 element:02 element:02 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.3 Bauer, Christoph writes: > What about to provide a "fold_left" (= new version) and "fold_right" > (= old version)? Fixing old programs would be simple. Combined with > exceptions there would be a fast solution (O(1) instead of O(n)) > to find a minimum and maximum key from a large map. It would be O(log(n)), not O(1), since you still need to descend to the leftmost (resp. rightmost) element in a binary search tree to find the minimum (resp. maximum) element. -- Jean-Christophe Filliātre (http://www.lri.fr/~filliatr)