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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,ecfc0548c2df0d76
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-11-11 16:23:43 PST
Path: 
 archiver1.google.com!news2.google.com!fu-berlin.de!cs.tu-berlin.de!uni-duisburg.de!not-for-mail
From: Georg Bauhaus <sb463ba@l1-hrz.uni-duisburg.de>
Newsgroups: comp.lang.ada
Subject: Re: MI ammunition : linked lists
Date: Wed, 12 Nov 2003 00:23:42 +0000 (UTC)
Organization: GMUGHDU
Message-ID: <boruie$kjt$1@a1-hrz.uni-duisburg.de>
References: <mailman.297.1068145350.25614.comp.lang.ada@ada-france.org>
 <borabl$d68$1@a1-hrz.uni-duisburg.de>
 <mailman.325.1068586072.25614.comp.lang.ada@ada-france.org>
NNTP-Posting-Host: l1-hrz.uni-duisburg.de
X-Trace: a1-hrz.uni-duisburg.de 1068596622 21117 134.91.1.34 (12 Nov 2003
 00:23:42 GMT)
X-Complaints-To: usenet@news.uni-duisburg.de
NNTP-Posting-Date: Wed, 12 Nov 2003 00:23:42 +0000 (UTC)
User-Agent: tin/1.5.8-20010221 ("Blue Water") (UNIX) (HP-UX/B.11.00
 (9000/800))
Xref: archiver1.google.com comp.lang.ada:2389
Date: 2003-11-12T00:23:42+00:00
List-Id: <comp.lang.ada>

Marius Amado Alves <amado.alves@netcabo.pt> wrote:
: On Tue, 2003-11-11 at 18:38, Georg Bauhaus wrote:
:> amado.alves <amado.alves@netcabo.pt> wrote:
:> : <<Inheritance should reflect an "is a" relationship. Do you fill comfortable stating that a middle node is a first node and a last
:> : node at the same time?...>>
:> : 
:> : I do saying a Node_Pointing_Both_Ways is a Node_Pointing_Forward and a Node_Pointing_Backward.
:> : 
:> : But I agree with the general advice. Thanks.
:> 
:> Maybe there is another clear picture, if you think of slightly
:> more complex structure than a list. You can "ask" a node, "do
:> you have a predecessor/successor?", but what question are you
:> going to ask a graph node?
:> For example, if a star is a node with indegree >= 5, does it
:> make sense to employ any kind of ihneritance to reflect an
:> indegree of 5?
: 
: The main question to be a asked a graph node is "what nodes are attached
: to you?" The reply is a iterator over the corresponding nodes.
: 
: (Note another reply in this thread made the same claim for MI for linked
: lists regarding names with different names than mine but with the same
: exact meaning.)

Hm, interesting, so the structural relation between nodes in a graph is
provided by an iterator pointing to 0 or more of the neigbours in some
order. That could be applied to lists as well... 

Still the reply is an iterator
pointing_to_this_neighbour, and then also
pointing_to_the_next_neighbour, and then also
..., and finally
???

O.K., I'll stop insiting and iterating.


Georg