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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,e5327159069b64d5 X-Google-Attributes: gid103376,public From: Simon Wright Subject: Re: Doubly linked list. Date: 1999/01/21 Message-ID: #1/1 X-Deja-AN: 435110729 X-NNTP-Posting-Host: pogner.demon.co.uk:158.152.70.98 References: <7560vn$21e@romeo.logica.co.uk> <781p6h$mlg$1@remarQ.com> <784c6c$d8s$1@remarQ.com> X-Complaints-To: abuse@demon.net X-Trace: news.demon.co.uk 916897829 nnrp-05:4975 NO-IDENT pogner.demon.co.uk:158.152.70.98 Organization: At Home Newsgroups: comp.lang.ada Date: 1999-01-21T00:00:00+00:00 List-Id: "news.oxy.com" writes: > What is regarding quote from Bc.Containars.Lists it sounds quite > natural for me. In the BCs, you can traverse a doubly linked list both ways, but only if you've kept a handle on the head of the list. This has been found surprising by at least one person! > Bc implementation of doubly linked lists is a chain of nodes each > containing pointers to prev. and next nodes as well as reference to > the object denoted by that node (this object may be any kind of > object including list, tree ,buffer, queue e.t.c.). Such object may > belong to more than one list. Moreover it may belong to any other > kind of structure (e.g. tree, list etc.). The BCs work by taking copies of things (the generic parameter Item is private), so to get the semantics you're talking about you need to use (smart) pointers. > If there are some specific question > regarding BC you can ask Simon Wright simon@pogner.demon.co.uk ) who > is maintaining it. I'll ask him then ... :-)