From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id VAA11947; Fri, 30 Apr 2004 21:40:49 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id VAA11777 for ; Fri, 30 Apr 2004 21:40:48 +0200 (MET DST) Received: from mattam.ath.cx (f01v-10-9.d1.club-internet.fr [213.44.241.9]) by nez-perce.inria.fr (8.12.10/8.12.10) with ESMTP id i3UJekEV010146 for ; Fri, 30 Apr 2004 21:40:47 +0200 Received: (qmail 7404 invoked from network); 30 Apr 2004 21:39:53 +0200 Received: from unknown (HELO cocaine.Home) (192.168.0.253) by gateway with DES-CBC3-SHA encrypted SMTP; 30 Apr 2004 21:39:53 +0200 Received: by cocaine.Home (sSMTP sendmail emulation); Fri, 30 Apr 2004 21:29:27 +0200 Date: Fri, 30 Apr 2004 21:29:27 +0200 From: Matthieu Sozeau To: caml-list@inria.fr Subject: Re: [Caml-list] "List.index" or "List.unique" functions? Message-ID: <20040430192927.GA9010@mattam.ath.cx> Mail-Followup-To: caml-list@inria.fr References: <20040430175429.GB11118@online.fr> <4092A448.6080909@1969.ws> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <4092A448.6080909@1969.ws> Organization: /home X-URL: http://mattam.org User-Agent: Mutt/1.5.6i X-Miltered: at nez-perce with ID 4092ABBE.001 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Loop: caml-list@inria.fr X-Spam: no; 0.00; matthieu:01 altern:01 caml-list:01 2004:99 0700,:01 wrote:03 recursive:03 recursive:03 tail:03 tail:03 accumulator:05 functions:05 fri:07 lists:91 index:91 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk On Fri, Apr 30, 2004 at 12:08:56PM -0700, Karl Zilles wrote: > List.rev is not tail recursive, so you wouldn't want to use this > function on industrial size lists. List.rev and List.rev_map are tail recursive, unlike map. It can be really benefical sometimes to use an accumulator in a recursive function and reverse it at the end (it certainly wouldn't if List.rev was not tail recursive). -- It's a small world, but I wouldn't want to have to paint it. -- Steven Wright ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners