1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.UNBOUNDED_PRIORITY_QUEUES --
9 -- Copyright (C) 2011, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- This unit was originally developed by Matthew J Heaney. --
28 ------------------------------------------------------------------------------
30 with Ada.Unchecked_Deallocation;
32 package body Ada.Containers.Unbounded_Priority_Queues is
34 package body Implementation is
36 -----------------------
37 -- Local Subprograms --
38 -----------------------
41 new Ada.Unchecked_Deallocation (Node_Type, Node_Access);
48 (List : in out List_Type;
49 Element : out Queue_Interfaces.Element_Type)
54 Element := List.First.Element;
57 List.First := List.First.Next;
59 if List.First = null then
63 List.Length := List.Length - 1;
73 (List : in out List_Type;
74 New_Item : Queue_Interfaces.Element_Type)
76 P : constant Queue_Priority := Get_Priority (New_Item);
82 Node := new Node_Type'(New_Item, null);
84 if List.First = null then
86 List.Last := List.First;
91 if Before (P, Get_Priority (Prev.Element)) then
92 Node.Next := List.First;
96 while Prev.Next /= null loop
97 if Before (P, Get_Priority (Prev.Next.Element)) then
98 Node.Next := Prev.Next;
107 if Prev.Next = null then
108 List.Last.Next := Node;
114 List.Length := List.Length + 1;
116 if List.Length > List.Max_Length then
117 List.Max_Length := List.Length;
125 procedure Finalize (List : in out List_Type) is
128 while List.First /= null loop
130 List.First := List.First.Next;
135 ------------------------
136 -- Have_High_Priority --
137 ------------------------
140 -- function Have_High_Priority
141 -- (List : List_Type;
142 -- Low_Priority : Queue_Priority) return Boolean
145 -- if List.Length = 0 then
148 -- return Before (Get_Priority (List.First.Element), Low_Priority);
149 -- end Have_High_Priority;
155 function Length (List : List_Type) return Count_Type is
164 function Max_Length (List : List_Type) return Count_Type is
166 return List.Max_Length;
171 protected body Queue is
177 function Current_Use return Count_Type is
186 entry Dequeue (Element : out Queue_Interfaces.Element_Type)
190 List.Dequeue (Element);
194 -- entry Dequeue_Only_High_Priority
195 -- (Low_Priority : Queue_Priority;
196 -- Element : out Queue_Interfaces.Element_Type) when True
200 -- end Dequeue_Only_High_Priority;
206 entry Enqueue (New_Item : Queue_Interfaces.Element_Type) when True is
208 List.Enqueue (New_Item);
215 function Peak_Use return Count_Type is
217 return List.Max_Length;
222 end Ada.Containers.Unbounded_Priority_Queues;