Re: Non destructive summation of nodes (Linked List/FIFO Queue)

[James Rogers <jimmaureenrogers@worldnet.att.net>]

Of course, a very simple solution is to merely create a "print" 
procedure for the Queue type. This procedure could visit each node
in the queue and Put the element without removing any element from the
Queue.

Jim Rogers

Larry Hazel wrote:
> 
> Another thought is to add each removed element to another queue.  So, you've
> still got the queue after displaying each element.  It just has a different
> name.
> 
> Liddle Feesh wrote:
> >
> > Michal suggested:
> >
> > while not (Queue.Is_Empty_Queue(Queue) ) loop
> >         Queues.Remove (Element, Queue);
>           -- Add the removed element to another queue
>           Queues.Add (Element, Another_Queue);
> >         Put(Element);
> >         New_Line;
> > end loop;
> >
> > ------
> >
> > However, the above basically removes each node whilst 'counting' back the
> > values stored in each.
> >
> 
> Larry