1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- A D A . S T R I N G S . B O U N D E D . H A S H --
9 -- Copyright (C) 2004-2009, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- This unit was originally developed by Matthew J Heaney. --
28 ------------------------------------------------------------------------------
30 -- Note: source of this algorithm: GNAT.HTable.Hash (g-htable.adb)
32 function Ada
.Strings
.Bounded
.Hash
(Key
: Bounded
.Bounded_String
)
33 return Containers
.Hash_Type
39 Amount
: Natural) return Hash_Type
;
40 pragma Import
(Intrinsic
, Rotate_Left
);
46 for J
in 1 .. Bounded
.Length
(Key
) loop
47 Tmp
:= Rotate_Left
(Tmp
, 3) + Character'Pos (Bounded
.Element
(Key
, J
));
51 end Ada
.Strings
.Bounded
.Hash
;