passenger 5.1.12 → 5.2.0

data/src/cxx_supportlib/vendor-modified/boost/pointer_cast.hpp

@@ -0,0 +1,121 @@
+//////////////////////////////////////////////////////////////////////////////
+//
+// (C) Copyright Ion Gaztanaga 2005. 
+// 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_POINTER_CAST_HPP
+#define BOOST_POINTER_CAST_HPP
+
+#include <boost/config.hpp>
+
+namespace boost { 
+
+//static_pointer_cast overload for raw pointers
+template<class T, class U>
+inline T* static_pointer_cast(U *ptr)
+{  
+   return static_cast<T*>(ptr);
+}
+
+//dynamic_pointer_cast overload for raw pointers
+template<class T, class U>
+inline T* dynamic_pointer_cast(U *ptr)
+{  
+   return dynamic_cast<T*>(ptr);
+}
+
+//const_pointer_cast overload for raw pointers
+template<class T, class U>
+inline T* const_pointer_cast(U *ptr)
+{  
+   return const_cast<T*>(ptr);
+}
+
+//reinterpret_pointer_cast overload for raw pointers
+template<class T, class U>
+inline T* reinterpret_pointer_cast(U *ptr)
+{  
+   return reinterpret_cast<T*>(ptr);
+}
+
+} // namespace boost
+
+#if !defined( BOOST_NO_CXX11_SMART_PTR )
+
+#include <boost/type_traits/has_virtual_destructor.hpp>
+#include <boost/static_assert.hpp>
+#include <memory>
+
+namespace boost {
+
+//static_pointer_cast overload for std::shared_ptr
+using std::static_pointer_cast;
+
+//dynamic_pointer_cast overload for std::shared_ptr
+using std::dynamic_pointer_cast;
+
+//const_pointer_cast overload for std::shared_ptr
+using std::const_pointer_cast;
+
+//reinterpret_pointer_cast overload for std::shared_ptr
+template<class T, class U> std::shared_ptr<T> reinterpret_pointer_cast(const std::shared_ptr<U> & r ) BOOST_NOEXCEPT
+{
+    (void) reinterpret_cast< T* >( static_cast< U* >( 0 ) );
+
+    typedef typename std::shared_ptr<T>::element_type E;
+
+    E * p = reinterpret_cast< E* >( r.get() );
+    return std::shared_ptr<T>( r, p );
+}
+
+//static_pointer_cast overload for std::unique_ptr
+template<class T, class U> std::unique_ptr<T> static_pointer_cast( std::unique_ptr<U> && r ) BOOST_NOEXCEPT
+{
+    (void) static_cast< T* >( static_cast< U* >( 0 ) );
+
+    typedef typename std::unique_ptr<T>::element_type E;
+
+    return std::unique_ptr<T>( static_cast<E*>( r.release() ) );
+}
+
+//dynamic_pointer_cast overload for std::unique_ptr
+template<class T, class U> std::unique_ptr<T> dynamic_pointer_cast( std::unique_ptr<U> && r ) BOOST_NOEXCEPT
+{
+    (void) dynamic_cast< T* >( static_cast< U* >( 0 ) );
+
+    BOOST_STATIC_ASSERT_MSG( boost::has_virtual_destructor<T>::value, "The target of dynamic_pointer_cast must have a virtual destructor." );
+
+    T * p = dynamic_cast<T*>( r.get() );
+    if( p ) r.release();
+    return std::unique_ptr<T>( p );
+}
+
+//const_pointer_cast overload for std::unique_ptr
+template<class T, class U> std::unique_ptr<T> const_pointer_cast( std::unique_ptr<U> && r ) BOOST_NOEXCEPT
+{
+    (void) const_cast< T* >( static_cast< U* >( 0 ) );
+
+    typedef typename std::unique_ptr<T>::element_type E;
+
+    return std::unique_ptr<T>( const_cast<E*>( r.release() ) );
+}
+
+//reinterpret_pointer_cast overload for std::unique_ptr
+template<class T, class U> std::unique_ptr<T> reinterpret_pointer_cast( std::unique_ptr<U> && r ) BOOST_NOEXCEPT
+{
+    (void) reinterpret_cast< T* >( static_cast< U* >( 0 ) );
+
+    typedef typename std::unique_ptr<T>::element_type E;
+
+    return std::unique_ptr<T>( reinterpret_cast<E*>( r.release() ) );
+}
+
+} // namespace boost
+
+#endif // #if !defined( BOOST_NO_CXX11_SMART_PTR )
+
+#endif   //BOOST_POINTER_CAST_HPP

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

