gcc/ada/a-coorse.ads

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