1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.INDEFINITE_HASHED_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.Hash_Tables;
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 Hash (Key : Key_Type) return Hash_Type;
45 with function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
46 with function "=" (Left, Right : Element_Type) return Boolean is <>;
48 package Ada.Containers.Indefinite_Hashed_Maps is
52 type Map is tagged private with
53 Constant_Indexing => Constant_Reference,
54 Variable_Indexing => Reference,
55 Default_Iterator => Iterate,
56 Iterator_Element => Element_Type;
58 pragma Preelaborable_Initialization (Map);
60 type Cursor is private;
61 pragma Preelaborable_Initialization (Cursor);
63 Empty_Map : constant Map;
64 -- Map objects declared without an initialization expression are
65 -- initialized to the value Empty_Map.
67 No_Element : constant Cursor;
68 -- Cursor objects declared without an initialization expression are
69 -- initialized to the value No_Element.
71 function Has_Element (Position : Cursor) return Boolean;
72 -- Equivalent to Position /= No_Element
74 package Map_Iterator_Interfaces is new
75 Ada.Iterator_Interfaces (Cursor, Has_Element);
77 overriding function "=" (Left, Right : Map) return Boolean;
78 -- For each key/element pair in Left, equality attempts to find the key in
79 -- Right; if a search fails the equality returns False. The search works by
80 -- calling Hash to find the bucket in the Right map that corresponds to the
81 -- Left key. If bucket is non-empty, then equality calls Equivalent_Keys
82 -- to compare the key (in Left) to the key of each node in the bucket (in
83 -- Right); if the keys are equivalent, then the equality test for this
84 -- key/element pair (in Left) completes by calling the element equality
85 -- operator to compare the element (in Left) to the element of the node
86 -- (in Right) whose key matched.
88 function Capacity (Container : Map) return Count_Type;
89 -- Returns the current capacity of the map. Capacity is the maximum length
90 -- before which rehashing in guaranteed not to occur.
92 procedure Reserve_Capacity (Container : in out Map; Capacity : Count_Type);
93 -- Adjusts the current capacity, by allocating a new buckets array. If the
94 -- requested capacity is less than the current capacity, then the capacity
95 -- is contracted (to a value not less than the current length). If the
96 -- requested capacity is greater than the current capacity, then the
97 -- capacity is expanded (to a value not less than what is requested). In
98 -- either case, the nodes are rehashed from the old buckets array onto the
99 -- new buckets array (Hash is called once for each existing key in order to
100 -- compute the new index), and then the old buckets array is deallocated.
102 function Length (Container : Map) return Count_Type;
103 -- Returns the number of items in the map
105 function Is_Empty (Container : Map) return Boolean;
106 -- Equivalent to Length (Container) = 0
108 procedure Clear (Container : in out Map);
109 -- Removes all of the items from the map
111 function Key (Position : Cursor) return Key_Type;
112 -- Returns the key of the node designated by the cursor
114 function Element (Position : Cursor) return Element_Type;
115 -- Returns the element of the node designated by the cursor
117 procedure Replace_Element
118 (Container : in out Map;
120 New_Item : Element_Type);
121 -- Assigns the value New_Item to the element designated by the cursor
123 procedure Query_Element
125 Process : not null access procedure (Key : Key_Type;
126 Element : Element_Type));
127 -- Calls Process with the key and element (both having only a constant
128 -- view) of the node designed by the cursor.
130 procedure Update_Element
131 (Container : in out Map;
133 Process : not null access procedure (Key : Key_Type;
134 Element : in out Element_Type));
135 -- Calls Process with the key (with only a constant view) and element (with
136 -- a variable view) of the node designed by the cursor.
138 type Constant_Reference_Type
139 (Element : not null access constant Element_Type) is private
141 Implicit_Dereference => Element;
143 type Reference_Type (Element : not null access Element_Type) is private
145 Implicit_Dereference => Element;
147 function Constant_Reference
148 (Container : aliased Map;
149 Position : Cursor) return Constant_Reference_Type;
152 (Container : aliased in out Map;
153 Position : Cursor) return Reference_Type;
155 function Constant_Reference
156 (Container : aliased Map;
157 Key : Key_Type) return Constant_Reference_Type;
160 (Container : aliased in out Map;
161 Key : Key_Type) return Reference_Type;
163 procedure Assign (Target : in out Map; Source : Map);
165 function Copy (Source : Map; Capacity : Count_Type := 0) return Map;
167 procedure Move (Target : in out Map; Source : in out Map);
168 -- Clears Target (if it's not empty), and then moves (not copies) the
169 -- buckets array and nodes from Source to Target.
172 (Container : in out Map;
174 New_Item : Element_Type;
175 Position : out Cursor;
176 Inserted : out Boolean);
177 -- Conditionally inserts New_Item into the map. If Key is already in the
178 -- map, then Inserted returns False and Position designates the node
179 -- containing the existing key/element pair (neither of which is modified).
180 -- If Key is not already in the map, the Inserted returns True and Position
181 -- designates the newly-inserted node container Key and New_Item. The
182 -- search for the key works as follows. Hash is called to determine Key's
183 -- bucket; if the bucket is non-empty, then Equivalent_Keys is called to
184 -- compare Key to each node in that bucket. If the bucket is empty, or
185 -- there were no matching keys in the bucket, the search "fails" and the
186 -- key/item pair is inserted in the map (and Inserted returns True);
187 -- otherwise, the search "succeeds" (and Inserted returns False).
190 (Container : in out Map;
192 New_Item : Element_Type);
193 -- Attempts to insert Key into the map, performing the usual search (which
194 -- involves calling both Hash and Equivalent_Keys); if the search succeeds
195 -- (because Key is already in the map), then it raises Constraint_Error.
196 -- (This version of Insert is similar to Replace, but having the opposite
197 -- exception behavior. It is intended for use when you want to assert that
198 -- Key is not already in the map.)
201 (Container : in out Map;
203 New_Item : Element_Type);
204 -- Attempts to insert Key into the map. If Key is already in the map, then
205 -- both the existing key and element are assigned the values of Key and
206 -- New_Item, respectively. (This version of Insert only raises an exception
207 -- if cursor tampering occurs. It is intended for use when you want to
208 -- insert the key/element pair in the map, and you don't care whether Key
209 -- is already present.)
212 (Container : in out Map;
214 New_Item : Element_Type);
215 -- Searches for Key in the map; if the search fails (because Key was not in
216 -- the map), then it raises Constraint_Error. Otherwise, both the existing
217 -- key and element are assigned the values of Key and New_Item rsp. (This
218 -- is similar to Insert, but with the opposite exception behavior. It is
219 -- intended for use when you want to assert that Key is already in the
222 procedure Exclude (Container : in out Map; Key : Key_Type);
223 -- Searches for Key in the map, and if found, removes its node from the map
224 -- and then deallocates it. The search works as follows. The operation
225 -- calls Hash to determine the key's bucket; if the bucket is not empty, it
226 -- calls Equivalent_Keys to compare Key to each key in the bucket. (This is
227 -- the deletion analog of Include. It is intended for use when you want to
228 -- remove the item from the map, but don't care whether the key is already
231 procedure Delete (Container : in out Map; Key : Key_Type);
232 -- Searches for Key in the map (which involves calling both Hash and
233 -- Equivalent_Keys). If the search fails, then the operation raises
234 -- Constraint_Error. Otherwise it removes the node from the map and then
235 -- deallocates it. (This is the deletion analog of non-conditional
236 -- Insert. It is intended for use when you want to assert that the item is
237 -- already in the map.)
239 procedure Delete (Container : in out Map; Position : in out Cursor);
240 -- Removes the node designated by Position from the map, and then
241 -- deallocates the node. The operation calls Hash to determine the bucket,
242 -- and then compares Position to each node in the bucket until there's a
243 -- match (it does not call Equivalent_Keys).
245 function First (Container : Map) return Cursor;
246 -- Returns a cursor that designates the first non-empty bucket, by
247 -- searching from the beginning of the buckets array.
249 function Next (Position : Cursor) return Cursor;
250 -- Returns a cursor that designates the node that follows the current one
251 -- designated by Position. If Position designates the last node in its
252 -- bucket, the operation calls Hash to compute the index of this bucket,
253 -- and searches the buckets array for the first non-empty bucket, starting
254 -- from that index; otherwise, it simply follows the link to the next node
255 -- in the same bucket.
257 procedure Next (Position : in out Cursor);
258 -- Equivalent to Position := Next (Position)
260 function Find (Container : Map; Key : Key_Type) return Cursor;
261 -- Searches for Key in the map. Find calls Hash to determine the key's
262 -- bucket; if the bucket is not empty, it calls Equivalent_Keys to compare
263 -- Key to each key in the bucket. If the search succeeds, Find returns a
264 -- cursor designating the matching node; otherwise, it returns No_Element.
266 function Contains (Container : Map; Key : Key_Type) return Boolean;
267 -- Equivalent to Find (Container, Key) /= No_Element
269 function Element (Container : Map; Key : Key_Type) return Element_Type;
270 -- Equivalent to Element (Find (Container, Key))
272 function Equivalent_Keys (Left, Right : Cursor) return Boolean;
273 -- Returns the result of calling Equivalent_Keys with the keys of the nodes
274 -- designated by cursors Left and Right.
276 function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean;
277 -- Returns the result of calling Equivalent_Keys with key of the node
278 -- designated by Left and key Right.
280 function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean;
281 -- Returns the result of calling Equivalent_Keys with key Left and the node
282 -- designated by Right.
286 Process : not null access procedure (Position : Cursor));
287 -- Calls Process for each node in the map
289 function Iterate (Container : Map)
290 return Map_Iterator_Interfaces.Forward_Iterator'class;
294 pragma Inline (Length);
295 pragma Inline (Is_Empty);
296 pragma Inline (Clear);
298 pragma Inline (Element);
299 pragma Inline (Move);
300 pragma Inline (Contains);
301 pragma Inline (Capacity);
302 pragma Inline (Reserve_Capacity);
303 pragma Inline (Has_Element);
304 pragma Inline (Equivalent_Keys);
305 pragma Inline (Next);
308 type Node_Access is access Node_Type;
310 type Key_Access is access Key_Type;
311 type Element_Access is access Element_Type;
313 type Node_Type is limited record
315 Element : Element_Access;
320 new Hash_Tables.Generic_Hash_Table_Types (Node_Type, Node_Access);
322 type Map is new Ada.Finalization.Controlled with record
323 HT : HT_Types.Hash_Table_Type;
326 overriding procedure Adjust (Container : in out Map);
328 overriding procedure Finalize (Container : in out Map);
331 use Ada.Finalization;
335 (Stream : not null access Root_Stream_Type'Class;
338 for Map'Write use Write;
341 (Stream : not null access Root_Stream_Type'Class;
342 Container : out Map);
344 for Map'Read use Read;
346 type Map_Access is access all Map;
347 for Map_Access'Storage_Size use 0;
349 type Cursor is record
350 Container : Map_Access;
355 (Stream : not null access Root_Stream_Type'Class;
358 for Cursor'Write use Write;
361 (Stream : not null access Root_Stream_Type'Class;
364 for Cursor'Read use Read;
366 type Constant_Reference_Type
367 (Element : not null access constant Element_Type) is null record;
370 (Stream : not null access Root_Stream_Type'Class;
371 Item : Constant_Reference_Type);
373 for Constant_Reference_Type'Write use Write;
376 (Stream : not null access Root_Stream_Type'Class;
377 Item : out Constant_Reference_Type);
379 for Constant_Reference_Type'Read use Read;
382 (Element : not null access Element_Type) is null record;
385 (Stream : not null access Root_Stream_Type'Class;
386 Item : Reference_Type);
388 for Reference_Type'Write use Write;
391 (Stream : not null access Root_Stream_Type'Class;
392 Item : out Reference_Type);
394 for Reference_Type'Read use Read;
396 Empty_Map : constant Map := (Controlled with HT => (null, 0, 0, 0));
398 No_Element : constant Cursor := (Container => null, Node => null);
400 end Ada.Containers.Indefinite_Hashed_Maps;