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 _ M U L T I S E T S --
10 -- Copyright (C) 2004-2007, 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_Multisets is
51 function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
53 type Set is tagged private;
54 pragma Preelaborable_Initialization (Set);
56 type Cursor is private;
57 pragma Preelaborable_Initialization (Cursor);
59 Empty_Set : constant Set;
61 No_Element : constant Cursor;
63 function "=" (Left, Right : Set) return Boolean;
65 function Equivalent_Sets (Left, Right : Set) return Boolean;
67 function To_Set (New_Item : Element_Type) return Set;
69 function Length (Container : Set) return Count_Type;
71 function Is_Empty (Container : Set) return Boolean;
73 procedure Clear (Container : in out Set);
75 function Element (Position : Cursor) return Element_Type;
77 procedure Replace_Element
78 (Container : in out Set;
80 New_Item : Element_Type);
82 procedure Query_Element
84 Process : not null access procedure (Element : Element_Type));
86 procedure Move (Target : in out Set; Source : in out Set);
89 (Container : in out Set;
90 New_Item : Element_Type;
91 Position : out Cursor);
93 procedure Insert (Container : in out Set; New_Item : Element_Type);
95 -- TODO: include Replace too???
98 -- (Container : in out Set;
99 -- New_Item : Element_Type);
101 procedure Exclude (Container : in out Set; Item : Element_Type);
103 procedure Delete (Container : in out Set; Item : Element_Type);
105 procedure Delete (Container : in out Set; Position : in out Cursor);
107 procedure Delete_First (Container : in out Set);
109 procedure Delete_Last (Container : in out Set);
111 procedure Union (Target : in out Set; Source : Set);
113 function Union (Left, Right : Set) return Set;
115 function "or" (Left, Right : Set) return Set renames Union;
117 procedure Intersection (Target : in out Set; Source : Set);
119 function Intersection (Left, Right : Set) return Set;
121 function "and" (Left, Right : Set) return Set renames Intersection;
123 procedure Difference (Target : in out Set; Source : Set);
125 function Difference (Left, Right : Set) return Set;
127 function "-" (Left, Right : Set) return Set renames Difference;
129 procedure Symmetric_Difference (Target : in out Set; Source : Set);
131 function Symmetric_Difference (Left, Right : Set) return Set;
133 function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
135 function Overlap (Left, Right : Set) return Boolean;
137 function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
139 function First (Container : Set) return Cursor;
141 function First_Element (Container : Set) return Element_Type;
143 function Last (Container : Set) return Cursor;
145 function Last_Element (Container : Set) return Element_Type;
147 function Next (Position : Cursor) return Cursor;
149 procedure Next (Position : in out Cursor);
151 function Previous (Position : Cursor) return Cursor;
153 procedure Previous (Position : in out Cursor);
155 function Find (Container : Set; Item : Element_Type) return Cursor;
157 function Floor (Container : Set; Item : Element_Type) return Cursor;
159 function Ceiling (Container : Set; Item : Element_Type) return Cursor;
161 function Contains (Container : Set; Item : Element_Type) return Boolean;
163 function Has_Element (Position : Cursor) return Boolean;
165 function "<" (Left, Right : Cursor) return Boolean;
167 function ">" (Left, Right : Cursor) return Boolean;
169 function "<" (Left : Cursor; Right : Element_Type) return Boolean;
171 function ">" (Left : Cursor; Right : Element_Type) return Boolean;
173 function "<" (Left : Element_Type; Right : Cursor) return Boolean;
175 function ">" (Left : Element_Type; Right : Cursor) return Boolean;
179 Process : not null access procedure (Position : Cursor));
181 procedure Reverse_Iterate
183 Process : not null access procedure (Position : Cursor));
188 Process : not null access procedure (Position : Cursor));
190 procedure Reverse_Iterate
193 Process : not null access procedure (Position : Cursor));
196 type Key_Type (<>) is private;
198 with function Key (Element : Element_Type) return Key_Type;
200 with function "<" (Left, Right : Key_Type) return Boolean is <>;
202 package Generic_Keys is
204 function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
206 function Key (Position : Cursor) return Key_Type;
208 function Element (Container : Set; Key : Key_Type) return Element_Type;
210 procedure Exclude (Container : in out Set; Key : Key_Type);
212 procedure Delete (Container : in out Set; Key : Key_Type);
214 function Find (Container : Set; Key : Key_Type) return Cursor;
216 function Floor (Container : Set; Key : Key_Type) return Cursor;
218 function Ceiling (Container : Set; Key : Key_Type) return Cursor;
220 function Contains (Container : Set; Key : Key_Type) return Boolean;
222 procedure Update_Element
223 (Container : in out Set;
225 Process : not null access
226 procedure (Element : in out Element_Type));
231 Process : not null access procedure (Position : Cursor));
233 procedure Reverse_Iterate
236 Process : not null access procedure (Position : Cursor));
242 pragma Inline (Next);
243 pragma Inline (Previous);
246 type Node_Access is access Node_Type;
248 type Element_Access is access Element_Type;
250 type Node_Type is limited record
251 Parent : Node_Access;
254 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
255 Element : Element_Access;
258 package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
262 type Set is new Ada.Finalization.Controlled with record
263 Tree : Tree_Types.Tree_Type;
266 procedure Adjust (Container : in out Set);
268 procedure Finalize (Container : in out Set) renames Clear;
272 use Ada.Finalization;
275 type Set_Access is access all Set;
276 for Set_Access'Storage_Size use 0;
278 type Cursor is record
279 Container : Set_Access;
284 (Stream : not null access Root_Stream_Type'Class;
287 for Cursor'Write use Write;
290 (Stream : not null access Root_Stream_Type'Class;
293 for Cursor'Read use Read;
295 No_Element : constant Cursor := Cursor'(null, null);
298 (Stream : not null access Root_Stream_Type'Class;
301 for Set'Write use Write;
304 (Stream : not null access Root_Stream_Type'Class;
305 Container : out Set);
307 for Set'Read use Read;
309 Empty_Set : constant Set :=
310 (Controlled with Tree => (First => null,
317 end Ada.Containers.Indefinite_Ordered_Multisets;