1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
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 _ S E T S --
10 -- Copyright (C) 2004-2005 Free Software Foundation, Inc. --
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. --
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. --
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. --
34 -- This unit was originally developed by Matthew J Heaney. --
35 ------------------------------------------------------------------------------
37 with Ada.Containers.Red_Black_Trees;
38 with Ada.Finalization;
42 type Element_Type (<>) is private;
44 with function "<" (Left, Right : Element_Type) return Boolean is <>;
45 with function "=" (Left, Right : Element_Type) return Boolean is <>;
47 package Ada.Containers.Indefinite_Ordered_Sets is
48 pragma Preelaborate (Indefinite_Ordered_Sets);
50 type Set is tagged private;
52 type Cursor is private;
54 Empty_Set : constant Set;
56 No_Element : constant Cursor;
58 function "=" (Left, Right : Set) return Boolean;
60 function Equivalent_Sets (Left, Right : Set) return Boolean;
62 function Length (Container : Set) return Count_Type;
64 function Is_Empty (Container : Set) return Boolean;
66 procedure Clear (Container : in out Set);
68 function Element (Position : Cursor) return Element_Type;
70 procedure Query_Element
72 Process : not null access procedure (Element : Element_Type));
74 procedure Replace_Element
75 (Container : Set; -- TODO: need ruling from ARG
79 procedure Move (Target : in out Set; Source : in out Set);
82 (Container : in out Set;
83 New_Item : Element_Type;
84 Position : out Cursor;
85 Inserted : out Boolean);
88 (Container : in out Set;
89 New_Item : Element_Type);
92 (Container : in out Set;
93 New_Item : Element_Type);
96 (Container : in out Set;
97 New_Item : Element_Type);
100 (Container : in out Set;
101 Item : Element_Type);
104 (Container : in out Set;
105 Position : in out Cursor);
107 procedure Delete_First (Container : in out Set);
109 procedure Delete_Last (Container : in out Set);
112 (Container : in out Set;
113 Item : Element_Type);
115 procedure Union (Target : in out Set; Source : Set);
117 function Union (Left, Right : Set) return Set;
119 function "or" (Left, Right : Set) return Set renames Union;
121 procedure Intersection (Target : in out Set; Source : Set);
123 function Intersection (Left, Right : Set) return Set;
125 function "and" (Left, Right : Set) return Set renames Intersection;
127 procedure Difference (Target : in out Set;
130 function Difference (Left, Right : Set) return Set;
132 function "-" (Left, Right : Set) return Set renames Difference;
134 procedure Symmetric_Difference (Target : in out Set; Source : Set);
136 function Symmetric_Difference (Left, Right : Set) return Set;
138 function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
140 function Overlap (Left, Right : Set) return Boolean;
142 function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
144 function Contains (Container : Set; Item : Element_Type) return Boolean;
146 function Find (Container : Set; Item : Element_Type) return Cursor;
148 function Floor (Container : Set; Item : Element_Type) return Cursor;
150 function Ceiling (Container : Set; Item : Element_Type) return Cursor;
152 function First (Container : Set) return Cursor;
154 function First_Element (Container : Set) return Element_Type;
156 function Last (Container : Set) return Cursor;
158 function Last_Element (Container : Set) return Element_Type;
160 function Next (Position : Cursor) return Cursor;
162 procedure Next (Position : in out Cursor);
164 function Previous (Position : Cursor) return Cursor;
166 procedure Previous (Position : in out Cursor);
168 function Has_Element (Position : Cursor) return Boolean;
170 function "<" (Left, Right : Cursor) return Boolean;
172 function ">" (Left, Right : Cursor) return Boolean;
174 function "<" (Left : Cursor; Right : Element_Type) return Boolean;
176 function ">" (Left : Cursor; Right : Element_Type) return Boolean;
178 function "<" (Left : Element_Type; Right : Cursor) return Boolean;
180 function ">" (Left : Element_Type; Right : Cursor) return Boolean;
184 Process : not null access procedure (Position : Cursor));
186 procedure Reverse_Iterate
188 Process : not null access procedure (Position : Cursor));
191 type Key_Type (<>) is limited private;
193 with function Key (Element : Element_Type) return Key_Type;
195 with function "<" (Left : Key_Type; Right : Element_Type)
196 return Boolean is <>;
198 with function ">" (Left : Key_Type; Right : Element_Type)
199 return Boolean is <>;
201 package Generic_Keys is
205 Key : Key_Type) return Boolean;
209 Key : Key_Type) return Cursor;
213 Key : Key_Type) return Cursor;
217 Key : Key_Type) return Cursor;
219 function Key (Position : Cursor) return Key_Type;
223 Key : Key_Type) return Element_Type;
226 (Container : in out Set; -- TODO: need ruling from ARG
228 New_Item : Element_Type);
230 procedure Delete (Container : in out Set; Key : Key_Type);
232 procedure Exclude (Container : in out Set; Key : Key_Type);
234 function "<" (Left : Cursor; Right : Key_Type) return Boolean;
236 function ">" (Left : Cursor; Right : Key_Type) return Boolean;
238 function "<" (Left : Key_Type; Right : Cursor) return Boolean;
240 function ">" (Left : Key_Type; Right : Cursor) return Boolean;
242 procedure Update_Element_Preserving_Key
243 (Container : in out Set;
245 Process : not null access
246 procedure (Element : in out Element_Type));
253 type Node_Access is access Node_Type;
255 type Element_Access is access Element_Type;
257 type Node_Type is limited record
258 Parent : Node_Access;
261 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
262 Element : Element_Access;
265 package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
269 type Set is new Ada.Finalization.Controlled with record
270 Tree : Tree_Types.Tree_Type;
273 procedure Adjust (Container : in out Set);
275 procedure Finalize (Container : in out Set) renames Clear;
279 use Ada.Finalization;
281 type Set_Access is access all Set;
282 for Set_Access'Storage_Size use 0;
284 type Cursor is record
285 Container : Set_Access;
289 No_Element : constant Cursor := Cursor'(null, null);
294 (Stream : access Root_Stream_Type'Class;
297 for Set'Write use Write;
300 (Stream : access Root_Stream_Type'Class;
301 Container : out Set);
303 for Set'Read use Read;
305 Empty_Set : constant Set :=
306 (Controlled with Tree => (First => null,
313 end Ada.Containers.Indefinite_Ordered_Sets;