1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- A D A . C O N T A I N E R S . H A S H E D _ M A P S --
9 -- Copyright (C) 2004-2005, 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.Hash_Tables;
38 with Ada.Finalization;
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.Hashed_Maps is
51 type Map is tagged private;
53 type Cursor is private;
55 Empty_Map : constant Map;
57 No_Element : constant Cursor;
59 function "=" (Left, Right : Map) return Boolean;
61 function Capacity (Container : Map) return Count_Type;
63 procedure Reserve_Capacity (Container : in out Map;
64 Capacity : Count_Type);
66 function Length (Container : Map) return Count_Type;
68 function Is_Empty (Container : Map) return Boolean;
70 procedure Clear (Container : in out Map);
72 function Key (Position : Cursor) return Key_Type;
74 function Element (Position : Cursor) return Element_Type;
76 procedure Replace_Element
77 (Container : in out Map;
79 New_Item : Element_Type);
81 procedure Query_Element
83 Process : not null access
84 procedure (Key : Key_Type; Element : Element_Type));
86 procedure Update_Element
87 (Container : in out Map;
89 Process : not null access
90 procedure (Key : Key_Type; Element : in out Element_Type));
92 procedure Move (Target : in out Map; Source : in out Map);
95 (Container : in out Map;
97 New_Item : Element_Type;
98 Position : out Cursor;
99 Inserted : out Boolean);
102 (Container : in out Map;
104 Position : out Cursor;
105 Inserted : out Boolean);
108 (Container : in out Map;
110 New_Item : Element_Type);
113 (Container : in out Map;
115 New_Item : Element_Type);
118 (Container : in out Map;
120 New_Item : Element_Type);
122 procedure Exclude (Container : in out Map; Key : Key_Type);
124 procedure Delete (Container : in out Map; Key : Key_Type);
126 procedure Delete (Container : in out Map; Position : in out Cursor);
128 function First (Container : Map) return Cursor;
130 function Next (Position : Cursor) return Cursor;
132 procedure Next (Position : in out Cursor);
134 function Find (Container : Map; Key : Key_Type) return Cursor;
136 function Contains (Container : Map; Key : Key_Type) return Boolean;
138 function Element (Container : Map; Key : Key_Type) return Element_Type;
140 function Has_Element (Position : Cursor) return Boolean;
142 function Equivalent_Keys (Left, Right : Cursor) return Boolean;
144 function Equivalent_Keys (Left : Cursor; Right : Key_Type) return Boolean;
146 function Equivalent_Keys (Left : Key_Type; Right : Cursor) return Boolean;
150 Process : not null access procedure (Position : Cursor));
154 pragma Inline (Length);
155 pragma Inline (Is_Empty);
156 pragma Inline (Clear);
158 pragma Inline (Element);
159 pragma Inline (Move);
160 pragma Inline (Contains);
161 pragma Inline (Capacity);
162 pragma Inline (Reserve_Capacity);
163 pragma Inline (Has_Element);
164 pragma Inline (Equivalent_Keys);
167 type Node_Access is access Node_Type;
169 type Node_Type is limited record
171 Element : Element_Type;
175 package HT_Types is new Hash_Tables.Generic_Hash_Table_Types
179 type Map is new Ada.Finalization.Controlled with record
180 HT : HT_Types.Hash_Table_Type;
184 use Ada.Finalization;
186 procedure Adjust (Container : in out Map);
188 procedure Finalize (Container : in out Map);
193 (Stream : access Root_Stream_Type'Class;
196 for Map'Write use Write;
199 (Stream : access Root_Stream_Type'Class;
200 Container : out Map);
202 for Map'Read use Read;
204 Empty_Map : constant Map := (Controlled with HT => (null, 0, 0, 0));
206 type Map_Access is access constant Map;
207 for Map_Access'Storage_Size use 0;
211 Container : Map_Access;
216 (Stream : access Root_Stream_Type'Class;
219 for Cursor'Write use Write;
222 (Stream : access Root_Stream_Type'Class;
225 for Cursor'Read use Read;
227 No_Element : constant Cursor := (Container => null, Node => null);
229 end Ada.Containers.Hashed_Maps;