Re: TML vs LSP

Article View: comp.sys.mac

Article #14284

#14284

From: othello
Date: Sun, 01 Feb 1987 03:18

10 lines
1098 bytes

In a recent article dlt@csun.UUCP (Dave Thompson) wrote:
>the queens program takes significantly longer to find all (92) 
>solutions than does TML (TML=11 seconds (with printing) vs LSP 2.5-3 
>*minutes* (without printing)).  The source code in both cases is 
>identical.  The LSP compile options (D, N, V, & R) are turned off.  
>Why is LSP so slow?
>
LSP does alot of stuff in its shell -- yes even with all options off... Have
you compared the times with the program compiled as an application and all
options off?  I know that you will find LSP about equal in speed to TML

Technical Details

Message-ID: <2172@batcomputer.tn.cornell.edu>

Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!rutgers!seismo!rochester!cornell!batcomputer!othello

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!rutgers!seismo!rochester!cornell!batcomputer!othello
From: othello@batcomputer.UUCP
Newsgroups: comp.sys.mac
Subject: Re: TML vs LSP
Message-ID: <2172@batcomputer.tn.cornell.edu>
Date: Sat, 31-Jan-87 22:18:41 EST
Article-I.D.: batcompu.2172
Posted: Sat Jan 31 22:18:41 1987
Date-Received: Sun, 1-Feb-87 16:29:50 EST
Reply-To: othello@tesla.ee.cornell.edu
Organization: Cornell University, Ithaca NY, 14853
Lines: 10