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 KAA19806; Wed, 28 Apr 2004 10:43:29 +0200 (MET DST) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id KAA19796 for ; Wed, 28 Apr 2004 10:43:28 +0200 (MET DST) Received: from mail.dcs.qmul.ac.uk (vicar.dcs.qmul.ac.uk [138.37.95.146]) by concorde.inria.fr (8.12.10/8.12.10) with ESMTP id i3S8hRYM011865 for ; Wed, 28 Apr 2004 10:43:27 +0200 Received: from xenografia.plus.com ([212.159.85.26] helo=dcs.qmul.ac.uk) by mail.dcs.qmul.ac.uk with asmtp (TLSv1:DHE-RSA-AES256-SHA:256) (Exim 4.32) id 1BIkf8-000195-Vz; Wed, 28 Apr 2004 09:43:27 +0100 Message-ID: <408F6E8A.9060605@dcs.qmul.ac.uk> Date: Wed, 28 Apr 2004 09:42:50 +0100 From: Martin Berger User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.6) Gecko/20040124 X-Accept-Language: en, en-us, de-de, ru, pt-br MIME-Version: 1.0 To: Martin Berger CC: The Caml Trade Subject: Re: [Caml-list] [ANN] The Missing Library References: <1083140676.9537.831.camel@pelican.wigram> In-Reply-To: <1083140676.9537.831.camel@pelican.wigram> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-DCS-Auth-User: martinb X-DCS-clamav-result: clean (1BIkf8-000195-Vz) X-DCS-uvscan-result: clean (1BIkf8-000195-Vz) X-Miltered: at concorde by Joe's j-chkmail ("http://j-chkmail.ensmp.fr")! X-Loop: caml-list@inria.fr X-Spam: no; 0.00; caml-list:01 iterator:01 ocaml:01 complexity:02 iterators:02 enforce:02 library:03 stl:03 wondering:04 linear:06 i'm:07 something:09 seem:10 element:11 element:11 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk >>I'm wondering what concepts Ocaml can't express/enforce? > > > Iterators. it's been a long time since i used C++, but i seem to remember that complexity guarantees are also part of the STL specification: something like "to go from element x to element x+n" using a linear iterator takes at most O(n) steps". martin ------------------- 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