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=-2.9 required=5.0 tests=BAYES_00,MAILING_LIST_MULTI autolearn=unavailable autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a676349b69fa778f X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-02-13 07:38:13 PST Path: supernews.google.com!sn-xit-02!supernews.com!news.tele.dk!213.56.195.71!fr.usenet-edu.net!usenet-edu.net!enst!enst.fr!not-for-mail From: schwarza@gdls.com Newsgroups: comp.lang.ada Subject: Re: Help: my list adt is broken Date: Tue, 13 Feb 2001 10:35:38 -0500 Organization: ENST, France Sender: comp.lang.ada-admin@ada.eu.org Message-ID: Reply-To: comp.lang.ada@ada.eu.org NNTP-Posting-Host: marvin.enst.fr Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: avanie.enst.fr 982078692 58378 137.194.161.2 (13 Feb 2001 15:38:12 GMT) X-Complaints-To: usenet@enst.fr NNTP-Posting-Date: Tue, 13 Feb 2001 15:38:12 +0000 (UTC) To: chris.danx@ntlworld.com, comp.lang.ada@ada.eu.org Return-Path: X-Mailer: Lotus Notes Release 5.0.1a (Intl) 17 August 1999 X-MIMETrack: Serialize by Router on STL01/SRV/LS/GDYN(Release 5.0.5 |September 22, 2000) at 02/13/2001 10: 35:40 AM, Itemize by SMTP Server on STLHUB/SRV/LS/GDYN(Release 5.0.5 |September 22, 2000) at 02/13/2001 10: 35:40 AM, Serialize by Router on STLHUB/SRV/LS/GDYN(Release 5.0.5 |September 22, 2000) at 02/13/2001 10: 35:42 AM, Serialize complete at 02/13/2001 10: 35:42 AM Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org X-Mailman-Version: 2.0 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: comp.lang.ada mail<->news gateway List-Unsubscribe: , List-Archive: Errors-To: comp.lang.ada-admin@ada.eu.org X-BeenThere: comp.lang.ada@ada.eu.org Xref: supernews.google.com comp.lang.ada:5221 Date: 2001-02-13T10:35:38-05:00 From: "chris.danx" Actually, it isn't a homework assignment! I always get in trouble when I jump to contusions. Sorry! [1] Algorithms for linked lists are standard fare in textbooks on Data Structures and on Algorithms (and sometimes on Compiler Design). I assume that you have them and have looked at them. Mine are old (old ... old - but still good.) [2] There are a number of Ada implementations of the C Standard Template Library (?) STL. If you are interested I'll try to find some URL's and send them to you. [3] I have a full implementation of SLIP, a really full implementation of doubly linked lists akin to LISP, written in C and Ada83, both languages without class. And, I have a word document which is a retyped version (with diagrams) of a SLIP description written in Sammett's book "Programming Languages", 1967. The book stuff is excellent. My internal documentation is almost non-existent. If you'd like, I'll send the whole nine yards to you - tho' I advise a shovel for the dirt. (There are some reasonable extensions yet to be done that have been on my 'wannado' list for years - hint, hint, hint. One is an implementation for dynamic memory management. Because the 'language' is written as an API it is really not possible to write something for dynamic memory management (with garbage collection) but that doesn't mean that something can't be done.) Other than that, nothing. Sorry. art