1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
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 --
9 -- Copyright (C) 2004-2011, Free Software Foundation, Inc. --
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. --
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. --
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. --
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/>. --
31 -- This unit was originally developed by Matthew J Heaney. --
32 ------------------------------------------------------------------------------
34 private with Ada.Containers.Red_Black_Trees;
35 private with Ada.Finalization;
37 with Ada.Streams; use Ada.Streams;
38 with Ada.Iterator_Interfaces;
41 type Element_Type is private;
43 with function "<" (Left, Right : Element_Type) return Boolean is <>;
44 with function "=" (Left, Right : Element_Type) return Boolean is <>;
46 package Ada.Containers.Ordered_Sets is
50 function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
52 type Set is tagged private
53 with Constant_Indexing => Constant_Reference,
54 Default_Iterator => Iterate,
55 Iterator_Element => Element_Type;
57 pragma Preelaborable_Initialization (Set);
59 type Cursor is private;
60 pragma Preelaborable_Initialization (Cursor);
62 function Has_Element (Position : Cursor) return Boolean;
64 Empty_Set : constant Set;
66 No_Element : constant Cursor;
68 package Set_Iterator_Interfaces is new
69 Ada.Iterator_Interfaces (Cursor, Has_Element);
71 function "=" (Left, Right : Set) return Boolean;
73 function Equivalent_Sets (Left, Right : Set) return Boolean;
75 function To_Set (New_Item : Element_Type) return Set;
77 function Length (Container : Set) return Count_Type;
79 function Is_Empty (Container : Set) return Boolean;
81 procedure Clear (Container : in out Set);
83 function Element (Position : Cursor) return Element_Type;
85 procedure Replace_Element
86 (Container : in out Set;
88 New_Item : Element_Type);
90 procedure Query_Element
92 Process : not null access procedure (Element : Element_Type));
94 type Constant_Reference_Type
95 (Element : not null access constant Element_Type) is
98 Implicit_Dereference => Element;
101 (Stream : not null access Root_Stream_Type'Class;
102 Item : Constant_Reference_Type);
104 for Constant_Reference_Type'Write use Write;
106 function Constant_Reference
107 (Container : aliased Set;
108 Position : Cursor) return Constant_Reference_Type;
111 (Stream : not null access Root_Stream_Type'Class;
112 Item : out Constant_Reference_Type);
114 for Constant_Reference_Type'Read use Read;
116 procedure Assign (Target : in out Set; Source : Set);
118 function Copy (Source : Set) return Set;
120 procedure Move (Target : in out Set; Source : in out Set);
123 (Container : in out Set;
124 New_Item : Element_Type;
125 Position : out Cursor;
126 Inserted : out Boolean);
129 (Container : in out Set;
130 New_Item : Element_Type);
133 (Container : in out Set;
134 New_Item : Element_Type);
137 (Container : in out Set;
138 New_Item : Element_Type);
141 (Container : in out Set;
142 Item : Element_Type);
145 (Container : in out Set;
146 Item : Element_Type);
149 (Container : in out Set;
150 Position : in out Cursor);
152 procedure Delete_First (Container : in out Set);
154 procedure Delete_Last (Container : in out Set);
156 procedure Union (Target : in out Set; Source : Set);
158 function Union (Left, Right : Set) return Set;
160 function "or" (Left, Right : Set) return Set renames Union;
162 procedure Intersection (Target : in out Set; Source : Set);
164 function Intersection (Left, Right : Set) return Set;
166 function "and" (Left, Right : Set) return Set renames Intersection;
168 procedure Difference (Target : in out Set; Source : Set);
170 function Difference (Left, Right : Set) return Set;
172 function "-" (Left, Right : Set) return Set renames Difference;
174 procedure Symmetric_Difference (Target : in out Set; Source : Set);
176 function Symmetric_Difference (Left, Right : Set) return Set;
178 function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
180 function Overlap (Left, Right : Set) return Boolean;
182 function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
184 function First (Container : Set) return Cursor;
186 function First_Element (Container : Set) return Element_Type;
188 function Last (Container : Set) return Cursor;
190 function Last_Element (Container : Set) return Element_Type;
192 function Next (Position : Cursor) return Cursor;
194 procedure Next (Position : in out Cursor);
196 function Previous (Position : Cursor) return Cursor;
198 procedure Previous (Position : in out Cursor);
200 function Find (Container : Set; Item : Element_Type) return Cursor;
202 function Floor (Container : Set; Item : Element_Type) return Cursor;
204 function Ceiling (Container : Set; Item : Element_Type) return Cursor;
206 function Contains (Container : Set; Item : Element_Type) return Boolean;
208 function "<" (Left, Right : Cursor) return Boolean;
210 function ">" (Left, Right : Cursor) return Boolean;
212 function "<" (Left : Cursor; Right : Element_Type) return Boolean;
214 function ">" (Left : Cursor; Right : Element_Type) return Boolean;
216 function "<" (Left : Element_Type; Right : Cursor) return Boolean;
218 function ">" (Left : Element_Type; Right : Cursor) return Boolean;
222 Process : not null access procedure (Position : Cursor));
224 procedure Reverse_Iterate
226 Process : not null access procedure (Position : Cursor));
230 return Set_Iterator_Interfaces.Reversible_Iterator'class;
235 return Set_Iterator_Interfaces.Reversible_Iterator'class;
238 type Key_Type (<>) is private;
240 with function Key (Element : Element_Type) return Key_Type;
242 with function "<" (Left, Right : Key_Type) return Boolean is <>;
244 package Generic_Keys is
246 function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
248 function Key (Position : Cursor) return Key_Type;
250 function Element (Container : Set; Key : Key_Type) return Element_Type;
253 (Container : in out Set;
255 New_Item : Element_Type);
257 procedure Exclude (Container : in out Set; Key : Key_Type);
259 procedure Delete (Container : in out Set; Key : Key_Type);
261 function Find (Container : Set; Key : Key_Type) return Cursor;
263 function Floor (Container : Set; Key : Key_Type) return Cursor;
265 function Ceiling (Container : Set; Key : Key_Type) return Cursor;
267 function Contains (Container : Set; Key : Key_Type) return Boolean;
269 procedure Update_Element_Preserving_Key
270 (Container : in out Set;
272 Process : not null access
273 procedure (Element : in out Element_Type));
275 type Reference_Type (Element : not null access Element_Type) is private
277 Implicit_Dereference => Element;
279 function Reference_Preserving_Key
280 (Container : aliased in out Set;
281 Position : Cursor) return Reference_Type;
283 function Constant_Reference
284 (Container : aliased Set;
285 Key : Key_Type) return Constant_Reference_Type;
287 function Reference_Preserving_Key
288 (Container : aliased in out Set;
289 Key : Key_Type) return Reference_Type;
293 (Element : not null access Element_Type) is null record;
296 (Stream : not null access Root_Stream_Type'Class;
297 Item : Reference_Type);
299 for Reference_Type'Write use Write;
302 (Stream : not null access Root_Stream_Type'Class;
303 Item : out Reference_Type);
305 for Reference_Type'Read use Read;
310 pragma Inline (Next);
311 pragma Inline (Previous);
314 type Node_Access is access Node_Type;
316 type Node_Type is limited record
317 Parent : Node_Access;
320 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
321 Element : aliased Element_Type;
324 package Tree_Types is
325 new Red_Black_Trees.Generic_Tree_Types (Node_Type, Node_Access);
327 type Set is new Ada.Finalization.Controlled with record
328 Tree : Tree_Types.Tree_Type;
331 overriding procedure Adjust (Container : in out Set);
333 overriding procedure Finalize (Container : in out Set) renames Clear;
337 use Ada.Finalization;
339 type Set_Access is access all Set;
340 for Set_Access'Storage_Size use 0;
342 type Cursor is record
343 Container : Set_Access;
348 (Stream : not null access Root_Stream_Type'Class;
351 for Cursor'Write use Write;
354 (Stream : not null access Root_Stream_Type'Class;
357 for Cursor'Read use Read;
359 No_Element : constant Cursor := Cursor'(null, null);
362 (Stream : not null access Root_Stream_Type'Class;
365 for Set'Write use Write;
368 (Stream : not null access Root_Stream_Type'Class;
369 Container : out Set);
371 for Set'Read use Read;
373 type Constant_Reference_Type
374 (Element : not null access constant Element_Type) is null record;
376 Empty_Set : constant Set :=
377 (Controlled with Tree => (First => null,
384 end Ada.Containers.Ordered_Sets;