passenger 6.0.8 → 6.0.9

data/src/cxx_supportlib/vendor-modified/boost/random/detail/seed_impl.hpp

@@ -20,13 +20,12 @@
 #include <boost/integer/integer_mask.hpp>
 #include <boost/integer/static_log2.hpp>
 #include <boost/random/traits.hpp>
-#include <boost/mpl/bool.hpp>
-#include <boost/mpl/if.hpp>
-#include <boost/mpl/int.hpp>
 #include <boost/random/detail/const_mod.hpp>
 #include <boost/random/detail/integer_log2.hpp>
 #include <boost/random/detail/signed_unsigned_tools.hpp>
 #include <boost/random/detail/generator_bits.hpp>
+#include <boost/type_traits/conditional.hpp>
+#include <boost/type_traits/integral_constant.hpp>
 
 #include <boost/random/detail/disable_warnings.hpp>
 
@@ -41,7 +40,7 @@ namespace detail {
 template<class T>
 struct seed_type
 {
-    typedef typename boost::mpl::if_<boost::is_integral<T>,
+    typedef typename boost::conditional<boost::is_integral<T>::value,
         T,
         boost::uint32_t
     >::type type;
@@ -203,13 +202,13 @@ void generate_from_int(Engine& eng, Iter begin, Iter end)
 }
 
 template<class Engine, class Iter>
-void generate_impl(Engine& eng, Iter first, Iter last, boost::mpl::true_)
+void generate_impl(Engine& eng, Iter first, Iter last, boost::true_type)
 {
     return detail::generate_from_int(eng, first, last);
 }
 
 template<class Engine, class Iter>
-void generate_impl(Engine& eng, Iter first, Iter last, boost::mpl::false_)
+void generate_impl(Engine& eng, Iter first, Iter last, boost::false_type)
 {
     return detail::generate_from_real(eng, first, last);
 }
@@ -225,8 +224,8 @@ void generate(Engine& eng, Iter first, Iter last)
 template<class IntType, IntType m, class SeedSeq>
 IntType seed_one_int(SeedSeq& seq)
 {
-    static const int log = ::boost::mpl::if_c<(m == 0),
-        ::boost::mpl::int_<(::std::numeric_limits<IntType>::digits)>,
+    static const int log = ::boost::conditional<(m == 0),
+        ::boost::integral_constant<int, (::std::numeric_limits<IntType>::digits)>,
         ::boost::static_log2<m> >::type::value;
     static const int k =
         (log + ((~(static_cast<IntType>(2) << (log - 1)) & m)? 32 : 31)) / 32;
@@ -244,8 +243,8 @@ IntType seed_one_int(SeedSeq& seq)
 template<class IntType, IntType m, class Iter>
 IntType get_one_int(Iter& first, Iter last)
 {
-    static const int log = ::boost::mpl::if_c<(m == 0),
-        ::boost::mpl::int_<(::std::numeric_limits<IntType>::digits)>,
+    static const int log = ::boost::conditional<(m == 0),
+        ::boost::integral_constant<int, (::std::numeric_limits<IntType>::digits)>,
         ::boost::static_log2<m> >::type::value;
     static const int k =
         (log + ((~(static_cast<IntType>(2) << (log - 1)) & m)? 32 : 31)) / 32;
@@ -277,7 +276,7 @@ void seed_array_int_impl(SeedSeq& seq, UIntType (&x)[n])
 }
 
 template<int w, std::size_t n, class SeedSeq, class IntType>
-inline void seed_array_int_impl(SeedSeq& seq, IntType (&x)[n], boost::mpl::true_)
+inline void seed_array_int_impl(SeedSeq& seq, IntType (&x)[n], boost::true_type)
 {
     BOOST_STATIC_ASSERT_MSG(boost::is_integral<IntType>::value, "Sorry but this routine has not been ported to non built-in integers as it relies on a reinterpret_cast.");
     typedef typename boost::make_unsigned<IntType>::type unsigned_array[n];
@@ -285,7 +284,7 @@ inline void seed_array_int_impl(SeedSeq& seq, IntType (&x)[n], boost::mpl::true_
 }
 
 template<int w, std::size_t n, class SeedSeq, class IntType>
-inline void seed_array_int_impl(SeedSeq& seq, IntType (&x)[n], boost::mpl::false_)
+inline void seed_array_int_impl(SeedSeq& seq, IntType (&x)[n], boost::false_type)
 {
     seed_array_int_impl<w>(seq, x);
 }
@@ -312,7 +311,7 @@ void fill_array_int_impl(Iter& first, Iter last, UIntType (&x)[n])
 }
 
 template<int w, std::size_t n, class Iter, class IntType>
-inline void fill_array_int_impl(Iter& first, Iter last, IntType (&x)[n], boost::mpl::true_)
+inline void fill_array_int_impl(Iter& first, Iter last, IntType (&x)[n], boost::true_type)
 {
     BOOST_STATIC_ASSERT_MSG(boost::is_integral<IntType>::value, "Sorry but this routine has not been ported to non built-in integers as it relies on a reinterpret_cast.");
     typedef typename boost::make_unsigned<IntType>::type unsigned_array[n];
@@ -320,7 +319,7 @@ inline void fill_array_int_impl(Iter& first, Iter last, IntType (&x)[n], boost::
 }
 
 template<int w, std::size_t n, class Iter, class IntType>
-inline void fill_array_int_impl(Iter& first, Iter last, IntType (&x)[n], boost::mpl::false_)
+inline void fill_array_int_impl(Iter& first, Iter last, IntType (&x)[n], boost::false_type)
 {
     fill_array_int_impl<w>(first, last, x);
 }

data/src/cxx_supportlib/vendor-modified/boost/random/detail/sobol_table.hpp

@@ -10,6 +10,7 @@
 #define BOOST_RANDOM_DETAIL_SOBOL_TABLE_HPP
 
 #include <boost/config.hpp>
+#include <cstddef>
 
 namespace boost {
 namespace random {

data/src/cxx_supportlib/vendor-modified/boost/random/discard_block.hpp

@@ -136,13 +136,13 @@ public:
      * Returns the smallest value that the generator can produce.
      * This is the same as the minimum of the underlying generator.
      */
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return (base_type::min)(); }
     /**
      * Returns the largest value that the generator can produce.
      * This is the same as the maximum of the underlying generator.
      */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return (base_type::max)(); }
 
 #ifndef BOOST_RANDOM_NO_STREAM_OPERATORS

data/src/cxx_supportlib/vendor-modified/boost/random/generate_canonical.hpp

@@ -19,7 +19,6 @@
 #include <boost/config/no_tr1/cmath.hpp>
 #include <boost/limits.hpp>
 #include <boost/type_traits/is_integral.hpp>
-#include <boost/mpl/bool.hpp>
 #include <boost/random/detail/signed_unsigned_tools.hpp>
 #include <boost/random/detail/generator_bits.hpp>
 
@@ -29,7 +28,7 @@ namespace random {
 namespace detail {
 
 template<class RealType, std::size_t bits, class URNG>
-RealType generate_canonical_impl(URNG& g, boost::mpl::true_ /*is_integral*/)
+RealType generate_canonical_impl(URNG& g, boost::true_type /*is_integral*/)
 {
     using std::pow;
     typedef typename URNG::result_type base_result;
@@ -49,7 +48,7 @@ RealType generate_canonical_impl(URNG& g, boost::mpl::true_ /*is_integral*/)
 }
 
 template<class RealType, std::size_t bits, class URNG>
-RealType generate_canonical_impl(URNG& g, boost::mpl::false_ /*is_integral*/)
+RealType generate_canonical_impl(URNG& g, boost::false_type /*is_integral*/)
 {
     using std::pow;
     using std::floor;

data/src/cxx_supportlib/vendor-modified/boost/random/hyperexponential_distribution.hpp

@@ -19,7 +19,7 @@
 
 
 #include <boost/config.hpp>
-#include <boost/math/special_functions/fpclassify.hpp>
+#include <boost/core/cmath.hpp>
 #include <boost/random/detail/operators.hpp>
 #include <boost/random/detail/vector_io.hpp>
 #include <boost/random/discrete_distribution.hpp>
@@ -78,7 +78,7 @@ bool check_probabilities(std::vector<RealT> const& probabilities)
     {
         if (probabilities[i] < 0
             || probabilities[i] > 1
-            || !(boost::math::isfinite)(probabilities[i]))
+            || !(boost::core::isfinite)(probabilities[i]))
         {
             return false;
         }
@@ -109,7 +109,7 @@ bool check_rates(std::vector<RealT> const& rates)
     for (std::size_t i = 0; i < n; ++i)
     {
         if (rates[i] <= 0
-            || !(boost::math::isfinite)(rates[i]))
+            || !(boost::core::isfinite)(rates[i]))
         {
             return false;
         }

data/src/cxx_supportlib/vendor-modified/boost/random/independent_bits.hpp

@@ -52,10 +52,10 @@ public:
     BOOST_STATIC_CONSTANT(bool, has_fixed_range = false);
 
     /** Returns the smallest value that the generator can produce. */
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return 0; }
     /** Returns the largest value that the generator can produce. */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return max_imp(boost::is_integral<UIntType>()); }
 
     /**
@@ -241,7 +241,7 @@ private:
     /// \cond show_private
     typedef typename boost::random::traits::make_unsigned<base_result_type>::type base_unsigned;
 
-    static UIntType max_imp(const boost::true_type&)
+    static BOOST_CONSTEXPR UIntType max_imp(const boost::true_type&)
     {
        return boost::low_bits_mask_t<w>::sig_bits;
     }

data/src/cxx_supportlib/vendor-modified/boost/random/inversive_congruential.hpp

@@ -21,7 +21,6 @@
 #include <boost/assert.hpp>
 #include <boost/config.hpp>
 #include <boost/cstdint.hpp>
-#include <boost/integer/static_log2.hpp>
 #include <boost/random/detail/config.hpp>
 #include <boost/random/detail/const_mod.hpp>
 #include <boost/random/detail/seed.hpp>
@@ -75,8 +74,8 @@ public:
     BOOST_STATIC_CONSTANT(result_type, modulus = p);
     BOOST_STATIC_CONSTANT(IntType, default_seed = 1);
 
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return b == 0 ? 1 : 0; }
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return p-1; }
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return b == 0 ? 1 : 0; }
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return p-1; }
     
     /**
      * Constructs an @c inversive_congruential_engine, seeding it with

data/src/cxx_supportlib/vendor-modified/boost/random/lagged_fibonacci.hpp

@@ -55,9 +55,9 @@ public:
     BOOST_STATIC_CONSTANT(UIntType, default_seed = 331u);
 
     /** Returns the smallest value that the generator can produce. */
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }
     /** Returns the largest value that the generator can produce. */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return low_bits_mask_t<w>::sig_bits; }
 
     /** Creates a new @c lagged_fibonacci_engine and calls @c seed(). */
@@ -321,9 +321,9 @@ public:
     }
 
     /** Returns the smallest value that the generator can produce. */
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return result_type(0); }
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return result_type(0); }
     /** Returns the upper bound of the generators outputs. */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return result_type(1); }
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return result_type(1); }
 
     /** Returns the next value of the generator. */
     result_type operator()()

