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 SAA01066; Thu, 23 Aug 2001 18:11:09 +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 SAA01111 for ; Thu, 23 Aug 2001 18:11:09 +0200 (MET DST) Received: from wsnyc.fame.com (pixnj254.fame.com [192.88.60.254]) by nez-perce.inria.fr (8.11.1/8.10.0) with ESMTP id f7NGB7X02084 for ; Thu, 23 Aug 2001 18:11:08 +0200 (MET DST) Received: from CONSULTING2000P (dhcp-ny-245.fame.com [192.88.66.245]) by wsnyc.fame.com (8.9.3/8.9.3) with ESMTP id MAA15806 for ; Thu, 23 Aug 2001 12:11:04 -0400 (EDT) From: "Collin Monahan" To: Subject: [Caml-list] time complexity on basic data types Date: Thu, 23 Aug 2001 12:16:56 -0400 Organization: FAME Information Services, Inc. Message-ID: <000001c12bef$07df7e30$f54258c0@CONSULTING2000P> MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0001_01C12BCD.80CF64D0" X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook, Build 10.0.2627 Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4522.1200 Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk This is a multi-part message in MIME format. ------=_NextPart_000_0001_01C12BCD.80CF64D0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Thanks to everyone who answered my questions yesterday. With respect to arrays and lists, is the complexity for operations on these data structures like "normal?" E.g. random access in arrays in constant time, insertion in lists in constant time, random access in lists in linear time . . . What facilities exist for timing constructs in Caml? I see val times : unit -> process_times in the manual, under unix system calls. If this is like the times() function in Solaris, then it would work. But I think the Caml syntax is messing me up again, because if I type times();; or let foo = times();; into the toplevel, the system indicates that "times" is not bound. Collin Monahan ------=_NextPart_000_0001_01C12BCD.80CF64D0 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: quoted-printable

 

Thanks to everyone who answered my questions = yesterday.

 

With respect to arrays and lists, is the complexity = for operations on these data structures like “normal?” E.g. = random access in arrays in constant time, insertion in lists in constant time, = random access in lists in linear time . . .

 

What facilities exist for timing constructs in Caml? = I see

        = ;    val times : unit -> = process_times

in the = manual, under unix system calls. If this is like the times() function in Solaris, then it would work. But I think the Caml syntax is messing = me up again, because if I type

        = ;    times();;

or

        = ;    let foo =3D times();;

into the toplevel, the system indicates that “times” is not = bound.

 

Collin = Monahan

 

------=_NextPart_000_0001_01C12BCD.80CF64D0-- ------------------- Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr