Merge pull request #3072 from stan-dev/sundials-hashmap-win

Backport SUNDIALS bugfix for hashmap int overflow

lib/sundials_6.1.1/STAN_CHANGES

@@ -0,0 +1,3 @@
+This file documents changes done for the stan-math project
+
+  - Backported bugfix for hashmap int overflow on Windows (https://github.com/LLNL/sundials/pull/421)

lib/sundials_6.1.1/src/sundials/sundials_hashmap.h

@@ -20,6 +20,7 @@
 #ifndef _SUNDIALS_HASHMAP_H
 #define _SUNDIALS_HASHMAP_H
 
+#include <stdint.h>
 #include <string.h>
 #include <stdlib.h>
 
@@ -30,10 +31,10 @@
   This is a 64-bit implementation of the 'a' modification of the
   Fowler–Noll–Vo hash (i.e., FNV1-a).
  */
-static unsigned long fnv1a_hash(const char* str)
+static uint64_t fnv1a_hash(const char* str)
 {
-  const unsigned long prime = 14695981039346656037U;   /* prime */
-  unsigned long hash        = 1099511628211U;          /* offset basis */
+  const uint64_t prime = 14695981039346656037U;   /* prime */
+  uint64_t hash        = 1099511628211U;          /* offset basis */
   char c;
   while ((c = *str++))
     hash = (hash^c) * prime;