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 _ M U L T I 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_Multisets is
49 function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
51 type Set is tagged private;
53 type Cursor is private;
55 Empty_Set : constant Set;
57 No_Element : constant Cursor;
59 function "=" (Left, Right : Set) return Boolean;
61 function Equivalent_Sets (Left, Right : Set) return Boolean;
63 function To_Set (New_Item : Element_Type) return Set;
65 function Length (Container : Set) return Count_Type;
67 function Is_Empty (Container : Set) return Boolean;
69 procedure Clear (Container : in out Set);
71 function Element (Position : Cursor) return Element_Type;
73 procedure Replace_Element
74 (Container : in out Set;
76 New_Item : Element_Type);
78 procedure Query_Element
80 Process : not null access procedure (Element : Element_Type));
82 procedure Move (Target : in out Set; Source : in out Set);
85 (Container : in out Set;
86 New_Item : Element_Type;
87 Position : out Cursor);
90 (Container : in out Set;
91 New_Item : Element_Type);
93 -- TODO: include Replace too???
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 Item : Element_Type);
108 (Container : in out Set;
109 Position : in out Cursor);
111 procedure Delete_First (Container : in out Set);
113 procedure Delete_Last (Container : in out Set);
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; Source : Set);
129 function Difference (Left, Right : Set) return Set;
131 function "-" (Left, Right : Set) return Set renames Difference;
133 procedure Symmetric_Difference (Target : in out Set; Source : Set);
135 function Symmetric_Difference (Left, Right : Set) return Set;
137 function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
139 function Overlap (Left, Right : Set) return Boolean;
141 function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
143 function First (Container : Set) return Cursor;
145 function First_Element (Container : Set) return Element_Type;
147 function Last (Container : Set) return Cursor;
149 function Last_Element (Container : Set) return Element_Type;
151 function Next (Position : Cursor) return Cursor;
153 procedure Next (Position : in out Cursor);
155 function Previous (Position : Cursor) return Cursor;
157 procedure Previous (Position : in out Cursor);
159 function Find (Container : Set; Item : Element_Type) return Cursor;
161 function Floor (Container : Set; Item : Element_Type) return Cursor;
163 function Ceiling (Container : Set; Item : Element_Type) return Cursor;
165 function Contains (Container : Set; Item : Element_Type) return Boolean;
167 function Has_Element (Position : Cursor) return Boolean;
169 function "<" (Left, Right : Cursor) return Boolean;
171 function ">" (Left, Right : Cursor) return Boolean;
173 function "<" (Left : Cursor; Right : Element_Type) return Boolean;
175 function ">" (Left : Cursor; Right : Element_Type) return Boolean;
177 function "<" (Left : Element_Type; Right : Cursor) return Boolean;
179 function ">" (Left : Element_Type; Right : Cursor) return Boolean;
183 Process : not null access procedure (Position : Cursor));
185 procedure Reverse_Iterate
187 Process : not null access procedure (Position : Cursor));
192 Process : not null access procedure (Position : Cursor));
194 procedure Reverse_Iterate
197 Process : not null access procedure (Position : Cursor));
200 type Key_Type (<>) is private;
202 with function Key (Element : Element_Type) return Key_Type;
204 with function "<" (Left, Right : Key_Type) return Boolean is <>;
206 package Generic_Keys is
208 function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
210 function Key (Position : Cursor) return Key_Type;
212 function Element (Container : Set; Key : Key_Type) return 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
227 (Container : in out Set;
229 Process : not null access
230 procedure (Element : in out Element_Type));
235 Process : not null access procedure (Position : Cursor));
237 procedure Reverse_Iterate
240 Process : not null access procedure (Position : Cursor));
247 type Node_Access is access Node_Type;
249 type Node_Type is limited record
250 Parent : Node_Access;
253 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
254 Element : Element_Type;
257 package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
261 type Set is new Ada.Finalization.Controlled with record
262 Tree : Tree_Types.Tree_Type;
265 procedure Adjust (Container : in out Set);
267 procedure Finalize (Container : in out Set) renames Clear;
271 use Ada.Finalization;
274 type Set_Access is access all Set;
275 for Set_Access'Storage_Size use 0;
277 type Cursor is record
278 Container : Set_Access;
283 (Stream : access Root_Stream_Type'Class;
286 for Cursor'Write use Write;
289 (Stream : access Root_Stream_Type'Class;
292 for Cursor'Read use Read;
294 No_Element : constant Cursor := Cursor'(null, null);
297 (Stream : access Root_Stream_Type'Class;
300 for Set'Write use Write;
303 (Stream : access Root_Stream_Type'Class;
304 Container : out Set);
306 for Set'Read use Read;
308 Empty_Set : constant Set :=
309 (Controlled with Tree => (First => null,
316 end Ada.Containers.Ordered_Multisets;