From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ebf338b64557dbd2
X-Google-Attributes: gid103376,public
From: wheeler@aphrodite (David Wheeler)
Subject: Re: Linked list problem
Date: 1997/02/18
Message-ID: <5ed9gc$6v0@news.ida.org>#1/1
X-Deja-AN: 219702627
Distribution: world
References: <MBN2IBAT$bBzEwtN@dedlock.demon.co.uk>
Organization: IDA, Alexandria, Virginia
Reply-To: dwheeler@ida.org
Newsgroups: comp.lang.ada
Date: 1997-02-18T00:00:00+00:00
List-Id: <comp.lang.ada>


Blake C Weston (blake@dedlock.demon.co.uk) wrote:
: I have a slight problem. I have been trying to append one linked list to
: another. Unfortunately try as I might, I cannot get the algorithm to
: work correctly.

: As far as I understand, the method by which you append lists is to
: simply make the last node of the list you are appending to 'point' to
: the first node of the other list.

Correct.

You can learn more about how to access types from lesson 12 of Lovelace,
an Ada95 tutorial.  You can go directly to lesson 12 by using
a web browser to open:
 http://www.adahome.com/Tutorials/Lovelace/lesson12.htm

You can start at the beginning of Lovelace by opening:
 http://www.adahome.com/Tutorials/Lovelace/lovelace.htm

A book version of the Lovelace tutorial will soon be available,
probably by the end of March 1997.
The book version will have a number of errors removed and will be
easier to read (useful if you plan to read all of it).


--- David A. Wheeler
    dwheeler@ida.org