passenger 6.0.1 → 6.0.6

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

@@ -0,0 +1,237 @@
+/* boost random/sobol.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_SOBOL_HPP
+#define BOOST_RANDOM_SOBOL_HPP
+
+#include <boost/random/detail/sobol_table.hpp>
+#include <boost/random/detail/gray_coded_qrng.hpp>
+
+namespace boost {
+namespace random {
+
+/** @cond */
+namespace qrng_detail {
+
+// sobol_lattice sets up the random-number generator to produce a Sobol
+// sequence of at most max dims-dimensional quasi-random vectors.
+// Adapted from ACM TOMS algorithm 659, see
+
+// http://doi.acm.org/10.1145/42288.214372
+
+template<typename UIntType, unsigned w, typename SobolTables>
+struct sobol_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 sobol_lattice(std::size_t dimension)
+  {
+    resize(dimension);
+  }
+
+  // default copy c-tor is fine
+
+  void resize(std::size_t dimension)
+  {
+    dimension_assert("Sobol", dimension, SobolTables::max_dimension);
+
+    // Initialize the bit array
+    container_type cj(bit_count * dimension);
+
+    // Initialize direction table in dimension 0
+    for (unsigned k = 0; k != bit_count; ++k)
+      cj[dimension*k] = static_cast<value_type>(1);
+
+    // Initialize in remaining dimensions.
+    for (std::size_t dim = 1; dim < dimension; ++dim)
+    {
+      const typename SobolTables::value_type poly = SobolTables::polynomial(dim-1);
+      if (poly > std::numeric_limits<value_type>::max()) {
+        boost::throw_exception( std::range_error("sobol: polynomial value outside the given value type range") );
+      }
+      const unsigned degree = multiprecision::msb(poly); // integer log2(poly)
+
+      // set initial values of m from table
+      for (unsigned k = 0; k != degree; ++k)
+        cj[dimension*k + dim] = SobolTables::minit(dim-1, k);
+
+      // Calculate remaining elements for this dimension,
+      // as explained in Bratley+Fox, section 2.
+      for (unsigned j = degree; j < bit_count; ++j)
+      {
+        typename SobolTables::value_type p_i = poly;
+        const std::size_t bit_offset = dimension*j + dim;
+
+        cj[bit_offset] = cj[dimension*(j-degree) + dim];
+        for (unsigned k = 0; k != degree; ++k, p_i >>= 1)
+        {
+          int rem = degree - k;
+          cj[bit_offset] ^= ((p_i & 1) * cj[dimension*(j-rem) + dim]) << rem;
+        }
+      }
+    }
+
+    // Shift columns by appropriate power of 2.
+    unsigned p = 1u;
+    for (int j = bit_count-1-1; j >= 0; --j, ++p)
+    {
+      const std::size_t bit_offset = dimension * j;
+      for (std::size_t dim = 0; dim != dimension; ++dim)
+        cj[bit_offset + dim] <<= p;
+    }
+
+    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::sobol default_sobol_table;
+
+/** @endcond */
+
+//!Instantiations of class template sobol_engine model a \quasi_random_number_generator.
+//!The sobol_engine uses the algorithm described in
+//! \blockquote
+//![Bratley+Fox, TOMS 14, 88 (1988)]
+//!and [Antonov+Saleev, USSR Comput. Maths. Math. Phys. 19, 252 (1980)]
+//! \endblockquote
+//!
+//!\attention sobol_engine skips trivial zeroes at the start of the sequence. For example, the beginning
+//!of the 2-dimensional Sobol 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
+//!sobol_engine returning objects of type @c UIntType, u and v are the values of @c X.
+//!
+//!Some member functions may throw exceptions of type @c 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 SobolTables = default_sobol_table>
+class sobol_engine
+  : public qrng_detail::gray_coded_qrng<
+      qrng_detail::sobol_lattice<UIntType, w, SobolTables>
+    >
+{
+  typedef qrng_detail::sobol_lattice<UIntType, w, SobolTables> lattice_t;
+  typedef qrng_detail::gray_coded_qrng<lattice_t> base_t;
+
+public:
+  //!Effects: Constructs the default `s`-dimensional Sobol quasi-random number generator.
+  //!
+  //!Throws: bad_alloc, invalid_argument, range_error.
+  explicit sobol_engine(std::size_t s)
+    : base_t(s)
+  {}
+
+  // default copy c-tor is fine
+
+#ifdef BOOST_RANDOM_DOXYGEN
+  //=========================Doxygen needs this!==============================
+  typedef UIntType result_type;
+
+  /** @copydoc boost::random::niederreiter_base2_engine::min() */
+  static BOOST_CONSTEXPR result_type min BOOST_PREVENT_MACRO_SUBSTITUTION ()
+  { return (base_t::min)(); }
+
+  /** @copydoc boost::random::niederreiter_base2_engine::max() */
+  static BOOST_CONSTEXPR result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+  { return (base_t::max)(); }
+
+  /** @copydoc boost::random::niederreiter_base2_engine::dimension() */
+  std::size_t dimension() const { return base_t::dimension(); }
+
+  /** @copydoc boost::random::niederreiter_base2_engine::seed() */
+  void seed()
+  {
+    base_t::seed();
+  }
+
+  /** @copydoc boost::random::niederreiter_base2_engine::seed(UIntType) */
+  void seed(UIntType init)
+  {
+    base_t::seed(init);
+  }
+
+  /** @copydoc boost::random::niederreiter_base2_engine::operator()() */
+  result_type operator()()
+  {
+    return base_t::operator()();
+  }
+
+  /** @copydoc boost::random::niederreiter_base2_engine::discard(boost::uintmax_t) */
+  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(sobol_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(sobol_engine)
+
+  /** Writes the textual representation of the generator to a @c std::ostream. */
+  BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, sobol_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, sobol_engine, s)
+  { return is >> static_cast<base_t&>(s); }
+
+#endif // BOOST_RANDOM_DOXYGEN
+};
+
+/**
+ * @attention This specialization of \sobol_engine supports up to 3667 dimensions.
+ *
+ * Data on the primitive binary polynomials `a` and the corresponding starting values `m`
+ * for Sobol sequences in up to 21201 dimensions was taken from
+ *
+ *  @blockquote
+ *  S. Joe and F. Y. Kuo, Constructing Sobol sequences with better two-dimensional projections,
+ *  SIAM J. Sci. Comput. 30, 2635-2654 (2008).
+ *  @endblockquote
+ *
+ * See the original tables up to dimension 21201: https://web.archive.org/web/20170802022909/http://web.maths.unsw.edu.au/~fkuo/sobol/new-joe-kuo-6.21201
+ *
+ * For practical reasons the default table uses only the subset of binary polynomials `a` < 2<sup>16</sup>.
+ *
+ * However, it is possible to provide your own table to \sobol_engine should the default one be insufficient.
+ */
+typedef sobol_engine<boost::uint_least64_t, 64u, default_sobol_table> sobol;
+
+} // namespace random
+
+} // namespace boost
+
+#endif // BOOST_RANDOM_SOBOL_HPP

