Re: Queue

[Jeffrey Carter <jrcarter@acm.org>]

steve wrote:
> 
> i have sent up a queue package using head and tail pointers, and have
> procedures for adding, removing and nodes. But l am haveing trouble writing
> a procedure for displaying the nodes. Can anyone send me a procedure where
> you can display all the nodes.

That's quite simple:

generic -- Display_Nodes
   with function End_Of_Nodes return Boolean;
   with function Get (Q : Queue) return Node;
   with procedure Next (Q : in out Queue);
   with procedure Display (N : in Node);
procedure Display_Nodes (Q : in out Queue);

procedure Display_Nodes (Q : in out Queue) is
   -- null;
begin -- Display_Nodes
   All_Nodes : loop
      exit All_Nodes when End_Of_Nodes (Q);

      Display (N => Get (Q) );
      Next (Q => Q);
   end loop All_Nodes;
end Display_Nodes;

Seriously, since we have no idea what your queue package looks like,
what a node looks like, or what you mean by "display", how can you
expect anyone here to be able to do this? If, as seems likely, this is a
homework assignment, no one here will do your homework for you. Your
first place to go for help should be your instructor. If you have
specific problems and your instructor can't help you, then we might be
able to help with a clearly stated and narrowly focused question.

-- 
Jeff Carter
"We call your door-opening request a silly thing."
Monty Python & the Holy Grail