1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.INDEFINITE_ORDERED_MULTISETS --
9 -- Copyright (C) 2004-2008, 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 -- Documentation of this unit is needed ???
38 private with Ada.Containers.Red_Black_Trees;
39 private with Ada.Finalization;
40 private with Ada.Streams;
43 type Element_Type (<>) is private;
45 with function "<" (Left, Right : Element_Type) return Boolean is <>;
46 with function "=" (Left, Right : Element_Type) return Boolean is <>;
48 package Ada.Containers.Indefinite_Ordered_Multisets is
52 function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
54 type Set is tagged private;
55 pragma Preelaborable_Initialization (Set);
57 type Cursor is private;
58 pragma Preelaborable_Initialization (Cursor);
60 Empty_Set : constant Set;
62 No_Element : constant Cursor;
64 function "=" (Left, Right : Set) return Boolean;
66 function Equivalent_Sets (Left, Right : Set) return Boolean;
68 function To_Set (New_Item : Element_Type) return Set;
70 function Length (Container : Set) return Count_Type;
72 function Is_Empty (Container : Set) return Boolean;
74 procedure Clear (Container : in out Set);
76 function Element (Position : Cursor) return Element_Type;
78 procedure Replace_Element
79 (Container : in out Set;
81 New_Item : Element_Type);
83 procedure Query_Element
85 Process : not null access procedure (Element : Element_Type));
87 procedure Move (Target : in out Set; Source : in out Set);
90 (Container : in out Set;
91 New_Item : Element_Type;
92 Position : out Cursor);
94 procedure Insert (Container : in out Set; New_Item : Element_Type);
96 -- TODO: include Replace too???
99 -- (Container : in out Set;
100 -- New_Item : Element_Type);
102 procedure Exclude (Container : in out Set; Item : Element_Type);
104 procedure Delete (Container : in out Set; Item : Element_Type);
106 procedure Delete (Container : in out Set; Position : in out Cursor);
108 procedure Delete_First (Container : in out Set);
110 procedure Delete_Last (Container : in out Set);
112 procedure Union (Target : in out Set; Source : Set);
114 function Union (Left, Right : Set) return Set;
116 function "or" (Left, Right : Set) return Set renames Union;
118 procedure Intersection (Target : in out Set; Source : Set);
120 function Intersection (Left, Right : Set) return Set;
122 function "and" (Left, Right : Set) return Set renames Intersection;
124 procedure Difference (Target : in out Set; Source : Set);
126 function Difference (Left, Right : Set) return Set;
128 function "-" (Left, Right : Set) return Set renames Difference;
130 procedure Symmetric_Difference (Target : in out Set; Source : Set);
132 function Symmetric_Difference (Left, Right : Set) return Set;
134 function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
136 function Overlap (Left, Right : Set) return Boolean;
138 function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
140 function First (Container : Set) return Cursor;
142 function First_Element (Container : Set) return Element_Type;
144 function Last (Container : Set) return Cursor;
146 function Last_Element (Container : Set) return Element_Type;
148 function Next (Position : Cursor) return Cursor;
150 procedure Next (Position : in out Cursor);
152 function Previous (Position : Cursor) return Cursor;
154 procedure Previous (Position : in out Cursor);
156 function Find (Container : Set; Item : Element_Type) return Cursor;
158 function Floor (Container : Set; Item : Element_Type) return Cursor;
160 function Ceiling (Container : Set; Item : Element_Type) return Cursor;
162 function Contains (Container : Set; Item : Element_Type) return Boolean;
164 function Has_Element (Position : Cursor) return Boolean;
166 function "<" (Left, Right : Cursor) return Boolean;
168 function ">" (Left, Right : Cursor) return Boolean;
170 function "<" (Left : Cursor; Right : Element_Type) return Boolean;
172 function ">" (Left : Cursor; Right : Element_Type) return Boolean;
174 function "<" (Left : Element_Type; Right : Cursor) return Boolean;
176 function ">" (Left : Element_Type; Right : Cursor) return Boolean;
180 Process : not null access procedure (Position : Cursor));
182 procedure Reverse_Iterate
184 Process : not null access procedure (Position : Cursor));
189 Process : not null access procedure (Position : Cursor));
191 procedure Reverse_Iterate
194 Process : not null access procedure (Position : Cursor));
197 type Key_Type (<>) is private;
199 with function Key (Element : Element_Type) return Key_Type;
201 with function "<" (Left, Right : Key_Type) return Boolean is <>;
203 package Generic_Keys is
205 function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
207 function Key (Position : Cursor) return Key_Type;
209 function Element (Container : Set; Key : Key_Type) return Element_Type;
211 procedure Exclude (Container : in out Set; Key : Key_Type);
213 procedure Delete (Container : in out Set; Key : Key_Type);
215 function Find (Container : Set; Key : Key_Type) return Cursor;
217 function Floor (Container : Set; Key : Key_Type) return Cursor;
219 function Ceiling (Container : Set; Key : Key_Type) return Cursor;
221 function Contains (Container : Set; Key : Key_Type) return Boolean;
223 procedure Update_Element
224 (Container : in out Set;
226 Process : not null access
227 procedure (Element : in out Element_Type));
232 Process : not null access procedure (Position : Cursor));
234 procedure Reverse_Iterate
237 Process : not null access procedure (Position : Cursor));
243 pragma Inline (Next);
244 pragma Inline (Previous);
247 type Node_Access is access Node_Type;
249 type Element_Access is access Element_Type;
251 type Node_Type is limited record
252 Parent : Node_Access;
255 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
256 Element : Element_Access;
259 package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
263 type Set is new Ada.Finalization.Controlled with record
264 Tree : Tree_Types.Tree_Type;
268 procedure Adjust (Container : in out Set);
271 procedure Finalize (Container : in out Set) renames Clear;
275 use Ada.Finalization;
278 type Set_Access is access all Set;
279 for Set_Access'Storage_Size use 0;
281 type Cursor is record
282 Container : Set_Access;
287 (Stream : not null access Root_Stream_Type'Class;
290 for Cursor'Write use Write;
293 (Stream : not null access Root_Stream_Type'Class;
296 for Cursor'Read use Read;
298 No_Element : constant Cursor := Cursor'(null, null);
301 (Stream : not null access Root_Stream_Type'Class;
304 for Set'Write use Write;
307 (Stream : not null access Root_Stream_Type'Class;
308 Container : out Set);
310 for Set'Read use Read;
312 Empty_Set : constant Set :=
313 (Controlled with Tree => (First => null,
320 end Ada.Containers.Indefinite_Ordered_Multisets;