* gcc.dg/pr26570.c: Clean up coverage files.
[official-gcc.git] / gcc / ada / a-swbwha.adb
blob6a5f84777e6048a89666738f441065590502a9a7
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT LIBRARY COMPONENTS --
4 -- --
5 -- A D A . S T R I N G S . W I D E _ B O U N D E D . W I D E _ H A S H --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 2004-2006, Free Software Foundation, Inc. --
10 -- --
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 2, 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. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
21 -- --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
28 -- --
29 -- This unit was originally developed by Matthew J Heaney. --
30 ------------------------------------------------------------------------------
32 -- Note: source of this algorithm: GNAT.HTable.Hash (g-htable.adb)
34 function Ada.Strings.Wide_Bounded.Wide_Hash
35 (Key : Bounded.Bounded_Wide_String)
36 return Containers.Hash_Type
38 use Ada.Containers;
40 function Rotate_Left
41 (Value : Hash_Type;
42 Amount : Natural) return Hash_Type;
43 pragma Import (Intrinsic, Rotate_Left);
45 Tmp : Hash_Type;
47 begin
48 Tmp := 0;
49 for J in 1 .. Bounded.Length (Key) loop
50 Tmp := Rotate_Left (Tmp, 3) +
51 Wide_Character'Pos (Bounded.Element (Key, J));
52 end loop;
54 return Tmp;
55 end Ada.Strings.Wide_Bounded.Wide_Hash;