data/src/cxx_supportlib/vendor-modified/boost/random/linear_congruential.hpp

@@ -23,8 +23,6 @@
 #include <boost/cstdint.hpp>
 #include <boost/limits.hpp>
 #include <boost/static_assert.hpp>
-#include <boost/integer/static_log2.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/type_traits/is_arithmetic.hpp>
 #include <boost/random/detail/config.hpp>
 #include <boost/random/detail/const_mod.hpp>
@@ -137,7 +135,7 @@ public:
             _x = x0 % modulus;
         }
         // handle negative seeds
-        if(_x <= 0 && _x != 0) {
+        if(_x < 0) {
             _x += modulus;
         }
         // adjust to the correct range
@@ -170,13 +168,13 @@ public:
      * Returns the smallest value that the @c linear_congruential_engine
      * can produce.
      */
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return c == 0 ? 1 : 0; }
     /**
      * Returns the largest value that the @c linear_congruential_engine
      * can produce.
      */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return modulus-1; }
 
     /** Returns the next value of the @c linear_congruential_engine. */
@@ -357,11 +355,11 @@ public:
     /**
      * Returns the smallest value that the generator can produce
      */
-    static uint32_t min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }
+    static BOOST_CONSTEXPR uint32_t min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }
     /**
      * Returns the largest value that the generator can produce
      */
