File indexing completed on 2024-04-14 11:05:41

0001 /*
0002  * A simple hash seed chooser.
0003  *
0004  * Copyright (C) 2003 Germain Garand <germain@ebooksfrance.org>
0005  *
0006  * This library is free software; you can redistribute it and/or
0007  * modify it under the terms of the GNU Library General Public
0008  * License as published by the Free Software Foundation; either
0009  * version 2 of the License, or (at your option) any later version.
0010  *
0011  * This library is distributed in the hope that it will be useful,
0012  * but WITHOUT ANY WARRANTY; without even the implied warranty of
0013  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
0014  * Library General Public License for more details.
0015  *
0016  * You should have received a copy of the GNU Library General Public License
0017  * along with this library; see the file COPYING.LIB.  If not, write to
0018  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
0019  * Boston, MA 02110-1301, USA.
0020  *
0021  */
0022 
0023 #ifndef html_seed_h
0024 #define html_seed_h
0025 
0026 #define khtml_MaxSeed 47963
0027 
0028 namespace khtml
0029 {
0030 
0031 static const int primes_t[] = {
0032     31,    61,   107,   233,   353,   541,
0033     821,  1237,  1861,  2797,  4201,  6311,
0034     9467, 14207, 21313, 31973, 47963,  0
0035 };
0036 
0037 static inline int nextSeed(int curSize)
0038 {
0039     for (int i = 0; primes_t[i]; i++)
0040         if (primes_t[i] > curSize) {
0041             return primes_t[i];
0042         }
0043     return curSize;
0044 }
0045 
0046 } // namespace
0047 
0048 #endif