1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.BOUNDED_SYNCHRONIZED_QUEUES --
9 -- Copyright (C) 2011-2014, 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 pragma Annotate (CodePeer, Skip_Analysis);
34 package body Implementation is
41 (List : in out List_Type;
42 Element : out Queue_Interfaces.Element_Type)
44 EE : Element_Array renames List.Elements;
47 Element := EE (List.First);
48 List.Length := List.Length - 1;
50 if List.Length = 0 then
54 elsif List.First <= List.Last then
55 List.First := List.First + 1;
58 List.First := List.First + 1;
60 if List.First > List.Capacity then
71 (List : in out List_Type;
72 New_Item : Queue_Interfaces.Element_Type)
75 if List.Length >= List.Capacity then
76 raise Capacity_Error with "No capacity for insertion";
79 if List.Length = 0 then
80 List.Elements (1) := New_Item;
84 elsif List.First <= List.Last then
85 if List.Last < List.Capacity then
86 List.Elements (List.Last + 1) := New_Item;
87 List.Last := List.Last + 1;
90 List.Elements (1) := New_Item;
95 List.Elements (List.Last + 1) := New_Item;
96 List.Last := List.Last + 1;
99 List.Length := List.Length + 1;
101 if List.Length > List.Max_Length then
102 List.Max_Length := List.Length;
110 function Length (List : List_Type) return Count_Type is
119 function Max_Length (List : List_Type) return Count_Type is
121 return List.Max_Length;
126 protected body Queue is
132 function Current_Use return Count_Type is
141 entry Dequeue (Element : out Queue_Interfaces.Element_Type)
145 List.Dequeue (Element);
152 entry Enqueue (New_Item : Queue_Interfaces.Element_Type)
153 when List.Length < Capacity
156 List.Enqueue (New_Item);
163 function Peak_Use return Count_Type is
165 return List.Max_Length;
170 end Ada.Containers.Bounded_Synchronized_Queues;