-    static uint32_t max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR uint32_t max BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return 0x7FFFFFFF; }
   
     /** Seeds the generator with the default seed. */

data/src/cxx_supportlib/vendor-modified/boost/random/linear_feedback_shift.hpp

@@ -52,9 +52,9 @@ public:
     BOOST_STATIC_CONSTANT(UIntType, default_seed = 341);
 
     /** Returns the smallest value that the generator can produce. */
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; }
     /** Returns the largest value that the generator can produce. */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return wordmask(); }
 
     BOOST_STATIC_ASSERT(w > 0);
@@ -168,7 +168,7 @@ public:
 
 private:
     /// \cond show_private
-    static UIntType wordmask() { return boost::low_bits_mask_t<w>::sig_bits; }
+    static BOOST_CONSTEXPR UIntType wordmask() { return boost::low_bits_mask_t<w>::sig_bits; }
     /// \endcond
     UIntType value;
 };

data/src/cxx_supportlib/vendor-modified/boost/random/mersenne_twister.hpp

@@ -177,10 +177,10 @@ public:
     }
 
     /** Returns the smallest value that the generator can produce. */
-    static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return 0; }
     /** Returns the largest value that the generator can produce. */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
     { return boost::low_bits_mask_t<w>::sig_bits; }
 
     /** Produces the next value of the generator. */

