1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.BOUNDED_SYNCHRONIZED_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 package body Ada.Containers.Bounded_Synchronized_Queues is
32 package body Implementation is
39 (List : in out List_Type;
40 Element : out Queue_Interfaces.Element_Type)
42 EE : Element_Array renames List.Elements;
45 Element := EE (List.First);
46 List.Length := List.Length - 1;
48 if List.Length = 0 then
52 elsif List.First <= List.Last then
53 List.First := List.First + 1;
56 List.First := List.First + 1;
58 if List.First > List.Capacity then
69 (List : in out List_Type;
70 New_Item : Queue_Interfaces.Element_Type)
73 if List.Length >= List.Capacity then
74 raise Capacity_Error with "No capacity for insertion";
77 if List.Length = 0 then
78 List.Elements (1) := New_Item;
82 elsif List.First <= List.Last then
83 if List.Last < List.Capacity then
84 List.Elements (List.Last + 1) := New_Item;
85 List.Last := List.Last + 1;
88 List.Elements (1) := New_Item;
93 List.Elements (List.Last + 1) := New_Item;
94 List.Last := List.Last + 1;
97 List.Length := List.Length + 1;
99 if List.Length > List.Max_Length then
100 List.Max_Length := List.Length;
108 function Length (List : List_Type) return Count_Type is
117 function Max_Length (List : List_Type) return Count_Type is
119 return List.Max_Length;
124 protected body Queue is
130 function Current_Use return Count_Type is
139 entry Dequeue (Element : out Queue_Interfaces.Element_Type)
143 List.Dequeue (Element);
150 entry Enqueue (New_Item : Queue_Interfaces.Element_Type)
151 when List.Length < Capacity
154 List.Enqueue (New_Item);
161 function Peak_Use return Count_Type is
163 return List.Max_Length;
168 end Ada.Containers.Bounded_Synchronized_Queues;