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 _ H A S H E D _ M A P S --
10 -- Copyright (C) 2004-2005 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.Hash_Tables;
39 with Ada.Finalization;
42 type Key_Type (<>) is private;
43 type Element_Type (<>) is private;
45 with function Hash (Key : Key_Type) return Hash_Type;
46 with function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
47 with function "=" (Left, Right : Element_Type) return Boolean is <>;
49 package Ada.Containers.Indefinite_Hashed_Maps is
52 type Map is tagged private;
53 type Cursor is private;
55 Empty_Map : constant Map;
56 No_Element : constant Cursor;
58 function "=" (Left, Right : Map) return Boolean;
60 function Length (Container : Map) return Count_Type;
62 function Is_Empty (Container : Map) return Boolean;
64 procedure Clear (Container : in out Map);
66 function Key (Position : Cursor) return Key_Type;
68 function Element (Position : Cursor) return Element_Type;
70 procedure Query_Element
72 Process : not null access procedure (Key : Key_Type;
73 Element : Element_Type));
75 procedure Update_Element
77 Process : not null access procedure (Key : Key_Type;
78 Element : in out Element_Type));
80 procedure Replace_Element
84 procedure Move (Target : in out Map; Source : in out Map);
87 (Container : in out Map;
89 New_Item : Element_Type;
90 Position : out Cursor;
91 Inserted : out Boolean);
94 (Container : in out Map;
96 New_Item : Element_Type);
99 (Container : in out Map;
101 New_Item : Element_Type);
104 (Container : in out Map;
106 New_Item : Element_Type);
109 (Container : in out Map;
113 (Container : in out Map;
114 Position : in out Cursor);
117 (Container : in out Map;
122 Key : Key_Type) return Boolean;
126 Key : Key_Type) return Cursor;
130 Key : Key_Type) return Element_Type;
132 function First (Container : Map) return Cursor;
134 function Next (Position : Cursor) return Cursor;
136 procedure Next (Position : in out Cursor);
138 function Has_Element (Position : Cursor) return Boolean;
140 function Equivalent_Keys (Left, Right : Cursor)
143 function Equivalent_Keys
145 Right : Key_Type) return Boolean;
147 function Equivalent_Keys
149 Right : Cursor) return Boolean;
153 Process : not null access procedure (Position : Cursor));
155 function Capacity (Container : Map) return Count_Type;
157 procedure Reserve_Capacity
158 (Container : in out Map;
159 Capacity : Count_Type);
163 pragma Inline (Length);
164 pragma Inline (Is_Empty);
165 pragma Inline (Clear);
167 pragma Inline (Element);
168 pragma Inline (Move);
169 pragma Inline (Contains);
170 pragma Inline (Capacity);
171 pragma Inline (Reserve_Capacity);
172 pragma Inline (Has_Element);
173 pragma Inline (Equivalent_Keys);
176 type Node_Access is access Node_Type;
178 type Key_Access is access Key_Type;
179 type Element_Access is access Element_Type;
181 type Node_Type is limited record
183 Element : Element_Access;
187 package HT_Types is new Hash_Tables.Generic_Hash_Table_Types
191 type Map is new Ada.Finalization.Controlled with record
192 HT : HT_Types.Hash_Table_Type;
196 use Ada.Finalization;
198 procedure Adjust (Container : in out Map);
200 procedure Finalize (Container : in out Map);
202 type Map_Access is access constant Map;
203 for Map_Access'Storage_Size use 0;
207 Container : Map_Access;
211 No_Element : constant Cursor :=
218 (Stream : access Root_Stream_Type'Class;
221 for Map'Write use Write;
224 (Stream : access Root_Stream_Type'Class;
225 Container : out Map);
227 for Map'Read use Read;
229 Empty_Map : constant Map := (Controlled with HT => (null, 0, 0, 0));
231 end Ada.Containers.Indefinite_Hashed_Maps;