data/src/cxx_supportlib/vendor-modified/boost/random/mixmax.hpp

@@ -0,0 +1,313 @@
+/* boost random/mixmax.hpp header file
+ *
+ * Copyright Kostas Savvidis 2008-2019
+ *
+ * Distributed under the Boost Software License, Version 1.0. (See
+ * accompanying file LICENSE_1_0.txt or copy at
+ * http://www.boost.org/LICENSE_1_0.txt)
+ *
+ * See http://www.boost.org for most recent version including documentation.
+ *
+ * $Id$
+ *
+ * Revision history
+ *  2019-04-23 created
+ */
+
+#ifndef BOOST_RANDOM_MIXMAX_HPP
+#define BOOST_RANDOM_MIXMAX_HPP
+
+#include <sstream>
+#include <boost/cstdint.hpp>
+#include <boost/array.hpp>
+
+#include <boost/random/detail/seed.hpp>
+#include <boost/random/detail/seed_impl.hpp>
+
+namespace boost {
+namespace random {
+
+/**
+ * Instantiations of class template mixmax_engine model,
+ * \pseudo_random_number_generator .
+ *  It uses the  MIXMAX generator algorithms from:
+ *
+ *  @blockquote
+ *  G.K.Savvidy and N.G.Ter-Arutyunian,
+ *  On the Monte Carlo simulation of physical systems,
+ *  J.Comput.Phys. 97, 566 (1991);
+ *  Preprint EPI-865-16-86, Yerevan, Jan. 1986
+ *  http://dx.doi.org/10.1016/0021-9991(91)90015-D
+ *
+ *  K.Savvidy
+ *  The MIXMAX random number generator
+ *  Comp. Phys. Commun. 196 (2015), pp 161–165
+ *  http://dx.doi.org/10.1016/j.cpc.2015.06.003
+ *
+ *  K.Savvidy and G.Savvidy
+ *  Spectrum and Entropy of C-systems. MIXMAX random number generator
+ *  Chaos, Solitons & Fractals, Volume 91, (2016) pp. 33–38
+ *  http://dx.doi.org/10.1016/j.chaos.2016.05.003
+ *  @endblockquote
+ *
+ * The generator crucially depends on the choice of the
+ * parameters. The valid sets of parameters are from the published papers above.
+ *
+ */
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> // MIXMAX TEMPLATE PARAMETERS
+class mixmax_engine{
+public:
+    // Interfaces required by C++11 std::random and boost::random
+    typedef boost::uint64_t result_type ;
+    BOOST_STATIC_CONSTANT(boost::uint64_t,mixmax_min=0);
+    BOOST_STATIC_CONSTANT(boost::uint64_t,mixmax_max=((1ULL<<61)-1));
+    BOOST_STATIC_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION() {return mixmax_min;}
+    BOOST_STATIC_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION() {return mixmax_max;}
+    static const bool has_fixed_range = false;
+    BOOST_STATIC_CONSTANT(int,N=Ndim);     ///< The main internal parameter, size of the defining MIXMAX matrix
+    // CONSTRUCTORS:
+    explicit mixmax_engine();                       ///< Constructor, unit vector as initial state, acted on by A^2^512
+    explicit mixmax_engine(boost::uint64_t);          ///< Constructor, one 64-bit seed
+    explicit mixmax_engine(uint32_t clusterID, uint32_t machineID, uint32_t runID, uint32_t  streamID );  ///< Constructor, four 32-bit seeds for 128-bit seeding flexibility
+    void seed(boost::uint64_t seedval=default_seed){seed_uniquestream( &S, 0, 0, (uint32_t)(seedval>>32), (uint32_t)seedval );} ///< seed with one 64-bit seed
+    
+private: // DATATYPES
+    struct rng_state_st{
+        boost::array<boost::uint64_t, Ndim> V;
+        boost::uint64_t sumtot;
+        int counter;
+    };
+    
+    typedef struct rng_state_st rng_state_t;     // struct alias
+    rng_state_t S;
+    
+public: // SEEDING FUNCTIONS
+    template<class It> mixmax_engine(It& first, It last) { seed(first,last); }
+    BOOST_RANDOM_DETAIL_SEED_SEQ_CONSTRUCTOR(mixmax_engine,  SeedSeq, seq){ seed(seq); }
+    
+    /** Sets the state of the generator using values from an iterator range. */
+    template<class It>
+    void seed(It& first, It last){
+        uint32_t v[4];
+        detail::fill_array_int<32>(first, last, v);
+        seed_uniquestream( &S, v[0], v[1], v[2], v[3]);
+    }
+    /** Sets the state of the generator using values from a seed_seq. */
+    BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(mixmax_engine, SeeqSeq, seq){
+        uint32_t v[4];
+        detail::seed_array_int<32>(seq, v);
+        seed_uniquestream( &S, v[0], v[1], v[2], v[3]);
+    }
+    
+    /** return one uint64 between min=0 and max=2^61-1 */
+    boost::uint64_t operator()(){
+        if (S.counter<=(Ndim-1) ){
+            return S.V[S.counter++];
+        }else{
+            S.sumtot = iterate_raw_vec(S.V.data(), S.sumtot);
+            S.counter=2;
+            return S.V[1];
+        }
+    }
+    
+    /** Fills a range with random values */
+    template<class Iter>
+    void generate(Iter first, Iter last) { detail::generate_from_int(*this, first, last); }
+    
+    void discard(boost::uint64_t nsteps) { for(boost::uint64_t j = 0; j < nsteps; ++j)  (*this)(); } ///< discard n steps, required in boost::random
+    
+    /** save the state of the RNG to a stream */
+    template<class CharT, class Traits>
+    friend std::basic_ostream<CharT,Traits>&
+    operator<< (std::basic_ostream<CharT,Traits>& ost, const mixmax_engine& me){
+        ost << Ndim << " " << me.S.counter << " " << me.S.sumtot << " ";
+        for (int j=0; (j< (Ndim) ); j++) {
+        ost <<  (boost::uint64_t)me.S.V[j] << " ";
+        }
+        ost << "\n";
+        ost.flush();
+        return ost;
+        }
+        
+    /** read the state of the RNG from a stream */
+    template<class CharT, class Traits>
+    friend std::basic_istream<CharT,Traits>&
+    operator>> (std::basic_istream<CharT,Traits> &in, mixmax_engine& me){
+        // will set std::ios::failbit if the input format is not right
+        boost::array<boost::uint64_t, Ndim> vec;
+        boost::uint64_t sum=0, savedsum=0, counter=0;
+        in >> counter >> std::ws;
+        BOOST_ASSERT(counter==Ndim);
+        in >> counter >> std::ws;
+        in >> savedsum >> std::ws;
+        for(int j=0;j<Ndim;j++) {
+        in >> std::ws >> vec[j] ;
+        sum=me.MOD_MERSENNE(sum+vec[j]);
+    }
+    if (sum == savedsum && counter>0 && counter<Ndim){
+        me.S.V=vec; me.S.counter = counter; me.S.sumtot=savedsum;
+    }else{
+        in.setstate(std::ios::failbit);
+    }
+    return in;
+    }
+
+friend bool operator==(const mixmax_engine & x,
+                       const mixmax_engine & y){return x.S.counter==y.S.counter && x.S.sumtot==y.S.sumtot && x.S.V==y.S.V ;}
+friend bool operator!=(const mixmax_engine & x,
+                       const mixmax_engine & y){return !operator==(x,y);}
+
+
+private:
+BOOST_STATIC_CONSTANT(int, BITS=61);
+BOOST_STATIC_CONSTANT(boost::uint64_t, M61=2305843009213693951ULL);
+BOOST_STATIC_CONSTANT(boost::uint64_t, default_seed=1);
+inline boost::uint64_t MOD_MERSENNE(boost::uint64_t k) {return ((((k)) & M61) + (((k)) >> BITS) );}
+inline boost::uint64_t MULWU(boost::uint64_t k);
+inline void seed_vielbein(rng_state_t* X, unsigned int i); // seeds with the i-th unit vector, i = 0..Ndim-1,  for testing only
+inline void seed_uniquestream( rng_state_t* Xin, uint32_t clusterID, uint32_t machineID, uint32_t runID, uint32_t  streamID );
+inline boost::uint64_t iterate_raw_vec(boost::uint64_t* Y, boost::uint64_t sumtotOld);
+inline boost::uint64_t apply_bigskip(boost::uint64_t* Vout, boost::uint64_t* Vin, uint32_t clusterID, uint32_t machineID, uint32_t runID, uint32_t  streamID );
+inline boost::uint64_t modadd(boost::uint64_t foo, boost::uint64_t bar);
+inline boost::uint64_t fmodmulM61(boost::uint64_t cum, boost::uint64_t s, boost::uint64_t a);
+};
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::mixmax_engine()
+///< constructor, with no params, seeds with seed=0,  random numbers are as good as from any other seed
+{
+    seed_uniquestream( &S, 0,  0, 0, default_seed);
+}
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::mixmax_engine(boost::uint64_t seedval){
+    ///< constructor, one uint64_t seed, random numbers are statistically independent from any two distinct seeds, e.g. consecutive seeds are ok
+    seed_uniquestream( &S, 0,  0,  (uint32_t)(seedval>>32), (uint32_t)seedval );
+}
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::mixmax_engine(uint32_t clusterID, uint32_t machineID, uint32_t runID, uint32_t  streamID){
+    // constructor, four 32-bit seeds for 128-bit seeding flexibility
+    seed_uniquestream( &S, clusterID,  machineID,  runID,  streamID );
+}
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> uint64_t mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::MULWU (uint64_t k){ return (( (k)<<(SPECIALMUL) & M61) ^ ( (k) >> (BITS-SPECIALMUL))  )  ;}
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> boost::uint64_t mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::iterate_raw_vec(boost::uint64_t* Y, boost::uint64_t sumtotOld){
+    // operates with a raw vector, uses known sum of elements of Y
+    boost::uint64_t  tempP=0, tempV=sumtotOld;
+    Y[0] = tempV;
+    boost::uint64_t sumtot = Y[0], ovflow = 0; // will keep a running sum of all new elements
+    for (int i=1; i<Ndim; i++){
+        boost::uint64_t tempPO = MULWU(tempP);
+        tempV = (tempV+tempPO);
+        tempP = modadd(tempP, Y[i]);
+        tempV = modadd(tempV, tempP); // new Y[i] = old Y[i] + old partial * m
+        Y[i] = tempV;
+        sumtot += tempV; if (sumtot < tempV) {ovflow++;}
+    }
+    return MOD_MERSENNE(MOD_MERSENNE(sumtot) + (ovflow <<3 ));
+}
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> void mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::seed_vielbein(rng_state_t* X, unsigned int index){
+    for (int i=0; i < Ndim; i++){
+        X->V[i] = 0;
+    }
+    if (index<Ndim) { X->V[index] = 1; }else{ X->V[0]=1; }
+    X->counter = Ndim;  // set the counter to Ndim if iteration should happen right away
+    X->sumtot = 1;
+}
+
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> void mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::seed_uniquestream( rng_state_t* Xin, uint32_t clusterID, uint32_t machineID, uint32_t runID, uint32_t  streamID ){
+    seed_vielbein(Xin,0);
+    Xin->sumtot = apply_bigskip(Xin->V.data(), Xin->V.data(),  clusterID,  machineID,  runID,   streamID );
+    Xin->counter = 1;
+}
+
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> boost::uint64_t mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::apply_bigskip( boost::uint64_t* Vout, boost::uint64_t* Vin, uint32_t clusterID, uint32_t machineID, uint32_t runID, uint32_t  streamID ){
+    /*
+     makes a derived state vector, Vout, from the mother state vector Vin
+     by skipping a large number of steps, determined by the given seeding ID's
+     
+     it is mathematically guaranteed that the substreams derived in this way from the SAME (!!!) Vin will not collide provided
+     1) at least one bit of ID is different
+     2) less than 10^100 numbers are drawn from the stream
+     (this is good enough : a single CPU will not exceed this in the lifetime of the universe, 10^19 sec,
+     even if it had a clock cycle of Planck time, 10^44 Hz )
+     
+     Caution: never apply this to a derived vector, just choose some mother vector Vin, for example the unit vector by seed_vielbein(X,0),
+     and use it in all your runs, just change runID to get completely nonoverlapping streams of random numbers on a different day.
+     
+     clusterID and machineID are provided for the benefit of large organizations who wish to ensure that a simulation
+     which is running in parallel on a large number of  clusters and machines will have non-colliding source of random numbers.
+     
+     did i repeat it enough times? the non-collision guarantee is absolute, not probabilistic
+     
+     */
+    
+    
+    const    boost::uint64_t skipMat17[128][17] =
+#include "boost/random/detail/mixmax_skip_N17.ipp"
+    ;
+    
+    const boost::uint64_t* skipMat[128];
+    BOOST_ASSERT(Ndim==17);
+    for (int i=0; i<128; i++) { skipMat[i] = skipMat17[i];}
+    
+    uint32_t IDvec[4] = {streamID, runID, machineID, clusterID};
+    boost::uint64_t Y[Ndim], cum[Ndim];
+    boost::uint64_t sumtot=0;
+    
+    for (int i=0; i<Ndim; i++) { Y[i] = Vin[i]; sumtot = modadd( sumtot, Vin[i]); } ;
+    for (int IDindex=0; IDindex<4; IDindex++) { // go from lower order to higher order ID
+        uint32_t id=IDvec[IDindex];
+        int r = 0;
+        while (id){
+            if (id & 1) {
+                boost::uint64_t* rowPtr = (boost::uint64_t*)skipMat[r + IDindex*8*sizeof(uint32_t)];
+                for (int i=0; i<Ndim; i++){ cum[i] = 0; }
+                for (int j=0; j<Ndim; j++){              // j is lag, enumerates terms of the poly
+                    // for zero lag Y is already given
+                    boost::uint64_t coeff = rowPtr[j]; // same coeff for all i
+                    for (int i =0; i<Ndim; i++){
+                        cum[i] =  fmodmulM61( cum[i], coeff ,  Y[i] ) ;
+                    }
+                    sumtot = iterate_raw_vec(Y, sumtot);
+                }
+                sumtot=0;
+                for (int i=0; i<Ndim; i++){ Y[i] = cum[i]; sumtot = modadd( sumtot, cum[i]); } ;
+            }
+            id = (id >> 1); r++; // bring up the r-th bit in the ID
+        }
+    }
+    sumtot=0;
+    for (int i=0; i<Ndim; i++){ Vout[i] = Y[i]; sumtot = modadd( sumtot, Y[i]); } ;  // returns sumtot, and copy the vector over to Vout
+    return (sumtot) ;
+}
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> inline boost::uint64_t mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::fmodmulM61(boost::uint64_t cum, boost::uint64_t s, boost::uint64_t a){
+    // works on all platforms, including 32-bit linux, PPC and PPC64, ARM and Windows
+    const boost::uint64_t MASK32=0xFFFFFFFFULL;
+    boost::uint64_t o,ph,pl,ah,al;
+    o=(s)*a;
+    ph = ((s)>>32);
+    pl = (s) & MASK32;
+    ah = a>>32;
+    al = a & MASK32;
+    o = (o & M61) + ((ph*ah)<<3) + ((ah*pl+al*ph + ((al*pl)>>32))>>29) ;
+    o += cum;
+    o = (o & M61) + ((o>>61));
+    return o;
+}
+
+template <int Ndim, unsigned int SPECIALMUL, boost::int64_t SPECIAL> boost::uint64_t mixmax_engine  <Ndim, SPECIALMUL, SPECIAL> ::modadd(boost::uint64_t foo, boost::uint64_t bar){
+    return MOD_MERSENNE(foo+bar);
+}
+
+/* @copydoc boost::random::detail::mixmax_engine_doc */
+/** Instantiation with a valid parameter set. */
+typedef mixmax_engine<17,36,0>          mixmax;
+}// namespace random
+}// namespace boost
+
+#endif // BOOST_RANDOM_MIXMAX_HPP