1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- A D A . C O N T A I N E R S . --
6 -- H A S H _ T A B L E S . G E N E R I C _ K E Y 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 package body Ada.Containers.Hash_Tables.Generic_Keys is
39 --------------------------
40 -- Delete_Key_Sans_Free --
41 --------------------------
43 procedure Delete_Key_Sans_Free
44 (HT : in out Hash_Table_Type;
57 Indx := Index (HT, Key);
58 X := HT.Buckets (Indx);
64 if Equivalent_Keys (Key, X) then
68 HT.Buckets (Indx) := Next (X);
69 HT.Length := HT.Length - 1;
81 if Equivalent_Keys (Key, X) then
85 Set_Next (Node => Prev, Next => Next (X));
86 HT.Length := HT.Length - 1;
90 end Delete_Key_Sans_Free;
97 (HT : Hash_Table_Type;
98 Key : Key_Type) return Node_Access is
104 if HT.Length = 0 then
108 Indx := Index (HT, Key);
110 Node := HT.Buckets (Indx);
111 while Node /= null loop
112 if Equivalent_Keys (Key, Node) then
121 --------------------------------
122 -- Generic_Conditional_Insert --
123 --------------------------------
125 procedure Generic_Conditional_Insert
126 (HT : in out Hash_Table_Type;
128 Node : out Node_Access;
129 Inserted : out Boolean)
131 Indx : constant Hash_Type := Index (HT, Key);
132 B : Node_Access renames HT.Buckets (Indx);
134 subtype Length_Subtype is Count_Type range 0 .. Count_Type'Last - 1;
143 Length : constant Length_Subtype := HT.Length;
145 Node := New_Node (Next => null);
149 HT.Length := Length + 1;
157 if Equivalent_Keys (Key, Node) then
164 exit when Node = null;
172 Length : constant Length_Subtype := HT.Length;
174 Node := New_Node (Next => B);
178 HT.Length := Length + 1;
180 end Generic_Conditional_Insert;
187 (HT : Hash_Table_Type;
188 Key : Key_Type) return Hash_Type is
190 return Hash (Key) mod HT.Buckets'Length;
193 end Ada.Containers.Hash_Tables.Generic_Keys;