gcc/ada/a-ciormu.ads

   1 ------------------------------------------------------------------------------
   2 --                                                                          --
   3 --                         GNAT LIBRARY COMPONENTS                          --
   4 --                                                                          --
   5 --                      A D A . C O N T A I N E R S .                       --
   6 --         I N D E F I N I T E _ O R D E R E D _ M U L T I S E T S          --
   7 --                                                                          --
   8 --                                 S p e c                                  --
   9 --                                                                          --
  10 --          Copyright (C) 2004-2005 Free Software Foundation, Inc.          --
  11 --                                                                          --
  12 -- This specification is derived from the Ada Reference Manual for use with --
  13 -- GNAT. The copyright notice above, and the license provisions that follow --
  14 -- apply solely to the  contents of the part following the private keyword. --
  15 --                                                                          --
  16 -- GNAT is free software;  you can  redistribute it  and/or modify it under --
  17 -- terms of the  GNU General Public License as published  by the Free Soft- --
  18 -- ware  Foundation;  either version 2,  or (at your option) any later ver- --
  19 -- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
  20 -- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
  21 -- or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License --
  22 -- for  more details.  You should have  received  a copy of the GNU General --
  23 -- Public License  distributed with GNAT;  see file COPYING.  If not, write --
  24 -- to  the  Free Software Foundation,  51  Franklin  Street,  Fifth  Floor, --
  25 -- Boston, MA 02110-1301, USA.                                              --
  26 --                                                                          --
  27 -- As a special exception,  if other files  instantiate  generics from this --
  28 -- unit, or you link  this unit with other files  to produce an executable, --
  29 -- this  unit  does not  by itself cause  the resulting  executable  to  be --
  30 -- covered  by the  GNU  General  Public  License.  This exception does not --
  31 -- however invalidate  any other reasons why  the executable file  might be --
  32 -- covered by the  GNU Public License.                                      --
  33 --                                                                          --
  34 -- This unit was originally developed by Matthew J Heaney.                  --
  35 ------------------------------------------------------------------------------
  36
  37 with Ada.Containers.Red_Black_Trees;
  38 with Ada.Finalization;
  39 with Ada.Streams;
  40
  41 generic
  42    type Element_Type (<>) is private;
  43
  44    with function "<" (Left, Right : Element_Type) return Boolean is <>;
  45    with function "=" (Left, Right : Element_Type) return Boolean is <>;
  46
  47 package Ada.Containers.Indefinite_Ordered_Multisets is
  48 pragma Preelaborate (Indefinite_Ordered_Multisets);
  49
  50    type Set is tagged private;
  51
  52    type Cursor is private;
  53
  54    Empty_Set : constant Set;
  55
  56    No_Element : constant Cursor;
  57
  58    function "=" (Left, Right : Set) return Boolean;
  59
  60    function Equivalent_Sets (Left, Right : Set) return Boolean;
  61
  62    function Length (Container : Set) return Count_Type;
  63
  64    function Is_Empty (Container : Set) return Boolean;
  65
  66    procedure Clear (Container : in out Set);
  67
  68    function Element (Position : Cursor) return Element_Type;
  69
  70    procedure Query_Element
  71      (Position : Cursor;
  72       Process  : not null access procedure (Element : Element_Type));
  73
  74    procedure Replace_Element
  75      (Container : Set;
  76       Position  : Cursor;
  77       By        : Element_Type);
  78
  79    procedure Move (Target : in out Set; Source : in out Set);
  80
  81    procedure Insert
  82      (Container : in out Set;
  83       New_Item  : Element_Type;
  84       Position  : out Cursor);
  85
  86    procedure Insert (Container : in out Set; New_Item : Element_Type);
  87
  88    procedure Delete (Container : in out Set; Item : Element_Type);
  89
  90    procedure Delete (Container : in out Set; Position : in out Cursor);
  91
  92    procedure Delete_First (Container : in out Set);
  93
  94    procedure Delete_Last (Container : in out Set);
  95
  96    procedure Exclude (Container : in out Set; Item : Element_Type);
  97
  98    procedure Union (Target : in out Set;
  99                     Source : Set);
 100
 101    function Union (Left, Right : Set) return Set;
 102
 103    function "or" (Left, Right : Set) return Set renames Union;
 104
 105    procedure Intersection (Target : in out Set; Source : Set);
 106
 107    function Intersection (Left, Right : Set) return Set;
 108
 109    function "and" (Left, Right : Set) return Set renames Intersection;
 110
 111    procedure Difference (Target : in out Set; Source : Set);
 112
 113    function Difference (Left, Right : Set) return Set;
 114
 115    function "-" (Left, Right : Set) return Set renames Difference;
 116
 117    procedure Symmetric_Difference (Target : in out Set; Source : Set);
 118
 119    function Symmetric_Difference (Left, Right : Set) return Set;
 120
 121    function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
 122
 123    function Overlap (Left, Right : Set) return Boolean;
 124
 125    function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
 126
 127    function Contains (Container : Set; Item : Element_Type) return Boolean;
 128
 129    function Find (Container : Set; Item : Element_Type) return Cursor;
 130
 131    function Floor (Container : Set; Item : Element_Type) return Cursor;
 132
 133    function Ceiling (Container : Set; Item : Element_Type) return Cursor;
 134
 135    function First (Container : Set) return Cursor;
 136
 137    function First_Element (Container : Set) return Element_Type;
 138
 139    function Last (Container : Set) return Cursor;
 140
 141    function Last_Element (Container : Set) return Element_Type;
 142
 143    function Next (Position : Cursor) return Cursor;
 144
 145    procedure Next (Position : in out Cursor);
 146
 147    function Previous (Position : Cursor) return Cursor;
 148
 149    procedure Previous (Position : in out Cursor);
 150
 151    function Has_Element (Position : Cursor) return Boolean;
 152
 153    function "<" (Left, Right : Cursor) return Boolean;
 154
 155    function ">" (Left, Right : Cursor) return Boolean;
 156
 157    function "<" (Left : Cursor; Right : Element_Type) return Boolean;
 158
 159    function ">" (Left : Cursor; Right : Element_Type) return Boolean;
 160
 161    function "<" (Left : Element_Type; Right : Cursor) return Boolean;
 162
 163    function ">" (Left : Element_Type; Right : Cursor) return Boolean;
 164
 165    procedure Iterate
 166      (Container : Set;
 167       Process   : not null access procedure (Position : Cursor));
 168
 169    procedure Reverse_Iterate
 170      (Container : Set;
 171       Process   : not null access procedure (Position : Cursor));
 172
 173    procedure Iterate
 174      (Container : Set;
 175       Item      : Element_Type;
 176       Process   : not null access procedure (Position : Cursor));
 177
 178    procedure Reverse_Iterate
 179      (Container : Set;
 180       Item      : Element_Type;
 181       Process   : not null access procedure (Position : Cursor));
 182
 183    generic
 184
 185       type Key_Type (<>) is limited private;
 186
 187       with function Key (Element : Element_Type) return Key_Type;
 188
 189       with function "<" (Left : Key_Type; Right : Element_Type)
 190           return Boolean is <>;
 191
 192       with function ">" (Left : Key_Type; Right : Element_Type)
 193           return Boolean is <>;
 194
 195    package Generic_Keys is
 196
 197       function Contains (Container : Set; Key : Key_Type) return Boolean;
 198
 199       function Find (Container : Set; Key : Key_Type) return Cursor;
 200
 201       function Floor (Container : Set; Key : Key_Type) return Cursor;
 202
 203       function Ceiling (Container : Set; Key : Key_Type) return Cursor;
 204
 205       function Key (Position : Cursor) return Key_Type;
 206
 207       function Element (Container : Set; Key : Key_Type) return Element_Type;
 208
 209       procedure Delete (Container : in out Set; Key : Key_Type);
 210
 211       procedure Exclude (Container : in out Set; Key : Key_Type);
 212
 213       function "<" (Left : Cursor; Right : Key_Type) return Boolean;
 214
 215       function ">" (Left : Cursor; Right : Key_Type) return Boolean;
 216
 217       function "<" (Left : Key_Type; Right : Cursor) return Boolean;
 218
 219       function ">" (Left : Key_Type; Right : Cursor) return Boolean;
 220
 221       procedure Update_Element_Preserving_Key
 222         (Container : in out Set;
 223          Position  : Cursor;
 224          Process   : not null access
 225                        procedure (Element : in out Element_Type));
 226
 227       procedure Iterate
 228         (Container : Set;
 229          Key       : Key_Type;
 230          Process   : not null access procedure (Position : Cursor));
 231
 232       procedure Reverse_Iterate
 233         (Container : Set;
 234          Key       : Key_Type;
 235          Process   : not null access procedure (Position : Cursor));
 236
 237    end Generic_Keys;
 238
 239 private
 240
 241    type Node_Type;
 242    type Node_Access is access Node_Type;
 243
 244    type Element_Access is access Element_Type;
 245
 246    type Node_Type is limited record
 247       Parent  : Node_Access;
 248       Left    : Node_Access;
 249       Right   : Node_Access;
 250       Color   : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
 251       Element : Element_Access;
 252    end record;
 253
 254    package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
 255      (Node_Type,
 256       Node_Access);
 257
 258    type Set is new Ada.Finalization.Controlled with record
 259       Tree : Tree_Types.Tree_Type;
 260    end record;
 261
 262    procedure Adjust (Container : in out Set);
 263
 264    procedure Finalize (Container : in out Set) renames Clear;
 265
 266    use Red_Black_Trees;
 267    use Tree_Types;
 268    use Ada.Finalization;
 269
 270    type Set_Access is access all Set;
 271    for Set_Access'Storage_Size use 0;
 272
 273    type Cursor is record
 274       Container : Set_Access;
 275       Node      : Node_Access;
 276    end record;
 277
 278    No_Element : constant Cursor := Cursor'(null, null);
 279
 280    use Ada.Streams;
 281
 282    procedure Write (Stream : access Root_Stream_Type'Class; Container : Set);
 283
 284    for Set'Write use Write;
 285
 286    procedure Read
 287      (Stream    : access Root_Stream_Type'Class;
 288       Container : out Set);
 289
 290    for Set'Read use Read;
 291
 292    Empty_Set : constant Set :=
 293                  (Controlled with Tree => (First  => null,
 294                                            Last   => null,
 295                                            Root   => null,
 296                                            Length => 0,
 297                                            Busy   => 0,
 298                                            Lock   => 0));
 299
 300 end Ada.Containers.Indefinite_Ordered_Multisets;