data/src/cxx_supportlib/vendor-modified/boost/range/as_literal.hpp

@@ -25,6 +25,11 @@
 #include <boost/detail/workaround.hpp>
 
 #include <cstring>
+
+#if !defined(BOOST_NO_CXX11_CHAR16_T) || !defined(BOOST_NO_CXX11_CHAR32_T)
+#include <string>  // for std::char_traits
+#endif
+
 #ifndef BOOST_NO_CWCHAR
 #include <cwchar>
 #endif
@@ -38,6 +43,20 @@ namespace boost
             return strlen( s );
         }
 
+#ifndef BOOST_NO_CXX11_CHAR16_T
+        inline std::size_t length( const char16_t* s )
+        {
+            return std::char_traits<char16_t>::length( s );
+        }
+#endif
+
+#ifndef BOOST_NO_CXX11_CHAR32_T
+        inline std::size_t length( const char32_t* s )
+        {
+            return std::char_traits<char32_t>::length( s );
+        }
+#endif
+
 #ifndef BOOST_NO_CWCHAR
         inline std::size_t length( const wchar_t* s )
         {
@@ -61,6 +80,30 @@ namespace boost
             return true;
         }
 
+#ifndef BOOST_NO_CXX11_CHAR16_T
+        inline bool is_char_ptr( char16_t* )
+        {
+            return true;
+        }
+
+        inline bool is_char_ptr( const char16_t* )
+        {
+            return true;
+        }
+#endif
+
+#ifndef BOOST_NO_CXX11_CHAR32_T
+        inline bool is_char_ptr( char32_t* )
+        {
+            return true;
+        }
+
+        inline bool is_char_ptr( const char32_t* )
+        {
+            return true;
+        }
+#endif
+
 #ifndef BOOST_NO_CWCHAR
         inline bool is_char_ptr( wchar_t* )
         {

data/src/cxx_supportlib/vendor-modified/boost/range/begin.hpp

@@ -22,6 +22,8 @@
 #else
 
 #include <boost/range/iterator.hpp>
+#include <boost/config.hpp>
+#include <boost/config/workaround.hpp>
 
 namespace boost
 {
@@ -36,7 +38,7 @@ namespace range_detail
     //////////////////////////////////////////////////////////////////////
 
     template< typename C >
-    inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
+    BOOST_CONSTEXPR inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
     range_begin( C& c )
     {
         //
@@ -52,13 +54,13 @@ namespace range_detail
     //////////////////////////////////////////////////////////////////////
 
     template< typename Iterator >
-    inline Iterator range_begin( const std::pair<Iterator,Iterator>& p )
+    BOOST_CONSTEXPR inline Iterator range_begin( const std::pair<Iterator,Iterator>& p )
     {
         return p.first;
     }
 
     template< typename Iterator >
-    inline Iterator range_begin( std::pair<Iterator,Iterator>& p )
+    BOOST_CONSTEXPR inline Iterator range_begin( std::pair<Iterator,Iterator>& p )
     {
         return p.first;
     }
@@ -71,13 +73,13 @@ namespace range_detail
     // May this be discarded? Or is it needed for bad compilers?
     //
     template< typename T, std::size_t sz >
-    inline const T* range_begin( const T (&a)[sz] )
+    BOOST_CONSTEXPR inline const T* range_begin( const T (&a)[sz] ) BOOST_NOEXCEPT
     {
         return a;
     }
 
     template< typename T, std::size_t sz >
-    inline T* range_begin( T (&a)[sz] )
+    BOOST_CONSTEXPR inline T* range_begin( T (&a)[sz] ) BOOST_NOEXCEPT
     {
         return a;
     }
@@ -94,6 +96,9 @@ namespace range_adl_barrier
 {
 
 template< class T >
+#if !BOOST_WORKAROUND(BOOST_GCC, < 40700)
+BOOST_CONSTEXPR
+#endif
 inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type begin( T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
@@ -103,6 +108,9 @@ inline BOOST_DEDUCED_TYPENAME range_iterator::type begin( T& r )
 }
 
 template< class T >
+#if !BOOST_WORKAROUND(BOOST_GCC, < 40700)
+BOOST_CONSTEXPR
+#endif
 inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type begin( const T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))

data/src/cxx_supportlib/vendor-modified/boost/range/concepts.hpp

@@ -252,7 +252,7 @@ namespace boost {
                  n = i - j;
              }
          private:
-             BOOST_DEDUCED_TYPENAME RandomAccessIteratorConcept::difference_type n;
+             BOOST_DEDUCED_TYPENAME BidirectionalIteratorConcept<Iterator>::difference_type n;
              Iterator i;
              Iterator j;
  #endif

data/src/cxx_supportlib/vendor-modified/boost/range/detail/common.hpp

@@ -18,10 +18,8 @@
 #include <boost/range/config.hpp>
 #include <boost/range/detail/sfinae.hpp>
 #include <boost/type_traits/is_void.hpp>
-#include <boost/mpl/bool.hpp>
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/int.hpp>
-#include <boost/mpl/or.hpp>
 #include <cstddef>
 
 //////////////////////////////////////////////////////////////////////////////
@@ -71,7 +69,7 @@ namespace boost
             BOOST_STATIC_CONSTANT( bool, is_const_wchar_t_ptr_   = sizeof( boost::range_detail::is_const_wchar_t_ptr_impl( ptr ) ) == sizeof( yes_type ) );
             BOOST_STATIC_CONSTANT( bool, is_char_array_          = sizeof( boost::range_detail::is_char_array_impl( ptr ) ) == sizeof( yes_type ) );
             BOOST_STATIC_CONSTANT( bool, is_wchar_t_array_       = sizeof( boost::range_detail::is_wchar_t_array_impl( ptr ) ) == sizeof( yes_type ) );
-            BOOST_STATIC_CONSTANT( bool, is_string_              = (boost::mpl::or_<boost::mpl::bool_<is_const_char_ptr_>, boost::mpl::bool_<is_const_wchar_t_ptr_> >::value ));
+            BOOST_STATIC_CONSTANT( bool, is_string_              = (is_const_char_ptr_ || is_const_wchar_t_ptr_));
             BOOST_STATIC_CONSTANT( bool, is_array_               = boost::is_array<C>::value );
             
         };

data/src/cxx_supportlib/vendor-modified/boost/range/detail/implementation_help.hpp

@@ -60,13 +60,13 @@ namespace boost
         }
 
         template< class T, std::size_t sz >
-        inline T* array_end( T BOOST_RANGE_ARRAY_REF()[sz] )
+        BOOST_CONSTEXPR inline T* array_end( T BOOST_RANGE_ARRAY_REF()[sz] ) BOOST_NOEXCEPT
         {
             return boost_range_array + sz;
         }
 
         template< class T, std::size_t sz >
-        inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz] )
+        BOOST_CONSTEXPR inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz] ) BOOST_NOEXCEPT
         {
             return boost_range_array + sz;
         }

