gcc/ada/a-cbprqu.ads

   1 ------------------------------------------------------------------------------
   2 --                                                                          --
   3 --                         GNAT LIBRARY COMPONENTS                          --
   4 --                                                                          --
   5 --                  ADA.CONTAINERS.BOUNDED_PRIORITY_QUEUES                  --
   6 --                                                                          --
   7 --                                 S p e c                                  --
   8 --                                                                          --
   9 --            Copyright (C) 2011, Free Software Foundation, Inc.            --
  10 --                                                                          --
  11 -- This specification is derived from the Ada Reference Manual for use with --
  12 -- GNAT. The copyright notice above, and the license provisions that follow --
  13 -- apply solely to the  contents of the part following the private keyword. --
  14 --                                                                          --
  15 -- GNAT is free software;  you can  redistribute it  and/or modify it under --
  16 -- terms of the  GNU General Public License as published  by the Free Soft- --
  17 -- ware  Foundation;  either version 3,  or (at your option) any later ver- --
  18 -- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
  19 -- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
  20 -- or FITNESS FOR A PARTICULAR PURPOSE.                                     --
  21 --                                                                          --
  22 -- As a special exception under Section 7 of GPL version 3, you are granted --
  23 -- additional permissions described in the GCC Runtime Library Exception,   --
  24 -- version 3.1, as published by the Free Software Foundation.               --
  25 --                                                                          --
  26 -- You should have received a copy of the GNU General Public License and    --
  27 -- a copy of the GCC Runtime Library Exception along with this program;     --
  28 -- see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see    --
  29 -- <http://www.gnu.org/licenses/>.                                          --
  30 --                                                                          --
  31 -- This unit was originally developed by Matthew J Heaney.                  --
  32 ------------------------------------------------------------------------------
  33
  34 with System;
  35
  36 with Ada.Containers.Synchronized_Queue_Interfaces;
  37 with Ada.Containers.Bounded_Doubly_Linked_Lists;
  38
  39 generic
  40    with package Queue_Interfaces is
  41      new Ada.Containers.Synchronized_Queue_Interfaces (<>);
  42
  43    type Queue_Priority is private;
  44
  45    with function Get_Priority
  46      (Element : Queue_Interfaces.Element_Type) return Queue_Priority is <>;
  47
  48    with function Before
  49      (Left, Right : Queue_Priority) return Boolean is <>;
  50
  51    Default_Capacity : Count_Type;
  52    Default_Ceiling  : System.Any_Priority := System.Priority'Last;
  53
  54 package Ada.Containers.Bounded_Priority_Queues is
  55    pragma Preelaborate;
  56
  57    --  All identifiers in this unit are implementation defined
  58
  59    pragma Implementation_Defined;
  60
  61    package Implementation is
  62
  63       type List_Type (Capacity : Count_Type) is tagged limited private;
  64
  65       procedure Enqueue
  66         (List     : in out List_Type;
  67          New_Item : Queue_Interfaces.Element_Type);
  68
  69       procedure Dequeue
  70         (List    : in out List_Type;
  71          Element : out Queue_Interfaces.Element_Type);
  72
  73       function Length (List : List_Type) return Count_Type;
  74
  75       function Max_Length (List : List_Type) return Count_Type;
  76
  77    private
  78
  79       --  We need a better data structure here, such as a proper heap.  ???
  80
  81       package List_Types is new Bounded_Doubly_Linked_Lists
  82         (Element_Type => Queue_Interfaces.Element_Type,
  83          "="          => Queue_Interfaces."=");
  84
  85       type List_Type (Capacity : Count_Type) is tagged limited record
  86          Container  : List_Types.List (Capacity);
  87          Max_Length : Count_Type := 0;
  88       end record;
  89
  90    end Implementation;
  91
  92    protected type Queue
  93      (Capacity : Count_Type := Default_Capacity;
  94       Ceiling  : System.Any_Priority := Default_Ceiling)
  95    --  ???
  96    --  with Priority => Ceiling is new Queue_Interfaces.Queue with
  97    is new Queue_Interfaces.Queue with
  98
  99       overriding
 100       entry Enqueue (New_Item : Queue_Interfaces.Element_Type);
 101
 102       overriding
 103       entry Dequeue (Element : out Queue_Interfaces.Element_Type);
 104
 105       --  ???
 106       --  not overriding
 107       --  entry Dequeue_Only_High_Priority
 108       --    (Low_Priority : Queue_Priority;
 109       --     Element      : out Queue_Interfaces.Element_Type);
 110
 111       overriding
 112       function Current_Use return Count_Type;
 113
 114       overriding
 115       function Peak_Use return Count_Type;
 116
 117    private
 118       List : Implementation.List_Type (Capacity);
 119
 120    end Queue;
 121
 122 end Ada.Containers.Bounded_Priority_Queues;