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-2007, 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
50 function Equivalent_Elements
(Left
, Right
: Element_Type
) return Boolean;
52 type Set
is tagged private;
53 pragma Preelaborable_Initialization
(Set
);
55 type Cursor
is private;
56 pragma Preelaborable_Initialization
(Cursor
);
58 Empty_Set
: constant Set
;
60 No_Element
: constant Cursor
;
62 function "=" (Left
, Right
: Set
) return Boolean;
64 function Equivalent_Sets
(Left
, Right
: Set
) return Boolean;
66 function To_Set
(New_Item
: Element_Type
) return Set
;
68 function Length
(Container
: Set
) return Count_Type
;
70 function Is_Empty
(Container
: Set
) return Boolean;
72 procedure Clear
(Container
: in out Set
);
74 function Element
(Position
: Cursor
) return Element_Type
;
76 procedure Replace_Element
77 (Container
: in out Set
;
79 New_Item
: Element_Type
);
81 procedure Query_Element
83 Process
: not null access procedure (Element
: Element_Type
));
85 procedure Move
(Target
: in out Set
; Source
: in out Set
);
88 (Container
: in out Set
;
89 New_Item
: Element_Type
;
90 Position
: out Cursor
);
93 (Container
: in out Set
;
94 New_Item
: Element_Type
);
96 -- TODO: include Replace too???
99 -- (Container : in out Set;
100 -- New_Item : Element_Type);
103 (Container
: in out Set
;
104 Item
: Element_Type
);
107 (Container
: in out Set
;
108 Item
: Element_Type
);
111 (Container
: in out Set
;
112 Position
: in out Cursor
);
114 procedure Delete_First
(Container
: in out Set
);
116 procedure Delete_Last
(Container
: in out Set
);
118 procedure Union
(Target
: in out Set
; Source
: Set
);
120 function Union
(Left
, Right
: Set
) return Set
;
122 function "or" (Left
, Right
: Set
) return Set
renames Union
;
124 procedure Intersection
(Target
: in out Set
; Source
: Set
);
126 function Intersection
(Left
, Right
: Set
) return Set
;
128 function "and" (Left
, Right
: Set
) return Set
renames Intersection
;
130 procedure Difference
(Target
: in out Set
; Source
: Set
);
132 function Difference
(Left
, Right
: Set
) return Set
;
134 function "-" (Left
, Right
: Set
) return Set
renames Difference
;
136 procedure Symmetric_Difference
(Target
: in out Set
; Source
: Set
);
138 function Symmetric_Difference
(Left
, Right
: Set
) return Set
;
140 function "xor" (Left
, Right
: Set
) return Set
renames Symmetric_Difference
;
142 function Overlap
(Left
, Right
: Set
) return Boolean;
144 function Is_Subset
(Subset
: Set
; Of_Set
: Set
) return Boolean;
146 function First
(Container
: Set
) return Cursor
;
148 function First_Element
(Container
: Set
) return Element_Type
;
150 function Last
(Container
: Set
) return Cursor
;
152 function Last_Element
(Container
: Set
) return Element_Type
;
154 function Next
(Position
: Cursor
) return Cursor
;
156 procedure Next
(Position
: in out Cursor
);
158 function Previous
(Position
: Cursor
) return Cursor
;
160 procedure Previous
(Position
: in out Cursor
);
162 function Find
(Container
: Set
; Item
: Element_Type
) return Cursor
;
164 function Floor
(Container
: Set
; Item
: Element_Type
) return Cursor
;
166 function Ceiling
(Container
: Set
; Item
: Element_Type
) return Cursor
;
168 function Contains
(Container
: Set
; Item
: Element_Type
) return Boolean;
170 function Has_Element
(Position
: Cursor
) return Boolean;
172 function "<" (Left
, Right
: Cursor
) return Boolean;
174 function ">" (Left
, Right
: Cursor
) return Boolean;
176 function "<" (Left
: Cursor
; Right
: Element_Type
) return Boolean;
178 function ">" (Left
: Cursor
; Right
: Element_Type
) return Boolean;
180 function "<" (Left
: Element_Type
; Right
: Cursor
) return Boolean;
182 function ">" (Left
: Element_Type
; Right
: Cursor
) return Boolean;
186 Process
: not null access procedure (Position
: Cursor
));
188 procedure Reverse_Iterate
190 Process
: not null access procedure (Position
: Cursor
));
195 Process
: not null access procedure (Position
: Cursor
));
197 procedure Reverse_Iterate
200 Process
: not null access procedure (Position
: Cursor
));
203 type Key_Type
(<>) is private;
205 with function Key
(Element
: Element_Type
) return Key_Type
;
207 with function "<" (Left
, Right
: Key_Type
) return Boolean is <>;
209 package Generic_Keys
is
211 function Equivalent_Keys
(Left
, Right
: Key_Type
) return Boolean;
213 function Key
(Position
: Cursor
) return Key_Type
;
215 function Element
(Container
: Set
; Key
: Key_Type
) return Element_Type
;
217 procedure Exclude
(Container
: in out Set
; Key
: Key_Type
);
219 procedure Delete
(Container
: in out Set
; Key
: Key_Type
);
221 function Find
(Container
: Set
; Key
: Key_Type
) return Cursor
;
223 function Floor
(Container
: Set
; Key
: Key_Type
) return Cursor
;
225 function Ceiling
(Container
: Set
; Key
: Key_Type
) return Cursor
;
227 function Contains
(Container
: Set
; Key
: Key_Type
) return Boolean;
229 procedure Update_Element
230 (Container
: in out Set
;
232 Process
: not null access
233 procedure (Element
: in out Element_Type
));
238 Process
: not null access procedure (Position
: Cursor
));
240 procedure Reverse_Iterate
243 Process
: not null access procedure (Position
: Cursor
));
249 pragma Inline
(Next
);
250 pragma Inline
(Previous
);
253 type Node_Access
is access Node_Type
;
255 type Node_Type
is limited record
256 Parent
: Node_Access
;
259 Color
: Red_Black_Trees
.Color_Type
:= Red_Black_Trees
.Red
;
260 Element
: Element_Type
;
263 package Tree_Types
is new Red_Black_Trees
.Generic_Tree_Types
267 type Set
is new Ada
.Finalization
.Controlled
with record
268 Tree
: Tree_Types
.Tree_Type
;
271 procedure Adjust
(Container
: in out Set
);
273 procedure Finalize
(Container
: in out Set
) renames Clear
;
277 use Ada
.Finalization
;
280 type Set_Access
is access all Set
;
281 for Set_Access
'Storage_Size use 0;
283 type Cursor
is record
284 Container
: Set_Access
;
289 (Stream
: not null access Root_Stream_Type
'Class;
292 for Cursor
'Write use Write
;
295 (Stream
: not null access Root_Stream_Type
'Class;
298 for Cursor
'Read use Read
;
300 No_Element
: constant Cursor
:= Cursor
'(null, null);
303 (Stream : not null access Root_Stream_Type'Class;
306 for Set'Write use Write;
309 (Stream : not null access Root_Stream_Type'Class;
310 Container : out Set);
312 for Set'Read use Read;
314 Empty_Set : constant Set :=
315 (Controlled with Tree => (First => null,
322 end Ada.Containers.Ordered_Multisets;