gcc/ada/a-cborma.ads

   1 ------------------------------------------------------------------------------
   2 --                                                                          --
   3 --                         GNAT LIBRARY COMPONENTS                          --
   4 --                                                                          --
   5 --   A D A . C O N T A I N E R S . B O U N D E D _ O R D E R E D _ M A P S  --
   6 --                                                                          --
   7 --                                 S p e c                                  --
   8 --                                                                          --
   9 --          Copyright (C) 2004-2013, 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 Ada.Iterator_Interfaces;
  35
  36 private with Ada.Containers.Red_Black_Trees;
  37 private with Ada.Streams;
  38 private with Ada.Finalization;
  39
  40 generic
  41    type Key_Type is private;
  42    type Element_Type is private;
  43
  44    with function "<" (Left, Right : Key_Type) return Boolean is <>;
  45    with function "=" (Left, Right : Element_Type) return Boolean is <>;
  46
  47 package Ada.Containers.Bounded_Ordered_Maps is
  48    pragma Pure;
  49    pragma Remote_Types;
  50
  51    function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
  52
  53    type Map (Capacity : Count_Type) is tagged private with
  54       Constant_Indexing => Constant_Reference,
  55       Variable_Indexing => Reference,
  56       Default_Iterator  => Iterate,
  57       Iterator_Element  => Element_Type;
  58
  59    pragma Preelaborable_Initialization (Map);
  60
  61    type Cursor is private;
  62    pragma Preelaborable_Initialization (Cursor);
  63
  64    Empty_Map : constant Map;
  65
  66    No_Element : constant Cursor;
  67
  68    function Has_Element (Position : Cursor) return Boolean;
  69
  70    package Map_Iterator_Interfaces is new
  71      Ada.Iterator_Interfaces (Cursor, Has_Element);
  72
  73    function "=" (Left, Right : Map) return Boolean;
  74
  75    function Length (Container : Map) return Count_Type;
  76
  77    function Is_Empty (Container : Map) return Boolean;
  78
  79    procedure Clear (Container : in out Map);
  80
  81    function Key (Position : Cursor) return Key_Type;
  82
  83    function Element (Position : Cursor) return Element_Type;
  84
  85    procedure Replace_Element
  86      (Container : in out Map;
  87       Position  : Cursor;
  88       New_Item  : Element_Type);
  89
  90    procedure Query_Element
  91      (Position : Cursor;
  92       Process  : not null access
  93                    procedure (Key : Key_Type; Element : Element_Type));
  94
  95    procedure Update_Element
  96      (Container : in out Map;
  97       Position  : Cursor;
  98       Process   : not null access
  99                     procedure (Key : Key_Type; Element : in out Element_Type));
 100
 101    type Constant_Reference_Type
 102       (Element : not null access constant Element_Type) is private
 103    with
 104       Implicit_Dereference => Element;
 105
 106    type Reference_Type (Element : not null access Element_Type) is private
 107    with
 108       Implicit_Dereference => Element;
 109
 110    function Constant_Reference
 111      (Container : aliased Map;
 112       Position  : Cursor) return Constant_Reference_Type;
 113
 114    function Reference
 115      (Container : aliased in out Map;
 116       Position  : Cursor) return Reference_Type;
 117
 118    function Constant_Reference
 119      (Container : aliased Map;
 120       Key       : Key_Type) return Constant_Reference_Type;
 121
 122    function Reference
 123      (Container : aliased in out Map;
 124       Key       : Key_Type) return Reference_Type;
 125
 126    procedure Assign (Target : in out Map; Source : Map);
 127
 128    function Copy (Source : Map; Capacity : Count_Type := 0) return Map;
 129
 130    procedure Move (Target : in out Map; Source : in out Map);
 131
 132    procedure Insert
 133      (Container : in out Map;
 134       Key       : Key_Type;
 135       New_Item  : Element_Type;
 136       Position  : out Cursor;
 137       Inserted  : out Boolean);
 138
 139    procedure Insert
 140      (Container : in out Map;
 141       Key       : Key_Type;
 142       Position  : out Cursor;
 143       Inserted  : out Boolean);
 144
 145    procedure Insert
 146      (Container : in out Map;
 147       Key       : Key_Type;
 148       New_Item  : Element_Type);
 149
 150    procedure Include
 151      (Container : in out Map;
 152       Key       : Key_Type;
 153       New_Item  : Element_Type);
 154
 155    procedure Replace
 156      (Container : in out Map;
 157       Key       : Key_Type;
 158       New_Item  : Element_Type);
 159
 160    procedure Exclude (Container : in out Map; Key : Key_Type);
 161
 162    procedure Delete (Container : in out Map; Key : Key_Type);
 163
 164    procedure Delete (Container : in out Map; Position : in out Cursor);
 165
 166    procedure Delete_First (Container : in out Map);
 167
 168    procedure Delete_Last (Container : in out Map);
 169
 170    function First (Container : Map) return Cursor;
 171
 172    function First_Element (Container : Map) return Element_Type;
 173
 174    function First_Key (Container : Map) return Key_Type;
 175
 176    function Last (Container : Map) return Cursor;
 177
 178    function Last_Element (Container : Map) return Element_Type;
 179
 180    function Last_Key (Container : Map) return Key_Type;
 181
 182    function Next (Position : Cursor) return Cursor;
 183
 184    procedure Next (Position : in out Cursor);
 185
 186    function Previous (Position : Cursor) return Cursor;
 187
 188    procedure Previous (Position : in out Cursor);
 189
 190    function Find (Container : Map; Key : Key_Type) return Cursor;
 191
 192    function Element (Container : Map; Key : Key_Type) return Element_Type;
 193
 194    function Floor (Container : Map; Key : Key_Type) return Cursor;
 195
 196    function Ceiling (Container : Map; Key : Key_Type) return Cursor;
 197
 198    function Contains (Container : Map; Key : Key_Type) return Boolean;
 199
 200    function "<" (Left, Right : Cursor) return Boolean;
 201
 202    function ">" (Left, Right : Cursor) return Boolean;
 203
 204    function "<" (Left : Cursor; Right : Key_Type) return Boolean;
 205
 206    function ">" (Left : Cursor; Right : Key_Type) return Boolean;
 207
 208    function "<" (Left : Key_Type; Right : Cursor) return Boolean;
 209
 210    function ">" (Left : Key_Type; Right : Cursor) return Boolean;
 211
 212    procedure Iterate
 213      (Container : Map;
 214       Process   : not null access procedure (Position : Cursor));
 215
 216    procedure Reverse_Iterate
 217      (Container : Map;
 218       Process   : not null access procedure (Position : Cursor));
 219
 220    function Iterate
 221      (Container : Map)
 222       return Map_Iterator_Interfaces.Reversible_Iterator'Class;
 223
 224    function Iterate
 225      (Container : Map;
 226       Start     : Cursor)
 227       return Map_Iterator_Interfaces.Reversible_Iterator'Class;
 228
 229 private
 230
 231    pragma Inline (Next);
 232    pragma Inline (Previous);
 233
 234    type Node_Type is record
 235       Parent  : Count_Type;
 236       Left    : Count_Type;
 237       Right   : Count_Type;
 238       Color   : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
 239       Key     : Key_Type;
 240       Element : aliased Element_Type;
 241    end record;
 242
 243    package Tree_Types is
 244      new Red_Black_Trees.Generic_Bounded_Tree_Types (Node_Type);
 245
 246    type Map (Capacity : Count_Type) is
 247      new Tree_Types.Tree_Type (Capacity) with null record;
 248
 249    use Red_Black_Trees;
 250    use Tree_Types;
 251    use Ada.Streams;
 252
 253    procedure Write
 254      (Stream    : not null access Root_Stream_Type'Class;
 255       Container : Map);
 256
 257    for Map'Write use Write;
 258
 259    procedure Read
 260      (Stream    : not null access Root_Stream_Type'Class;
 261       Container : out Map);
 262
 263    for Map'Read use Read;
 264
 265    type Map_Access is access all Map;
 266    for Map_Access'Storage_Size use 0;
 267
 268    type Cursor is record
 269       Container : Map_Access;
 270       Node      : Count_Type := 0;
 271    end record;
 272
 273    procedure Write
 274      (Stream : not null access Root_Stream_Type'Class;
 275       Item   : Cursor);
 276
 277    for Cursor'Write use Write;
 278
 279    procedure Read
 280      (Stream : not null access Root_Stream_Type'Class;
 281       Item   : out Cursor);
 282
 283    for Cursor'Read use Read;
 284
 285    type Constant_Reference_Type
 286       (Element : not null access constant Element_Type) is null record;
 287
 288    procedure Read
 289      (Stream : not null access Root_Stream_Type'Class;
 290       Item   : out Constant_Reference_Type);
 291
 292    for Constant_Reference_Type'Read use Read;
 293
 294    procedure Write
 295      (Stream : not null access Root_Stream_Type'Class;
 296       Item   : Constant_Reference_Type);
 297
 298    for Constant_Reference_Type'Write use Write;
 299
 300    type Reference_Type
 301       (Element : not null access Element_Type) is null record;
 302
 303    procedure Read
 304      (Stream : not null access Root_Stream_Type'Class;
 305       Item   : out Reference_Type);
 306
 307    for Reference_Type'Read use Read;
 308
 309    procedure Write
 310      (Stream : not null access Root_Stream_Type'Class;
 311       Item   : Reference_Type);
 312
 313    for Reference_Type'Write use Write;
 314
 315    Empty_Map : constant Map := Map'(Tree_Type with Capacity => 0);
 316
 317    No_Element : constant Cursor := Cursor'(null, 0);
 318
 319    use Ada.Finalization;
 320
 321    type Iterator is new Limited_Controlled and
 322      Map_Iterator_Interfaces.Reversible_Iterator with
 323    record
 324       Container : Map_Access;
 325       Node      : Count_Type;
 326    end record;
 327
 328    overriding procedure Finalize (Object : in out Iterator);
 329
 330    overriding function First (Object : Iterator) return Cursor;
 331    overriding function Last  (Object : Iterator) return Cursor;
 332
 333    overriding function Next
 334      (Object   : Iterator;
 335       Position : Cursor) return Cursor;
 336
 337    overriding function Previous
 338      (Object   : Iterator;
 339       Position : Cursor) return Cursor;
 340
 341 end Ada.Containers.Bounded_Ordered_Maps;