comp.lang.ada
 help / color / mirror / Atom feed
From: "Mark Lundquist" <mlundquist2@attbi.com>
Subject: Re: List Strawman JC01
Date: Sun, 09 Dec 2001 14:04:56 GMT
Date: 2001-12-09T14:04:56+00:00	[thread overview]
Message-ID: <ccKQ7.23844$Yy.296947@rwcrnsc53> (raw)
In-Reply-To: rk8Q7.53164$xS6.87831@www.newsranger.com


"Ted Dennison" <dennison@telepath.com> wrote in message
news:rk8Q7.53164$xS6.87831@www.newsranger.com...
> In article <uk7vzudrz.fsf@gsfc.nasa.gov>, Stephen Leake says...
> >
> >I don't think "Front" and "Back" are significantly more
> >"directionless" than "First" and "Last". "A" and "B" would be more
> >directionless, although even those have an alphabetical order.
>
> I thought a lot about this, and I couldn't really come up with anything
more
> neutral. "A" and "B" (or "A" and "Z") do imply an order (alphabetical).
"First"
> and "Last" obviously do too for the same reason. Even "Left" and "Right"
imply
> an order (reading order). That order is different for some people than it
is for
> others, but each individual reader will have a specific order it implies
to
> them.
>
[snip]
> you can find the ends, and we do have to arbitrarily label each
> end *something*. We just have to find nice linear but direction-neutral
> somethings to name them.

Why don't you name it after the cartoon character CatDog, who has the heads
of a Cat and a Dog on either end?

    function Cat (List : Lists.List) return Iterator;
    function Dog (List : Lists.List) return Iterator;

    type Direction is (Catward, Dogward);

Picture a CatDog, rotating slowly in empty space.  How can you tell which
end is the Cat and which end is the Dog?  The point is, *you*can*.

:-) :-) :-)
-- mark






  reply	other threads:[~2001-12-09 14:04 UTC|newest]

Thread overview: 39+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2001-12-05  6:08 List Strawman JC01 Jeffrey Carter
2001-12-05 19:14 ` Ted Dennison
2001-12-06  0:14   ` Jeffrey Carter
2001-12-06  3:15     ` Jeffrey Carter
2001-12-06 16:11     ` Ted Dennison
2001-12-06 17:48       ` Jeffrey Carter
2001-12-07 15:06         ` Ted Dennison
2001-12-07 17:43           ` Stephen Leake
2001-12-07 18:59             ` Ted Dennison
2001-12-09 14:04               ` Mark Lundquist [this message]
2001-12-10 15:25                 ` Ted Dennison
2001-12-10 15:46               ` Marin David Condic
2001-12-10 17:12                 ` Ted Dennison
2001-12-07 18:10           ` Jeffrey Carter
2001-12-07 19:45             ` Ted Dennison
2001-12-07 22:47               ` Basic Properties of Lists Jeffrey Carter
2001-12-09 14:04                 ` Mark Lundquist
2001-12-09 18:16                   ` Chad R. Meiners
2001-12-09 21:21                   ` Jeffrey Carter
2001-12-10 15:37                   ` Ted Dennison
2001-12-10 22:13                     ` Jeffrey Carter
2001-12-11 14:33                       ` Ted Dennison
2001-12-09 14:04           ` List Strawman JC01 Mark Lundquist
2001-12-10 17:02             ` Ted Dennison
2001-12-10 17:13               ` Ted Dennison
2001-12-10 15:37           ` Marin David Condic
2001-12-10 16:10             ` Larry Hazel
2001-12-06 19:09       ` Stephen Leake
2001-12-06 22:45         ` Jeffrey Carter
2001-12-07 16:54           ` Ted Dennison
2001-12-07 17:18             ` Darren New
2001-12-07 17:44               ` Doubly-linked list ordering(s) (was: List Strawman JC01) Ted Dennison
2001-12-07 17:30         ` List Strawman JC01 Ted Dennison
2001-12-06 19:34     ` Mark Lundquist
2001-12-07 17:04       ` Ted Dennison
2001-12-07 22:27         ` Jeffrey Carter
2001-12-09 14:04         ` Mark Lundquist
2001-12-06 19:34   ` Mark Lundquist
2001-12-06 23:09 ` Nick Roberts
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox