Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uflorida!ukma!rutgers!aramis.rutgers.edu!lightning.rutgers.edu!weinrich
From: weinrich@lightning.rutgers.edu (Timothy M. Weinrich)
Newsgroups: comp.lang.lisp
Subject: Re: pointers in Lisp
Message-ID: <Feb.7.11.41.26.1989.517@lightning.rutgers.edu>
Date: 7 Feb 89 16:41:29 GMT
References: <1710@cps3xx.UUCP> <33722@tut.cis.ohio-state.edu> <49734@yale-celray.yale.UUCP>
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 12
Cc: weinrich


	From: Krulwich-Bruce@cs.yale.edu (Bruce Krulwich)
	Subject: Re: pointers in Lisp
	Date: 5 Feb 89 18:21:47 GMT
	A variable-sized array will be both faster and smaller than a
	list.  (Unless you're using a CDR-coded LISP on a LM, in which
	case they're the same.)

   Are you taking into consideration (for example) the bounds-checking
that would almost certainly get compiled into every array reference?

   Twinerik