From: Ted Dennison <dennison@telepath.com>
Subject: Re: Ada Queue
Date: 2000/04/07
Date: 2000-04-07T00:00:00+00:00 [thread overview]
Message-ID: <8ckrt6$nas$1@nnrp1.deja.com> (raw)
In-Reply-To: 20000406215553.00917.00000166@ng-dh1.aol.com
In article <20000406215553.00917.00000166@ng-dh1.aol.com>,
maggiejohn@aol.com (MaggieJohn) wrote:
> Also - add new nodes to the head of the queue. You don't want to
> walk the queue every time you add a node.
Then you've to to walk the queue every time you *remove* a node. It's
really 6 of one, half a donzen of another.
Of course you can avoid the problem by making a "Queue" a record
containg pointers to the head and tail objects. But not with this
algorithm.
--
T.E.D.
http://www.telepath.com/~dennison/Ted/TED.html
Sent via Deja.com http://www.deja.com/
Before you buy.
next prev parent reply other threads:[~2000-04-07 0:00 UTC|newest]
Thread overview: 20+ messages / expand[flat|nested] mbox.gz Atom feed top
2000-04-06 0:00 Ada Queue Joseph T.
2000-04-06 0:00 ` Ted Dennison
2000-04-06 0:00 ` Joseph T
2000-04-06 0:00 ` Robert Dewar
2000-04-06 0:00 ` Joseph T
2000-04-07 0:00 ` Ole-Hjalmar Kristensen
2000-04-06 0:00 ` Ted Dennison
2000-04-06 0:00 ` Ted Dennison
2000-04-06 0:00 ` Joseph T.
2000-04-07 0:00 ` Ole-Hjalmar Kristensen
2000-04-07 0:00 ` Joseph T
2000-04-07 0:00 ` Ted Dennison
2000-04-07 0:00 ` Ted Dennison
2000-04-07 0:00 ` Hyman Rosen
2000-04-06 0:00 ` tmoran
2000-04-08 0:00 ` tmoran
2000-04-07 0:00 ` MaggieJohn
2000-04-07 0:00 ` Ted Dennison [this message]
2000-04-07 0:00 ` Simon Wright
2000-04-09 0:00 ` Robert Dewar
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox