69 lines
1.8 KiB
C
69 lines
1.8 KiB
C
|
/* Copyright (c) 2013 Scott Lembcke and Howling Moon Software
|
||
|
|
*
|
||
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||
|
|
* of this software and associated documentation files (the "Software"), to deal
|
||
|
|
* in the Software without restriction, including without limitation the rights
|
||
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||
|
|
* copies of the Software, and to permit persons to whom the Software is
|
||
|
|
* furnished to do so, subject to the following conditions:
|
||
|
|
*
|
||
|
|
* The above copyright notice and this permission notice shall be included in
|
||
|
|
* all copies or substantial portions of the Software.
|
||
|
|
*
|
||
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||
|
|
* SOFTWARE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
// Used for resizing hash tables.
|
||
|
|
// Values approximately double.
|
||
|
|
// http://planetmath.org/encyclopedia/GoodHashTablePrimes.html
|
||
|
|
static int primes[] = {
|
||
|
|
5,
|
||
|
|
13,
|
||
|
|
23,
|
||
|
|
47,
|
||
|
|
97,
|
||
|
|
193,
|
||
|
|
389,
|
||
|
|
769,
|
||
|
|
1543,
|
||
|
|
3079,
|
||
|
|
6151,
|
||
|
|
12289,
|
||
|
|
24593,
|
||
|
|
49157,
|
||
|
|
98317,
|
||
|
|
196613,
|
||
|
|
393241,
|
||
|
|
786433,
|
||
|
|
1572869,
|
||
|
|
3145739,
|
||
|
|
6291469,
|
||
|
|
12582917,
|
||
|
|
25165843,
|
||
|
|
50331653,
|
||
|
|
100663319,
|
||
|
|
201326611,
|
||
|
|
402653189,
|
||
|
|
805306457,
|
||
|
|
1610612741,
|
||
|
|
0,
|
||
|
|
};
|
||
|
|
|
||
|
|
static inline int
|
||
|
|
next_prime(int n)
|
||
|
|
{
|
||
|
|
int i = 0;
|
||
|
|
while(n > primes[i]){
|
||
|
|
i++;
|
||
|
|
cpAssertHard(primes[i], "Tried to resize a hash table to a size greater than 1610612741 O_o"); // realistically this should never happen
|
||
|
|
}
|
||
|
|
|
||
|
|
return primes[i];
|
||
|
|
}
|