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-2006, 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 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. --
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. --
33 -- This unit was originally developed by Matthew J Heaney. --
34 ------------------------------------------------------------------------------
36 with Ada.Containers.Red_Black_Trees;
37 with Ada.Finalization;
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
49 function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
51 type Set is tagged private;
52 pragma Preelaborable_Initialization (Set);
54 type Cursor is private;
55 pragma Preelaborable_Initialization (Cursor);
57 Empty_Set : constant Set;
59 No_Element : constant Cursor;
61 function "=" (Left, Right : Set) return Boolean;
63 function Equivalent_Sets (Left, Right : Set) return Boolean;
65 function To_Set (New_Item : Element_Type) return Set;
67 function Length (Container : Set) return Count_Type;
69 function Is_Empty (Container : Set) return Boolean;
71 procedure Clear (Container : in out Set);
73 function Element (Position : Cursor) return Element_Type;
75 procedure Replace_Element
76 (Container : in out Set;
78 New_Item : Element_Type);
80 procedure Query_Element
82 Process : not null access procedure (Element : Element_Type));
84 procedure Move (Target : in out Set; Source : in out Set);
87 (Container : in out Set;
88 New_Item : Element_Type;
89 Position : out Cursor;
90 Inserted : out Boolean);
93 (Container : in out Set;
94 New_Item : Element_Type);
97 (Container : in out Set;
98 New_Item : Element_Type);
101 (Container : in out Set;
102 New_Item : Element_Type);
105 (Container : in out Set;
106 Item : Element_Type);
109 (Container : in out Set;
110 Item : Element_Type);
113 (Container : in out Set;
114 Position : in out Cursor);
116 procedure Delete_First (Container : in out Set);
118 procedure Delete_Last (Container : in out Set);
120 procedure Union (Target : in out Set; Source : Set);
122 function Union (Left, Right : Set) return Set;
124 function "or" (Left, Right : Set) return Set renames Union;
126 procedure Intersection (Target : in out Set; Source : Set);
128 function Intersection (Left, Right : Set) return Set;
130 function "and" (Left, Right : Set) return Set renames Intersection;
132 procedure Difference (Target : in out Set; Source : Set);
134 function Difference (Left, Right : Set) return Set;
136 function "-" (Left, Right : Set) return Set renames Difference;
138 procedure Symmetric_Difference (Target : in out Set; Source : Set);
140 function Symmetric_Difference (Left, Right : Set) return Set;
142 function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
144 function Overlap (Left, Right : Set) return Boolean;
146 function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
148 function First (Container : Set) return Cursor;
150 function First_Element (Container : Set) return Element_Type;
152 function Last (Container : Set) return Cursor;
154 function Last_Element (Container : Set) return Element_Type;
156 function Next (Position : Cursor) return Cursor;
158 procedure Next (Position : in out Cursor);
160 function Previous (Position : Cursor) return Cursor;
162 procedure Previous (Position : in out Cursor);
164 function Find (Container : Set; Item : Element_Type) return Cursor;
166 function Floor (Container : Set; Item : Element_Type) return Cursor;
168 function Ceiling (Container : Set; Item : Element_Type) return Cursor;
170 function Contains (Container : Set; Item : Element_Type) return Boolean;
172 function Has_Element (Position : Cursor) return Boolean;
174 function "<" (Left, Right : Cursor) return Boolean;
176 function ">" (Left, Right : Cursor) return Boolean;
178 function "<" (Left : Cursor; Right : Element_Type) return Boolean;
180 function ">" (Left : Cursor; Right : Element_Type) return Boolean;
182 function "<" (Left : Element_Type; Right : Cursor) return Boolean;
184 function ">" (Left : Element_Type; Right : Cursor) return Boolean;
188 Process : not null access procedure (Position : Cursor));
190 procedure Reverse_Iterate
192 Process : not null access procedure (Position : Cursor));
195 type Key_Type (<>) is private;
197 with function Key (Element : Element_Type) return Key_Type;
199 with function "<" (Left, Right : Key_Type) return Boolean is <>;
201 package Generic_Keys is
203 function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
205 function Key (Position : Cursor) return Key_Type;
207 function Element (Container : Set; Key : Key_Type) return Element_Type;
210 (Container : in out Set;
212 New_Item : Element_Type);
214 procedure Exclude (Container : in out Set; Key : Key_Type);
216 procedure Delete (Container : in out Set; Key : Key_Type);
218 function Find (Container : Set; Key : Key_Type) return Cursor;
220 function Floor (Container : Set; Key : Key_Type) return Cursor;
222 function Ceiling (Container : Set; Key : Key_Type) return Cursor;
224 function Contains (Container : Set; Key : Key_Type) return Boolean;
226 procedure Update_Element_Preserving_Key
227 (Container : in out Set;
229 Process : not null access
230 procedure (Element : in out Element_Type));
237 type Node_Access is access Node_Type;
239 type Node_Type is limited record
240 Parent : Node_Access;
243 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
244 Element : Element_Type;
247 package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
251 type Set is new Ada.Finalization.Controlled with record
252 Tree : Tree_Types.Tree_Type;
255 procedure Adjust (Container : in out Set);
257 procedure Finalize (Container : in out Set) renames Clear;
261 use Ada.Finalization;
264 type Set_Access is access all Set;
265 for Set_Access'Storage_Size use 0;
267 type Cursor is record
268 Container : Set_Access;
273 (Stream : not null access Root_Stream_Type'Class;
276 for Cursor'Write use Write;
279 (Stream : not null access Root_Stream_Type'Class;
282 for Cursor'Read use Read;
284 No_Element : constant Cursor := Cursor'(null, null);
287 (Stream : not null access Root_Stream_Type'Class;
290 for Set'Write use Write;
293 (Stream : not null access Root_Stream_Type'Class;
294 Container : out Set);
296 for Set'Read use Read;
298 Empty_Set : constant Set :=
299 (Controlled with Tree => (First => null,
306 end Ada.Containers.Ordered_Sets;