gcc:
[official-gcc.git] / gcc / ada / a-szbzha.adb
blob641edca23310d8fd20e14993902fc0b006158cc7
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT LIBRARY COMPONENTS --
4 -- --
5 -- A D A . S T R I N G S . W I D E _ W I D E _ B O U N D E D . --
6 -- W I D E _ W I D E _ H A S H --
7 -- --
8 -- B o d y --
9 -- --
10 -- Copyright (C) 2004-2006, Free Software Foundation, Inc. --
11 -- --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
21 -- Boston, MA 02110-1301, USA. --
22 -- --
23 -- As a special exception, if other files instantiate generics from this --
24 -- unit, or you link this unit with other files to produce an executable, --
25 -- this unit does not by itself cause the resulting executable to be --
26 -- covered by the GNU General Public License. This exception does not --
27 -- however invalidate any other reasons why the executable file might be --
28 -- covered by the GNU Public License. --
29 -- --
30 -- This unit was originally developed by Matthew J Heaney. --
31 ------------------------------------------------------------------------------
33 -- Note: source of this algorithm: GNAT.HTable.Hash (g-htable.adb)
35 function Ada.Strings.Wide_Wide_Bounded.Wide_Wide_Hash
36 (Key : Bounded.Bounded_Wide_Wide_String)
37 return Containers.Hash_Type
39 use Ada.Containers;
41 function Rotate_Left
42 (Value : Hash_Type;
43 Amount : Natural) return Hash_Type;
44 pragma Import (Intrinsic, Rotate_Left);
46 Tmp : Hash_Type;
48 begin
49 Tmp := 0;
50 for J in 1 .. Bounded.Length (Key) loop
51 Tmp := Rotate_Left (Tmp, 3) +
52 Wide_Wide_Character'Pos (Bounded.Element (Key, J));
53 end loop;
55 return Tmp;
56 end Ada.Strings.Wide_Wide_Bounded.Wide_Wide_Hash;