@@ -0,0 +1,91 @@
+/* boost random.hpp header file
+ *
+ * Copyright Jens Maurer 2000-2001
+ * 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/libs/random for documentation.
+ *
+ * $Id$
+ *
+ * Revision history
+ *  2000-02-18  portability fixes (thanks to Beman Dawes)
+ *  2000-02-21  shuffle_output, inversive_congruential_schrage,
+ *              generator_iterator, uniform_smallint
+ *  2000-02-23  generic modulus arithmetic helper, removed *_schrage classes,
+ *              implemented Streamable and EqualityComparable concepts for 
+ *              generators, added Bernoulli distribution and Box-Muller
+ *              transform
+ *  2000-03-01  cauchy, lognormal, triangle distributions; fixed 
+ *              uniform_smallint; renamed gaussian to normal distribution
+ *  2000-03-05  implemented iterator syntax for distribution functions
+ *  2000-04-21  removed some optimizations for better BCC/MSVC compatibility
+ *  2000-05-10  adapted to BCC and MSVC
+ *  2000-06-13  incorporated review results
+ *  2000-07-06  moved basic templates from namespace detail to random
+ *  2000-09-23  warning removals and int64 fixes (Ed Brey)
+ *  2000-09-24  added lagged_fibonacci generator (Matthias Troyer)
+ *  2001-02-18  moved to individual header files
+ */
+
+#ifndef BOOST_RANDOM_HPP
+#define BOOST_RANDOM_HPP
+
+// generators
+#include <boost/random/additive_combine.hpp>
+#include <boost/random/discard_block.hpp>
+#include <boost/random/independent_bits.hpp>
+#include <boost/random/inversive_congruential.hpp>
+#include <boost/random/lagged_fibonacci.hpp>
+#include <boost/random/linear_congruential.hpp>
+#include <boost/random/linear_feedback_shift.hpp>
+#include <boost/random/mersenne_twister.hpp>
+#include <boost/random/ranlux.hpp>
+#include <boost/random/shuffle_order.hpp>
+#include <boost/random/shuffle_output.hpp>
+#include <boost/random/subtract_with_carry.hpp>
+#include <boost/random/taus88.hpp>
+#include <boost/random/xor_combine.hpp>
+
+// misc
+#include <boost/random/generate_canonical.hpp>
+#include <boost/random/seed_seq.hpp>
+#include <boost/random/random_number_generator.hpp>
+#include <boost/random/variate_generator.hpp>
+
+// distributions
+#include <boost/random/bernoulli_distribution.hpp>
+#include <boost/random/beta_distribution.hpp>
+#include <boost/random/binomial_distribution.hpp>
+#include <boost/random/cauchy_distribution.hpp>
+#include <boost/random/chi_squared_distribution.hpp>
+#include <boost/random/discrete_distribution.hpp>
+#include <boost/random/exponential_distribution.hpp>
+#include <boost/random/extreme_value_distribution.hpp>
+#include <boost/random/fisher_f_distribution.hpp>
+#include <boost/random/gamma_distribution.hpp>
+#include <boost/random/geometric_distribution.hpp>
+#include <boost/random/hyperexponential_distribution.hpp>
+#include <boost/random/laplace_distribution.hpp>
+#include <boost/random/lognormal_distribution.hpp>
+#include <boost/random/negative_binomial_distribution.hpp>
+#include <boost/random/non_central_chi_squared_distribution.hpp>
+#include <boost/random/normal_distribution.hpp>
+#include <boost/random/piecewise_constant_distribution.hpp>
+#include <boost/random/piecewise_linear_distribution.hpp>
+#include <boost/random/poisson_distribution.hpp>
+#include <boost/random/student_t_distribution.hpp>
+#include <boost/random/triangle_distribution.hpp>
+#include <boost/random/uniform_01.hpp>
+#include <boost/random/uniform_int.hpp>
+#include <boost/random/uniform_int_distribution.hpp>
+#include <boost/random/uniform_on_sphere.hpp>
+#include <boost/random/uniform_real.hpp>
+#include <boost/random/uniform_real_distribution.hpp>
+#include <boost/random/uniform_smallint.hpp>
+#include <boost/random/weibull_distribution.hpp>
+
+#include <boost/random/generate_canonical.hpp>
+
+#endif // BOOST_RANDOM_HPP

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