data/src/cxx_supportlib/vendor-modified/boost/range/distance.hpp

@@ -15,20 +15,26 @@
 # pragma once
 #endif
 
+#include <boost/iterator/distance.hpp>
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
 #include <boost/range/difference_type.hpp>
 
-namespace boost 
+namespace boost
 {
 
-    template< class T >
-    inline BOOST_DEDUCED_TYPENAME range_difference<T>::type 
-    distance( const T& r )
+    namespace range_distance_adl_barrier
     {
-        return std::distance( boost::begin( r ), boost::end( r ) );
+        template< class T >
+        inline BOOST_CXX14_CONSTEXPR BOOST_DEDUCED_TYPENAME range_difference<T>::type
+        distance( const T& r )
+        {
+            return boost::iterators::distance( boost::begin( r ), boost::end( r ) );
+        }
     }
 
+    using namespace range_distance_adl_barrier;
+
 } // namespace 'boost'
 
 #endif

data/src/cxx_supportlib/vendor-modified/boost/range/end.hpp

@@ -24,6 +24,8 @@
 #include <boost/range/detail/implementation_help.hpp>
 #include <boost/range/iterator.hpp>
 #include <boost/range/const_iterator.hpp>
+#include <boost/config.hpp>
+#include <boost/config/workaround.hpp>
 
 namespace boost
 {
@@ -37,7 +39,7 @@ namespace range_detail
         // primary template
         //////////////////////////////////////////////////////////////////////
         template< typename C >
-        inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
+        BOOST_CONSTEXPR inline BOOST_DEDUCED_TYPENAME range_iterator<C>::type
         range_end( C& c )
         {
             //
@@ -53,13 +55,13 @@ namespace range_detail
         //////////////////////////////////////////////////////////////////////
 
         template< typename Iterator >
-        inline Iterator range_end( const std::pair<Iterator,Iterator>& p )
+        BOOST_CONSTEXPR inline Iterator range_end( const std::pair<Iterator,Iterator>& p )
         {
             return p.second;
         }
 
         template< typename Iterator >
-        inline Iterator range_end( std::pair<Iterator,Iterator>& p )
+        BOOST_CONSTEXPR inline Iterator range_end( std::pair<Iterator,Iterator>& p )
         {
             return p.second;
         }
@@ -69,13 +71,13 @@ namespace range_detail
         //////////////////////////////////////////////////////////////////////
 
         template< typename T, std::size_t sz >
-        inline const T* range_end( const T (&a)[sz] )
+        BOOST_CONSTEXPR inline const T* range_end( const T (&a)[sz] ) BOOST_NOEXCEPT
         {
             return range_detail::array_end<T,sz>( a );
         }
 
         template< typename T, std::size_t sz >
-        inline T* range_end( T (&a)[sz] )
+        BOOST_CONSTEXPR inline T* range_end( T (&a)[sz] ) BOOST_NOEXCEPT
         {
             return range_detail::array_end<T,sz>( a );
         }
@@ -88,6 +90,9 @@ namespace range_adl_barrier
 {
 
 template< class T >
+#if !BOOST_WORKAROUND(BOOST_GCC, < 40700)
+BOOST_CONSTEXPR
+#endif
 inline BOOST_DEDUCED_TYPENAME range_iterator<T>::type end( T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
@@ -97,6 +102,9 @@ inline BOOST_DEDUCED_TYPENAME range_iterator::type end( T& r )
 }
 
 template< class T >
+#if !BOOST_WORKAROUND(BOOST_GCC, < 40700)
+BOOST_CONSTEXPR
+#endif
 inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type end( const T& r )
 {
 #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564))
@@ -115,7 +123,7 @@ namespace boost
     namespace range_adl_barrier
     {
         template< class T >
-        inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
+        BOOST_CONSTEXPR inline BOOST_DEDUCED_TYPENAME range_iterator<const T>::type
         const_end( const T& r )
         {
             return boost::range_adl_barrier::end( r );