tDictionary.cpp 1.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647
  1. //-----------------------------------------------------------------------------
  2. // Copyright (c) 2012 GarageGames, LLC
  3. //
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy
  5. // of this software and associated documentation files (the "Software"), to
  6. // deal in the Software without restriction, including without limitation the
  7. // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
  8. // sell copies of the Software, and to permit persons to whom the Software is
  9. // furnished to do so, subject to the following conditions:
  10. //
  11. // The above copyright notice and this permission notice shall be included in
  12. // all copies or substantial portions of the Software.
  13. //
  14. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  20. // IN THE SOFTWARE.
  21. //-----------------------------------------------------------------------------
  22. #include "core/util/tDictionary.h"
  23. namespace DictHash
  24. {
  25. static U32 Primes[] = {
  26. 53ul, 97ul, 193ul, 389ul, 769ul,
  27. 1543ul, 3079ul, 6151ul, 12289ul, 24593ul,
  28. 49157ul, 98317ul, 196613ul, 393241ul, 786433ul,
  29. 1572869ul, 3145739ul, 6291469ul, 12582917ul, 25165843ul,
  30. 50331653ul, 100663319ul, 201326611ul, 402653189ul, 805306457ul,
  31. 1610612741ul, 3221225473ul, 4294967291ul
  32. };
  33. U32 nextPrime(U32 size)
  34. {
  35. U32 len = sizeof(Primes) / sizeof(U32);
  36. for(U32 i=0; i<len; i++)
  37. if(Primes[i] > size)
  38. return Primes[i];
  39. return Primes[len-1];
  40. }
  41. };