PR tree-optimization/19853
[official-gcc.git] / gcc / ada / a-coprnu.adb
bloba27557afd96c1760c8979fea3836b47f073ca319
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT LIBRARY COMPONENTS --
4 -- --
5 -- ADA.CONTAINERS.PRIME_NUMBERS --
6 -- --
7 -- B o d y --
8 -- --
9 -- Copyright (C) 2004 Free Software Foundation, Inc. --
10 -- --
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. --
14 -- --
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, 59 Temple Place - Suite 330, Boston, --
24 -- MA 02111-1307, USA. --
25 -- --
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. --
32 -- --
33 -- This unit was originally developed by Matthew J Heaney. --
34 ------------------------------------------------------------------------------
36 package body Ada.Containers.Prime_Numbers is
38 --------------
39 -- To_Prime --
40 --------------
42 function To_Prime (Length : Count_Type) return Hash_Type is
43 I, J, K : Integer'Base;
44 Index : Integer'Base;
46 begin
47 I := Primes'Last - Primes'First;
48 Index := Primes'First;
49 while I > 0 loop
50 J := I / 2;
51 K := Index + J;
53 if Primes (K) < Hash_Type (Length) then
54 Index := K + 1;
55 I := I - J - 1;
56 else
57 I := J;
58 end if;
59 end loop;
61 return Primes (Index);
62 end To_Prime;
64 end Ada.Containers.Prime_Numbers;