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
X-Google-Thread: 103376,18d9341bd1071f86
X-Google-Attributes: gid103376,public
From: lutz@iks-jena.de (Lutz Donnerhacke)
Subject: Re: Mixin with preelaborated element
Date: 2000/06/01
Message-ID: <slrn8jccvd.sjn.lutz@belenus.iks-jena.de>#1/1
X-Deja-AN: 629815973
Distribution: world
Content-Transfer-Encoding: 8bit
References: <slrn8j9hrm.mk.lutz@taranis.iks-jena.de>
 <6g9Z4.6398$jq6.21214@telenews.teleline.es>
Content-Type: text/plain; charset=iso-8859-1
Organization: IKS GmbH Jena
Mime-Version: 1.0
User-Agent: slrn/0.9.5.7 (UNIX)
Newsgroups: comp.lang.ada
Date: 2000-06-01T00:00:00+00:00
List-Id: <comp.lang.ada>

* Antonio Dur�n Dom�nguez wrote:
>Why don't implement a circular list so that  <last element>.Next accesses to
>List.Start.

I'm looking for a solution, not a workaround. A circular list does indeed
exists in my lib, but it offers an extended interface. I'd like to choose an
implementation based on the needs of the algorithm not based on the
(in)flexibility of the programming language.

BTW: Even a circular list has the same problem: How to provide a base node.