1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
24 * GLib at ftp://ftp.gtk.org/pub/gtk/.
36 static const guint g_primes
[] =
75 * g_spaced_primes_closest:
78 * Gets the smallest prime number from a built-in array of primes which
79 * is larger than @num. This is used within GLib to calculate the optimum
80 * size of a #GHashTable.
82 * The built-in array of primes ranges from 11 to 13845163 such that
83 * each prime is approximately 1.5-2 times the previous prime.
85 * Returns: the smallest prime number from a built-in array of primes
86 * which is larger than @num
89 g_spaced_primes_closest (guint num
)
93 for (i
= 0; i
< G_N_ELEMENTS (g_primes
); i
++)
94 if (g_primes
[i
] > num
)
97 return g_primes
[G_N_ELEMENTS (g_primes
) - 1];