Re: Doubly linked list.

[Simon Wright <simon@pogner.demon.co.uk>]

"news.oxy.com" <Vladimir_Olensky@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 ... :-)