2 * A simple hash seed chooser.
4 * Copyright (C) 2003 Germain Garand <germain@ebooksfrance.org>
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Library General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Library General Public License for more details.
16 * You should have received a copy of the GNU Library General Public License
17 * along with this library; see the file COPYING.LIB. If not, write to
18 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
19 * Boston, MA 02110-1301, USA.
26 #define khtml_MaxSeed 47963
30 static const int primes_t
[] =
32 31, 61, 107, 233, 353, 541,
33 821, 1237, 1861, 2797, 4201, 6311,
34 9467, 14207, 21313, 31973, 47963, 0
37 static inline int nextSeed(int curSize
) {
38 for (int i
= 0 ; primes_t
[i
] ; i
++)
39 if (primes_t
[i
] > curSize
)