passenger 6.0.2 → 6.0.15

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

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

@@ -0,0 +1,360 @@
+/* boost random/nierderreiter_base2.hpp header file
+ *
+ * Copyright Justinas Vygintas Daugmaudis 2010-2018
+ * 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)
+ */
+
+#ifndef BOOST_RANDOM_NIEDERREITER_BASE2_HPP
+#define BOOST_RANDOM_NIEDERREITER_BASE2_HPP
+
+#include <boost/random/detail/niederreiter_base2_table.hpp>
+#include <boost/random/detail/gray_coded_qrng.hpp>
+
+#include <boost/dynamic_bitset.hpp>
+
+namespace boost {
+namespace random {
+
+/** @cond */
+namespace qrng_detail {
+namespace nb2 {
+
+// Return the base 2 logarithm for a given bitset v
+template <typename DynamicBitset>
+inline typename DynamicBitset::size_type
+bitset_log2(const DynamicBitset& v)
+{
+  if (v.none())
+    boost::throw_exception( std::invalid_argument("bitset_log2") );
+
+  typename DynamicBitset::size_type hibit = v.size() - 1;
+  while (!v.test(hibit))
+    --hibit;
+  return hibit;
+}
+
+
+// Multiply polynomials over Z_2.
+template <typename PolynomialT, typename DynamicBitset>
+inline void modulo2_multiply(PolynomialT P, DynamicBitset& v, DynamicBitset& pt)
+{
+  pt.reset(); // pt == 0
+  for (; P; P >>= 1, v <<= 1)
+    if (P & 1) pt ^= v;
+  pt.swap(v);
+}
+
+
+// Calculate the values of the constants V(J,R) as
+// described in BFN section 3.3.
+//
+// pb = polynomial defined in section 2.3 of BFN.
+template <typename DynamicBitset>
+inline void calculate_v(const DynamicBitset& pb,
+  typename DynamicBitset::size_type kj,
+  typename DynamicBitset::size_type pb_degree,
+  DynamicBitset& v)
+{
+  typedef typename DynamicBitset::size_type size_type;
+
+  // Now choose values of V in accordance with
+  // the conditions in section 3.3.
+  size_type r = 0;
+  for ( ; r != kj; ++r)
+    v.reset(r);
+
+  // Quoting from BFN: "Our program currently sets each K_q
+  // equal to eq. This has the effect of setting all unrestricted
+  // values of v to 1."
+  for ( ; r < pb_degree; ++r)
+    v.set(r);
+
+  // Calculate the remaining V's using the recursion of section 2.3,
+  // remembering that the B's have the opposite sign.
+  for ( ; r != v.size(); ++r)
+  {
+    bool term = false;
+    for (typename DynamicBitset::size_type k = 0; k < pb_degree; ++k)
+    {
+      term ^= pb.test(k) & v[r + k - pb_degree];
+    }
+    v[r] = term;
+  }
+}
+
+} // namespace nb2
+
+template<typename UIntType, unsigned w, typename Nb2Table>
+struct niederreiter_base2_lattice
+{
+  typedef UIntType value_type;
+
+  BOOST_STATIC_ASSERT(w > 0u);
+  BOOST_STATIC_CONSTANT(unsigned, bit_count = w);
+
+private:
+  typedef std::vector<value_type> container_type;
+
+public:
+  explicit niederreiter_base2_lattice(std::size_t dimension)
+  {
+    resize(dimension);
+  }
+
+  void resize(std::size_t dimension)
+  {
+    typedef boost::dynamic_bitset<> bitset_type;
+
+    dimension_assert("Niederreiter base 2", dimension, Nb2Table::max_dimension);
+
+    // Initialize the bit array
+    container_type cj(bit_count * dimension);
+
+    // Reserve temporary space for lattice computation
+    bitset_type v, pb, tmp;
+
+    // Compute Niedderreiter base 2 lattice
+    for (std::size_t dim = 0; dim != dimension; ++dim)
+    {
+      const typename Nb2Table::value_type poly = Nb2Table::polynomial(dim);
+      if (poly > (std::numeric_limits<value_type>::max)()) {
+        boost::throw_exception( std::range_error("niederreiter_base2: polynomial value outside the given value type range") );
+      }
+
+      const unsigned degree = qrng_detail::msb(poly); // integer log2(poly)
+      const unsigned space_required = degree * ((bit_count / degree) + 1); // ~ degree + bit_count
+
+      v.resize(degree + bit_count - 1);
+
+      // For each dimension, we need to calculate powers of an
+      // appropriate irreducible polynomial, see Niederreiter
+      // page 65, just below equation (19).
+      // Copy the appropriate irreducible polynomial into PX,
+      // and its degree into E. Set polynomial B = PX ** 0 = 1.
+      // M is the degree of B. Subsequently B will hold higher
+      // powers of PX.
+      pb.resize(space_required); tmp.resize(space_required);
+
+      typename bitset_type::size_type kj, pb_degree = 0;
+      pb.reset(); // pb == 0
+      pb.set(pb_degree); // set the proper bit for the pb_degree
+
+      value_type j = high_bit_mask_t<bit_count - 1>::high_bit;
+      do
+      {
+        // Now choose a value of Kj as defined in section 3.3.
+        // We must have 0 <= Kj < E*J = M.
+        // The limit condition on Kj does not seem to be very relevant
+        // in this program.
+        kj = pb_degree;
+
+        // Now multiply B by PX so B becomes PX**J.
+        // In section 2.3, the values of Bi are defined with a minus sign :
+        // don't forget this if you use them later!
+        nb2::modulo2_multiply(poly, pb, tmp);
+        pb_degree += degree;
+        if (pb_degree >= pb.size()) {
+          // Note that it is quite possible for kj to become bigger than
+          // the new computed value of pb_degree.
+          pb_degree = nb2::bitset_log2(pb);
+        }
+
+        // If U = 0, we need to set B to the next power of PX
+        // and recalculate V.
+        nb2::calculate_v(pb, kj, pb_degree, v);
+
+        // Niederreiter (page 56, after equation (7), defines two
+        // variables Q and U.  We do not need Q explicitly, but we
+        // do need U.
+
+        // Advance Niederreiter's state variables.
+        for (unsigned u = 0; j && u != degree; ++u, j >>= 1)
+        {
+          // Now C is obtained from V. Niederreiter
+          // obtains A from V (page 65, near the bottom), and then gets
+          // C from A (page 56, equation (7)).  However this can be done
+          // in one step.  Here CI(J,R) corresponds to
+          // Niederreiter's C(I,J,R), whose values we pack into array
+          // CJ so that CJ(I,R) holds all the values of C(I,J,R) for J from 1 to NBITS.
+          for (unsigned r = 0; r != bit_count; ++r) {
+            value_type& num = cj[dimension * r + dim];
+            // set the jth bit in num
+            num = (num & ~j) | (-v[r + u] & j);
+          }
+        }
+      } while (j != 0);
+    }
+
+    bits.swap(cj);
+  }
+
+  typename container_type::const_iterator iter_at(std::size_t n) const
+  {
+    BOOST_ASSERT(!(n > bits.size()));
+    return bits.begin() + n;
+  }
+
+private:
+  container_type bits;
+};
+
+} // namespace qrng_detail
+
+typedef detail::qrng_tables::niederreiter_base2 default_niederreiter_base2_table;
+
+/** @endcond */
+
+//!Instantiations of class template niederreiter_base2_engine model a \quasi_random_number_generator.
+//!The niederreiter_base2_engine uses the algorithm described in
+//! \blockquote
+//!Bratley, Fox, Niederreiter, ACM Trans. Model. Comp. Sim. 2, 195 (1992).
+//! \endblockquote
+//!
+//!\attention niederreiter_base2_engine skips trivial zeroes at the start of the sequence. For example,
+//!the beginning of the 2-dimensional Niederreiter base 2 sequence in @c uniform_01 distribution will look
+//!like this:
+//!\code{.cpp}
+//!0.5, 0.5,
+//!0.75, 0.25,
+//!0.25, 0.75,
+//!0.375, 0.375,
+//!0.875, 0.875,
+//!...
+//!\endcode
+//!
+//!In the following documentation @c X denotes the concrete class of the template
+//!niederreiter_base2_engine returning objects of type @c UIntType, u and v are the values of @c X.
+//!
+//!Some member functions may throw exceptions of type std::range_error. This
+//!happens when the quasi-random domain is exhausted and the generator cannot produce
+//!any more values. The length of the low discrepancy sequence is given by
+//! \f$L=Dimension \times (2^{w} - 1)\f$.
+template<typename UIntType, unsigned w, typename Nb2Table = default_niederreiter_base2_table>
+class niederreiter_base2_engine
+  : public qrng_detail::gray_coded_qrng<
+      qrng_detail::niederreiter_base2_lattice<UIntType, w, Nb2Table>
+    >
+{
+  typedef qrng_detail::niederreiter_base2_lattice<UIntType, w, Nb2Table> lattice_t;
+  typedef qrng_detail::gray_coded_qrng<lattice_t> base_t;
+
+public:
+  //!Effects: Constructs the default `s`-dimensional Niederreiter base 2 quasi-random number generator.
+  //!
+  //!Throws: bad_alloc, invalid_argument, range_error.
+  explicit niederreiter_base2_engine(std::size_t s)
+    : base_t(s) // initialize lattice here
+  {}
+
+#ifdef BOOST_RANDOM_DOXYGEN
+  //=========================Doxygen needs this!==============================
+  typedef UIntType result_type;
+
+  //!Returns: Tight lower bound on the set of values returned by operator().
+  //!
+  //!Throws: nothing.
+  static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
+  { return (base_t::min)(); }
+
+  //!Returns: Tight upper bound on the set of values returned by operator().
+  //!
+  //!Throws: nothing.
+  static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+  { return (base_t::max)(); }
+
+  //!Returns: The dimension of of the quasi-random domain.
+  //!
+  //!Throws: nothing.
+  std::size_t dimension() const { return base_t::dimension(); }
+
+  //!Effects: Resets the quasi-random number generator state to
+  //!the one given by the default construction. Equivalent to u.seed(0).
+  //!
+  //!\brief Throws: nothing.
+  void seed()
+  {
+    base_t::seed();
+  }
+
+  //!Effects: Effectively sets the quasi-random number generator state to the `init`-th
+  //!vector in the `s`-dimensional quasi-random domain, where `s` == X::dimension().
+  //!\code
+  //!X u, v;
+  //!for(int i = 0; i < N; ++i)
+  //!    for( std::size_t j = 0; j < u.dimension(); ++j )
+  //!        u();
+  //!v.seed(N);
+  //!assert(u() == v());
+  //!\endcode
+  //!
+  //!\brief Throws: range_error.
+  void seed(UIntType init)
+  {
+    base_t::seed(init);
+  }
+
+  //!Returns: Returns a successive element of an `s`-dimensional
+  //!(s = X::dimension()) vector at each invocation. When all elements are
+  //!exhausted, X::operator() begins anew with the starting element of a
+  //!subsequent `s`-dimensional vector.
+  //!
+  //!Throws: range_error.
+  result_type operator()()
+  {
+    return base_t::operator()();
+  }
+
+  //!Effects: Advances *this state as if `z` consecutive
+  //!X::operator() invocations were executed.
+  //!\code
+  //!X u = v;
+  //!for(int i = 0; i < N; ++i)
+  //!    u();
+  //!v.discard(N);
+  //!assert(u() == v());
+  //!\endcode
+  //!
+  //!Throws: range_error.
+  void discard(boost::uintmax_t z)
+  {
+    base_t::discard(z);
+  }
+
+  //!Returns true if the two generators will produce identical sequences of outputs.
+  BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(niederreiter_base2_engine, x, y)
+  { return static_cast<const base_t&>(x) == y; }
+
+  //!Returns true if the two generators will produce different sequences of outputs.
+  BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(niederreiter_base2_engine)
+
+  //!Writes the textual representation of the generator to a @c std::ostream.
+  BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, niederreiter_base2_engine, s)
+  { return os << static_cast<const base_t&>(s); }
+
+  //!Reads the textual representation of the generator from a @c std::istream.
+  BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, niederreiter_base2_engine, s)
+  { return is >> static_cast<base_t&>(s); }
+
+#endif // BOOST_RANDOM_DOXYGEN
+};
+
+
+/**
+ * @attention This specialization of \niederreiter_base2_engine supports up to 4720 dimensions.
+ *
+ * Binary irreducible polynomials (primes in the ring `GF(2)[X]`, evaluated at `X=2`) were generated
+ * while condition `max(prime)` < 2<sup>16</sup> was satisfied.
+ *
+ * There are exactly 4720 such primes, which yields a Niederreiter base 2 table for 4720 dimensions.
+ *
+ * However, it is possible to provide your own table to \niederreiter_base2_engine should the default one be insufficient.
+ */
+typedef niederreiter_base2_engine<boost::uint_least64_t, 64u, default_niederreiter_base2_table> niederreiter_base2;
+
+} // namespace random
+
+} // namespace boost
+
+#endif // BOOST_RANDOM_NIEDERREITER_BASE2_HPP

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

@@ -93,9 +93,9 @@ public:
     BOOST_STATIC_CONSTANT(bool, has_fixed_range = false);
 
     /** Returns the smallest value that the \random_device 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 \random_device can produce. */
-    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return ~0u; }
+    static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return ~0u; }
 
     /** Constructs a @c random_device, optionally using the default device. */
     BOOST_RANDOM_DECL random_device();