14 #include "./base/base_uses.f90"
22 CHARACTER(len=*),
PARAMETER,
PRIVATE :: moduleN =
'qs_hash_table_functions'
32 INTEGER,
INTENT(IN) :: ii
37 res = ii + 1 - mod(ii, 2)
39 DO WHILE (.NOT. is_positive_prime(res))
50 PURE FUNCTION is_positive_prime(num)
RESULT(res)
51 INTEGER,
INTENT(IN) :: num
60 IF (mod(num, 2) == 0 .OR. mod(num, 3) == 0)
THEN
69 DO WHILE (ii*ii .LE. num)
70 IF (mod(num, ii) == 0 .OR. mod(num, ii + 2) == 0)
THEN
77 END FUNCTION is_positive_prime
Functions which are common to different hash tables Derived from qs_fb_hash_table_types and qs_fb_has...
pure integer function, public hash_table_matching_prime(ii)
Find a prime number equal or larger than ii.