@@ -0,0 +1,283 @@
+/* boost random/additive_combine.hpp header file
+ *
+ * Copyright Jens Maurer 2000-2001
+ * 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
+ *  2001-02-18  moved to individual header files
+ */
+
+#ifndef BOOST_RANDOM_ADDITIVE_COMBINE_HPP
+#define BOOST_RANDOM_ADDITIVE_COMBINE_HPP
+
+#include <istream>
+#include <iosfwd>
+#include <algorithm> // for std::min and std::max
+#include <boost/config.hpp>
+#include <boost/cstdint.hpp>
+#include <boost/random/detail/config.hpp>
+#include <boost/random/detail/operators.hpp>
+#include <boost/random/detail/seed.hpp>
+#include <boost/random/linear_congruential.hpp>
+
+namespace boost {
+namespace random {
+
+/**
+ * An instantiation of class template @c additive_combine_engine models a
+ * \pseudo_random_number_generator. It combines two multiplicative
+ * \linear_congruential_engine number generators, i.e. those with @c c = 0.
+ * It is described in
+ *
+ *  @blockquote
+ *  "Efficient and Portable Combined Random Number Generators", Pierre L'Ecuyer,
+ *  Communications of the ACM, Vol. 31, No. 6, June 1988, pp. 742-749, 774
+ *  @endblockquote
+ *
+ * The template parameters MLCG1 and MLCG2 shall denote two different
+ * \linear_congruential_engine number generators, each with c = 0. Each
+ * invocation returns a random number
+ * X(n) := (MLCG1(n) - MLCG2(n)) mod (m1 - 1),
+ * where m1 denotes the modulus of MLCG1. 
+ */
+template<class MLCG1, class MLCG2>
+class additive_combine_engine
+{
+public:
+    typedef MLCG1 first_base;
+    typedef MLCG2 second_base;
+    typedef typename MLCG1::result_type result_type;
+
+    // Required by old Boost.Random concept
+    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 ()
+    { return 1; }
+    /**
+     * Returns the largest value that the generator can produce
+     */
+    static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION ()
+    { return MLCG1::modulus-1; }
+
+    /**
+     * Constructs an @c additive_combine_engine using the
+     * default constructors of the two base generators.
+     */
+    additive_combine_engine() : _mlcg1(), _mlcg2() { }
+    /**
+     * Constructs an @c additive_combine_engine, using seed as
+     * the constructor argument for both base generators.
+     */
+    BOOST_RANDOM_DETAIL_ARITHMETIC_CONSTRUCTOR(additive_combine_engine,
+        result_type, seed_arg)
+    {
+        _mlcg1.seed(seed_arg);
+        _mlcg2.seed(seed_arg);
+    }
+    /**
+     * Constructs an @c additive_combine_engine, using seq as
+     * the constructor argument for both base generators.
+     *
+     * @xmlwarning
+     * The semantics of this function are liable to change.
+     * A @c seed_seq is designed to generate all the seeds
+     * in one shot, but this seeds the two base engines
+     * independantly and probably ends up giving the same
+     * sequence to both.
+     * @endxmlwarning
+     */
+    BOOST_RANDOM_DETAIL_SEED_SEQ_CONSTRUCTOR(additive_combine_engine,
+        SeedSeq, seq)
+    {
+        _mlcg1.seed(seq);
+        _mlcg2.seed(seq);
+    }
+    /**
+     * Constructs an @c additive_combine_engine, using
+     * @c seed1 and @c seed2 as the constructor argument to
+     * the first and second base generators, respectively.
+     */
+    additive_combine_engine(typename MLCG1::result_type seed1, 
+                            typename MLCG2::result_type seed2)
+      : _mlcg1(seed1), _mlcg2(seed2) { }
+    /**
+     * Contructs an @c additive_combine_engine with
+     * values from the range defined by the input iterators first
+     * and last.  first will be modified to point to the element
+     * after the last one used.
+     *
+     * Throws: @c std::invalid_argument if the input range is too small.
+     *
+     * Exception Safety: Basic
+     */
+    template<class It> additive_combine_engine(It& first, It last)
+      : _mlcg1(first, last), _mlcg2(first, last) { }
+
+    /**
+     * Seeds an @c additive_combine_engine using the default
+     * seeds of the two base generators.
+     */
+    void seed()
+    {
+        _mlcg1.seed();
+        _mlcg2.seed();
+    }
+
+    /**
+     * Seeds an @c additive_combine_engine, using @c seed as the
+     * seed for both base generators.
+     */
+    BOOST_RANDOM_DETAIL_ARITHMETIC_SEED(additive_combine_engine,
+        result_type, seed_arg)
+    {
+        _mlcg1.seed(seed_arg);
+        _mlcg2.seed(seed_arg);
+    }
+
+    /**
+     * Seeds an @c additive_combine_engine, using @c seq to
+     * seed both base generators.
+     *
+     * See the warning on the corresponding constructor.
+     */
+    BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(additive_combine_engine,
+        SeedSeq, seq)
+    {
+        _mlcg1.seed(seq);
+        _mlcg2.seed(seq);
+    }
+
+    /**
+     * Seeds an @c additive_combine generator, using @c seed1 and @c seed2 as
+     * the seeds to the first and second base generators, respectively.
+     */
+    void seed(typename MLCG1::result_type seed1,
+              typename MLCG2::result_type seed2)
+    {
+        _mlcg1.seed(seed1);
+        _mlcg2.seed(seed2);
+    }
+
+    /**
+     * Seeds an @c additive_combine_engine with
+     * values from the range defined by the input iterators first
+     * and last.  first will be modified to point to the element
+     * after the last one used.
+     *
+     * Throws: @c std::invalid_argument if the input range is too small.
+     *
+     * Exception Safety: Basic
+     */
+    template<class It> void seed(It& first, It last)
+    {
+        _mlcg1.seed(first, last);
+        _mlcg2.seed(first, last);
+    }
+
+    /** Returns the next value of the generator. */
+    result_type operator()() {
+        result_type val1 = _mlcg1();
+        result_type val2 = _mlcg2();
+        if(val2 < val1) return val1 - val2;
+        else return val1 - val2 + MLCG1::modulus - 1;
+    }
+  
+    /** Fills a range with random values */
+    template<class Iter>
+    void generate(Iter first, Iter last)
+    { detail::generate_from_int(*this, first, last); }
+
+    /** Advances the state of the generator by @c z. */
+    void discard(boost::uintmax_t z)
+    {
+        _mlcg1.discard(z);
+        _mlcg2.discard(z);
+    }
+
+    /**
+     * Writes the state of an @c additive_combine_engine to a @c
+     * std::ostream.  The textual representation of an @c
+     * additive_combine_engine is the textual representation of
+     * the first base generator followed by the textual representation
+     * of the second base generator.
+     */
+    BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, additive_combine_engine, r)
+    { os << r._mlcg1 << ' ' << r._mlcg2; return os; }
+
+    /**
+     * Reads the state of an @c additive_combine_engine from a
+     * @c std::istream.
+     */
+    BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, additive_combine_engine, r)
+    { is >> r._mlcg1 >> std::ws >> r._mlcg2; return is; }
+
+    /**
+     * Returns: true iff the two @c additive_combine_engines will
+     * produce the same sequence of values.
+     */
+    BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(additive_combine_engine, x, y)
+    { return x._mlcg1 == y._mlcg1 && x._mlcg2 == y._mlcg2; }
+    /**
+     * Returns: true iff the two @c additive_combine_engines will
+     * produce different sequences of values.
+     */
+    BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(additive_combine_engine)
+
+private:
+    MLCG1 _mlcg1;
+    MLCG2 _mlcg2;
+};
+
+#ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION
+template<class MLCG1, class MLCG2>
+const bool additive_combine_engine<MLCG1, MLCG2>::has_fixed_range;
+#endif
+
+/// \cond show_deprecated
+
+/** Provided for backwards compatibility. */
+template<class MLCG1, class MLCG2, typename MLCG1::result_type val = 0>
+class additive_combine : public additive_combine_engine<MLCG1, MLCG2>
+{
+    typedef additive_combine_engine<MLCG1, MLCG2> base_t;
+public:
+    typedef typename base_t::result_type result_type;
+    additive_combine() {}
+    template<class T>
+    additive_combine(T& arg) : base_t(arg) {}
+    template<class T>
+    additive_combine(const T& arg) : base_t(arg) {}
+    template<class It>
+    additive_combine(It& first, It last) : base_t(first, last) {}
+};
+
+/// \endcond
+
+/**
+ * The specialization \ecuyer1988 was suggested in
+ *
+ *  @blockquote
+ *  "Efficient and Portable Combined Random Number Generators", Pierre L'Ecuyer,
+ *  Communications of the ACM, Vol. 31, No. 6, June 1988, pp. 742-749, 774
+ *  @endblockquote
+ */
+typedef additive_combine_engine<
+    linear_congruential_engine<uint32_t, 40014, 0, 2147483563>,
+    linear_congruential_engine<uint32_t, 40692, 0, 2147483399>
+> ecuyer1988;
+
+} // namespace random
+
+using random::ecuyer1988;
+
+} // namespace boost
+
+#endif // BOOST_RANDOM_ADDITIVE_COMBINE_HPP