From: Pierre Vachon
Subject: Liked list question
Date: 
Message-ID: <vachon.733479176@outaouais>
There might be something I missed, but does CL have provisions
for _doubly_ linked lists? I need a structure that points
to sevral child branches and to it's parent node.

I know I can do this explicitly using structures, but am
wondering if there's a better way (speed & memory-wise).

Thanx,

Pierre.
From: Tim Larkin
Subject: Re: Liked list question
Date: 
Message-ID: <1p9j73INN6ff@newsstand.cit.cornell.edu>
In article <················@outaouais> Pierre Vachon,
······@gel.ulaval.ca writes:
>There might be something I missed, but does CL have provisions
>for _doubly_ linked lists? I need a structure that points
>to sevral child branches and to it's parent node.

Of course. Lisp has provisions for everything!

You can always create a list like this:

(<this-node-stuff> <parent-node> <child-node-1> <child-node-2> ... 
<child-node-n>)

By defining a structure of type list, Lisp will define accessor and 
setter functions for you.

Tim Larkin
Federal Nutrition Laboratory
Tower Road
Ithaca, New York
····@cornell.edu
607-255-7008