1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.INDEFINITE_ORDERED_MAPS --
9 -- Copyright (C) 2004-2012, 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 3, 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. --
22 -- As a special exception under Section 7 of GPL version 3, you are granted --
23 -- additional permissions described in the GCC Runtime Library Exception, --
24 -- version 3.1, as published by the Free Software Foundation. --
26 -- You should have received a copy of the GNU General Public License and --
27 -- a copy of the GCC Runtime Library Exception along with this program; --
28 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
29 -- <http://www.gnu.org/licenses/>. --
31 -- This unit was originally developed by Matthew J Heaney. --
32 ------------------------------------------------------------------------------
34 with Ada.Iterator_Interfaces;
36 private with Ada.Containers.Red_Black_Trees;
37 private with Ada.Finalization;
38 private with Ada.Streams;
41 type Key_Type (<>) is private;
42 type Element_Type (<>) is private;
44 with function "<" (Left, Right : Key_Type) return Boolean is <>;
45 with function "=" (Left, Right : Element_Type) return Boolean is <>;
47 package Ada.Containers.Indefinite_Ordered_Maps is
51 function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
53 type Map is tagged private
54 with Constant_Indexing => Constant_Reference,
55 Variable_Indexing => Reference,
56 Default_Iterator => Iterate,
57 Iterator_Element => Element_Type;
59 pragma Preelaborable_Initialization (Map);
61 type Cursor is private;
62 pragma Preelaborable_Initialization (Cursor);
64 Empty_Map : constant Map;
66 No_Element : constant Cursor;
67 function Has_Element (Position : Cursor) return Boolean;
69 package Map_Iterator_Interfaces is new
70 Ada.Iterator_Interfaces (Cursor, Has_Element);
72 function "=" (Left, Right : Map) return Boolean;
74 function Length (Container : Map) return Count_Type;
76 function Is_Empty (Container : Map) return Boolean;
78 procedure Clear (Container : in out Map);
80 function Key (Position : Cursor) return Key_Type;
82 function Element (Position : Cursor) return Element_Type;
84 procedure Replace_Element
85 (Container : in out Map;
87 New_Item : Element_Type);
89 procedure Query_Element
91 Process : not null access procedure (Key : Key_Type;
92 Element : Element_Type));
94 procedure Update_Element
95 (Container : in out Map;
97 Process : not null access procedure (Key : Key_Type;
98 Element : in out Element_Type));
100 type Constant_Reference_Type
101 (Element : not null access constant Element_Type) is private
103 Implicit_Dereference => Element;
105 type Reference_Type (Element : not null access Element_Type) is private
107 Implicit_Dereference => Element;
109 function Constant_Reference
110 (Container : aliased Map;
111 Position : Cursor) return Constant_Reference_Type;
114 (Container : aliased in out Map;
115 Position : Cursor) return Reference_Type;
117 function Constant_Reference
118 (Container : aliased Map;
119 Key : Key_Type) return Constant_Reference_Type;
122 (Container : aliased in out Map;
123 Key : Key_Type) return Reference_Type;
125 procedure Assign (Target : in out Map; Source : Map);
127 function Copy (Source : Map) return Map;
129 procedure Move (Target : in out Map; Source : in out Map);
132 (Container : in out Map;
134 New_Item : Element_Type;
135 Position : out Cursor;
136 Inserted : out Boolean);
139 (Container : in out Map;
141 New_Item : Element_Type);
144 (Container : in out Map;
146 New_Item : Element_Type);
149 (Container : in out Map;
151 New_Item : Element_Type);
153 procedure Exclude (Container : in out Map; Key : Key_Type);
155 procedure Delete (Container : in out Map; Key : Key_Type);
157 procedure Delete (Container : in out Map; Position : in out Cursor);
159 procedure Delete_First (Container : in out Map);
161 procedure Delete_Last (Container : in out Map);
163 function First (Container : Map) return Cursor;
165 function First_Element (Container : Map) return Element_Type;
167 function First_Key (Container : Map) return Key_Type;
169 function Last (Container : Map) return Cursor;
171 function Last_Element (Container : Map) return Element_Type;
173 function Last_Key (Container : Map) return Key_Type;
175 function Next (Position : Cursor) return Cursor;
177 procedure Next (Position : in out Cursor);
179 function Previous (Position : Cursor) return Cursor;
181 procedure Previous (Position : in out Cursor);
183 function Find (Container : Map; Key : Key_Type) return Cursor;
185 function Element (Container : Map; Key : Key_Type) return Element_Type;
187 function Floor (Container : Map; Key : Key_Type) return Cursor;
189 function Ceiling (Container : Map; Key : Key_Type) return Cursor;
191 function Contains (Container : Map; Key : Key_Type) return Boolean;
193 function "<" (Left, Right : Cursor) return Boolean;
195 function ">" (Left, Right : Cursor) return Boolean;
197 function "<" (Left : Cursor; Right : Key_Type) return Boolean;
199 function ">" (Left : Cursor; Right : Key_Type) return Boolean;
201 function "<" (Left : Key_Type; Right : Cursor) return Boolean;
203 function ">" (Left : Key_Type; Right : Cursor) return Boolean;
207 Process : not null access procedure (Position : Cursor));
209 procedure Reverse_Iterate
211 Process : not null access procedure (Position : Cursor));
213 -- The map container supports iteration in both the forward and reverse
214 -- directions, hence these constructor functions return an object that
215 -- supports the Reversible_Iterator interface.
219 return Map_Iterator_Interfaces.Reversible_Iterator'Class;
224 return Map_Iterator_Interfaces.Reversible_Iterator'Class;
228 pragma Inline (Next);
229 pragma Inline (Previous);
232 type Node_Access is access Node_Type;
234 type Key_Access is access Key_Type;
235 type Element_Access is access Element_Type;
237 type Node_Type is limited record
238 Parent : Node_Access;
241 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
243 Element : Element_Access;
246 package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
250 type Map is new Ada.Finalization.Controlled with record
251 Tree : Tree_Types.Tree_Type;
254 overriding procedure Adjust (Container : in out Map);
256 overriding procedure Finalize (Container : in out Map) renames Clear;
260 use Ada.Finalization;
264 (Stream : not null access Root_Stream_Type'Class;
267 for Map'Write use Write;
270 (Stream : not null access Root_Stream_Type'Class;
271 Container : out Map);
273 for Map'Read use Read;
275 type Map_Access is access all Map;
276 for Map_Access'Storage_Size use 0;
278 type Cursor is record
279 Container : Map_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 type Constant_Reference_Type
296 (Element : not null access constant Element_Type) is null record;
299 (Stream : not null access Root_Stream_Type'Class;
300 Item : out Constant_Reference_Type);
302 for Constant_Reference_Type'Read use Read;
305 (Stream : not null access Root_Stream_Type'Class;
306 Item : Constant_Reference_Type);
308 for Constant_Reference_Type'Write use Write;
311 (Element : not null access Element_Type) is null record;
314 (Stream : not null access Root_Stream_Type'Class;
315 Item : out Reference_Type);
317 for Reference_Type'Read use Read;
320 (Stream : not null access Root_Stream_Type'Class;
321 Item : Reference_Type);
323 for Reference_Type'Write use Write;
325 Empty_Map : constant Map :=
326 (Controlled with Tree => (First => null,
333 No_Element : constant Cursor := Cursor'(null, null);
335 end Ada.Containers.Indefinite_Ordered_Maps;