Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!husc6!yale!Krulwich-Bruce
From: Krulwich-Bruce@cs.yale.edu (Bruce Krulwich)
Newsgroups: comp.lang.lisp
Subject: Re: pointers in Lisp
Message-ID: <49734@yale-celray.yale.UUCP>
Date: 5 Feb 89 18:21:47 GMT
References: <1710@cps3xx.UUCP> <33722@tut.cis.ohio-state.edu>
Sender: root@yale.UUCP
Reply-To: Krulwich-Bruce@cs.yale.edu (Bruce Krulwich)
Organization: Computer Science, Yale University, New Haven, CT 06520-2158
Lines: 22
In-reply-to: welch@tut.cis.ohio-state.edu (Arun Welch)

In article <33722@tut.cis.ohio-state.edu>, welch@tut (Arun Welch) writes:
>>       I need to implement (in Common Lisp) a structure with pointers. I will
>> use Pascal jargon to best describe it:
>> 
>>            element : record
>>                         data : some_type
>>                         p1   :pointer_to_element
>>                         :
>>                         :
>>                         pk   :pointer_to_element
>>                      end;
>> 
>
>Seeing as how this is lisp, why dont you just use a list?  Unless your CL is 
>incredibly inefficient, mapping over a list of 10 elements is gonna be plenty
>fast, and you'll probably take up less storage than the array.

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.)


Bruce Krulwich