Gecko [ www.foryou-vip.com ]

Name	Size	Permission	Date
algorithmfwd.h	21.03 KB	-rwxrwxrwx	2018-02-14 17:53
alloc_traits.h	19.13 KB	-rwxrwxrwx	2018-02-14 17:53
allocated_ptr.h	3.42 KB	-rwxrwxrwx	2018-02-14 17:53
allocator.h	6.76 KB	-rwxrwxrwx	2018-02-14 17:53
atomic_base.h	23.41 KB	-rwxrwxrwx	2018-02-14 17:53
atomic_futex.h	9.35 KB	-rwxrwxrwx	2018-02-14 17:53
atomic_lockfree_defines.h	2.2 KB	-rwxrwxrwx	2018-02-14 17:53
basic_ios.h	15.7 KB	-rwxrwxrwx	2018-02-14 17:53
basic_ios.tcc	5.89 KB	-rwxrwxrwx	2018-02-14 17:53
basic_string.h	203.81 KB	-rwxrwxrwx	2018-02-14 17:53
basic_string.tcc	50.58 KB	-rwxrwxrwx	2018-02-14 17:53
boost_concept_check.h	26.41 KB	-rwxrwxrwx	2018-02-14 17:53
c++0x_warning.h	1.44 KB	-rwxrwxrwx	2018-02-14 17:53
c++14_warning.h	1.48 KB	-rwxrwxrwx	2018-02-14 17:53
char_traits.h	17.56 KB	-rwxrwxrwx	2018-02-14 17:53
codecvt.h	20.8 KB	-rwxrwxrwx	2018-02-14 17:53
concept_check.h	3.34 KB	-rwxrwxrwx	2018-02-14 17:53
cpp_type_traits.h	9.37 KB	-rwxrwxrwx	2018-02-14 17:53
cxxabi_forced.h	1.77 KB	-rwxrwxrwx	2018-02-14 17:53
deque.tcc	32.89 KB	-rwxrwxrwx	2018-02-14 17:53
enable_special_members.h	10.87 KB	-rwxrwxrwx	2018-02-14 17:53
exception_defines.h	1.61 KB	-rwxrwxrwx	2018-02-14 17:53
exception_ptr.h	5.6 KB	-rwxrwxrwx	2018-02-14 17:53
forward_list.h	47.46 KB	-rwxrwxrwx	2018-02-14 17:53
forward_list.tcc	14.74 KB	-rwxrwxrwx	2018-02-14 17:53
fstream.tcc	32.1 KB	-rwxrwxrwx	2018-02-14 17:53
functexcept.h	3.18 KB	-rwxrwxrwx	2018-02-14 17:53
functional_hash.h	7.49 KB	-rwxrwxrwx	2018-02-14 17:53
gslice.h	5.39 KB	-rwxrwxrwx	2018-02-14 17:53
gslice_array.h	7.59 KB	-rwxrwxrwx	2018-02-14 17:53
hash_bytes.h	2.1 KB	-rwxrwxrwx	2018-02-14 17:53
hashtable.h	67.52 KB	-rwxrwxrwx	2018-02-14 17:53
hashtable_policy.h	62.54 KB	-rwxrwxrwx	2018-02-14 17:53
indirect_array.h	7.68 KB	-rwxrwxrwx	2018-02-14 17:53
ios_base.h	30.22 KB	-rwxrwxrwx	2018-02-14 17:53
istream.tcc	30.21 KB	-rwxrwxrwx	2018-02-14 17:53
list.tcc	15.1 KB	-rwxrwxrwx	2018-02-14 17:53
locale_classes.h	24.31 KB	-rwxrwxrwx	2018-02-14 17:53
locale_classes.tcc	8.18 KB	-rwxrwxrwx	2018-02-14 17:53
locale_conv.h	15.69 KB	-rwxrwxrwx	2018-02-14 17:53
locale_facets.h	89.93 KB	-rwxrwxrwx	2018-02-14 17:53
locale_facets.tcc	38.64 KB	-rwxrwxrwx	2018-02-14 17:53
locale_facets_nonio.h	67.33 KB	-rwxrwxrwx	2018-02-14 17:53
locale_facets_nonio.tcc	44.08 KB	-rwxrwxrwx	2018-02-14 17:53
localefwd.h	5.51 KB	-rwxrwxrwx	2018-02-14 17:53
mask_array.h	7.42 KB	-rwxrwxrwx	2018-02-14 17:53
memoryfwd.h	2.36 KB	-rwxrwxrwx	2018-02-14 17:53
move.h	6.19 KB	-rwxrwxrwx	2018-02-14 17:53
nested_exception.h	4.82 KB	-rwxrwxrwx	2018-02-14 17:53
ostream.tcc	12.03 KB	-rwxrwxrwx	2018-02-14 17:53
ostream_insert.h	3.91 KB	-rwxrwxrwx	2018-02-14 17:53
parse_numbers.h	7.58 KB	-rwxrwxrwx	2018-02-14 17:53
postypes.h	8.02 KB	-rwxrwxrwx	2018-02-14 17:53
predefined_ops.h	7.78 KB	-rwxrwxrwx	2018-02-14 17:53
ptr_traits.h	4.75 KB	-rwxrwxrwx	2018-02-14 17:53
quoted_string.h	4.47 KB	-rwxrwxrwx	2018-02-14 17:53
random.h	169.29 KB	-rwxrwxrwx	2018-02-14 17:53
random.tcc	103.07 KB	-rwxrwxrwx	2018-02-14 17:53
range_access.h	9.32 KB	-rwxrwxrwx	2018-02-14 17:53
regex.h	94.62 KB	-rwxrwxrwx	2018-02-14 17:53
regex.tcc	16.09 KB	-rwxrwxrwx	2018-02-14 17:53
regex_automaton.h	10.43 KB	-rwxrwxrwx	2018-02-14 17:53
regex_automaton.tcc	7.65 KB	-rwxrwxrwx	2018-02-14 17:53
regex_compiler.h	14.42 KB	-rwxrwxrwx	2018-02-14 17:53
regex_compiler.tcc	17.97 KB	-rwxrwxrwx	2018-02-14 17:53
regex_constants.h	13.93 KB	-rwxrwxrwx	2018-02-14 17:53
regex_error.h	4.85 KB	-rwxrwxrwx	2018-02-14 17:53
regex_executor.h	6.61 KB	-rwxrwxrwx	2018-02-14 17:53
regex_executor.tcc	13.9 KB	-rwxrwxrwx	2018-02-14 17:53
regex_scanner.h	6.88 KB	-rwxrwxrwx	2018-02-14 17:53
regex_scanner.tcc	14.6 KB	-rwxrwxrwx	2018-02-14 17:53
shared_ptr.h	19.78 KB	-rwxrwxrwx	2018-02-14 17:53
shared_ptr_atomic.h	9.54 KB	-rwxrwxrwx	2018-02-14 17:53
shared_ptr_base.h	44.6 KB	-rwxrwxrwx	2018-02-14 17:53
slice_array.h	9.13 KB	-rwxrwxrwx	2018-02-14 17:53
specfun.h	44 KB	-rwxrwxrwx	2018-02-14 17:53
sstream.tcc	9.27 KB	-rwxrwxrwx	2018-02-14 17:53
std_mutex.h	9 KB	-rwxrwxrwx	2018-02-14 17:53
stl_algo.h	200.43 KB	-rwxrwxrwx	2018-02-14 17:53
stl_algobase.h	49.22 KB	-rwxrwxrwx	2018-02-14 17:53
stl_bvector.h	32.69 KB	-rwxrwxrwx	2018-02-14 17:53
stl_construct.h	5.05 KB	-rwxrwxrwx	2018-02-14 17:53
stl_deque.h	76.16 KB	-rwxrwxrwx	2018-02-14 17:53
stl_function.h	32.5 KB	-rwxrwxrwx	2018-02-14 17:53
stl_heap.h	18.75 KB	-rwxrwxrwx	2018-02-14 17:53
stl_iterator.h	39.39 KB	-rwxrwxrwx	2018-02-14 17:53
stl_iterator_base_funcs.h	7.69 KB	-rwxrwxrwx	2018-02-14 17:53
stl_iterator_base_types.h	8.45 KB	-rwxrwxrwx	2018-02-14 17:53
stl_list.h	64.03 KB	-rwxrwxrwx	2018-02-14 17:53
stl_map.h	49.45 KB	-rwxrwxrwx	2018-02-14 17:53
stl_multimap.h	37.09 KB	-rwxrwxrwx	2018-02-14 17:53
stl_multiset.h	31.18 KB	-rwxrwxrwx	2018-02-14 17:53
stl_numeric.h	13.51 KB	-rwxrwxrwx	2018-02-14 17:53
stl_pair.h	17.18 KB	-rwxrwxrwx	2018-02-14 17:53
stl_queue.h	20.26 KB	-rwxrwxrwx	2018-02-14 17:53
stl_raw_storage_iter.h	3.74 KB	-rwxrwxrwx	2018-02-14 17:53
stl_relops.h	4.49 KB	-rwxrwxrwx	2018-02-14 17:53
stl_set.h	31.43 KB	-rwxrwxrwx	2018-02-14 17:53
stl_stack.h	10.56 KB	-rwxrwxrwx	2018-02-14 17:53
stl_tempbuf.h	8.15 KB	-rwxrwxrwx	2018-02-14 17:53
stl_tree.h	67.86 KB	-rwxrwxrwx	2018-02-14 17:53
stl_uninitialized.h	21.38 KB	-rwxrwxrwx	2018-02-14 17:53
stl_vector.h	52.4 KB	-rwxrwxrwx	2018-02-14 17:53
stream_iterator.h	6.44 KB	-rwxrwxrwx	2018-02-14 17:53
streambuf.tcc	4.81 KB	-rwxrwxrwx	2018-02-14 17:53
streambuf_iterator.h	12.33 KB	-rwxrwxrwx	2018-02-14 17:53
stringfwd.h	2.55 KB	-rwxrwxrwx	2018-02-14 17:53
uniform_int_dist.h	9.73 KB	-rwxrwxrwx	2018-02-14 17:53
unique_ptr.h	24.36 KB	-rwxrwxrwx	2018-02-14 17:53
unordered_map.h	61.39 KB	-rwxrwxrwx	2018-02-14 17:53
unordered_set.h	47.59 KB	-rwxrwxrwx	2018-02-14 17:53
uses_allocator.h	3.68 KB	-rwxrwxrwx	2018-02-14 17:53
valarray_after.h	22.12 KB	-rwxrwxrwx	2018-02-14 17:53
valarray_array.h	21.23 KB	-rwxrwxrwx	2018-02-14 17:53
valarray_array.tcc	7.08 KB	-rwxrwxrwx	2018-02-14 17:53
valarray_before.h	18.08 KB	-rwxrwxrwx	2018-02-14 17:53
vector.tcc	26.42 KB	-rwxrwxrwx	2018-02-14 17:53

Rename

// Class template uniform_int_distribution -*- C++ -*-

// Copyright (C) 2009-2016 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/**
 * @file bits/uniform_int_dist.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{random}
 */

#ifndef _GLIBCXX_BITS_UNIFORM_INT_DIST_H
#define _GLIBCXX_BITS_UNIFORM_INT_DIST_H

#include <type_traits>
#include <limits>

namespace std _GLIBCXX_VISIBILITY(default)
{

namespace __detail
  {
_GLIBCXX_BEGIN_NAMESPACE_VERSION
    /* Determine whether number is a power of 2.  */
    template<typename _Tp>
      inline bool
      _Power_of_2(_Tp __x)
      {
	return ((__x - 1) & __x) == 0;
      };
_GLIBCXX_END_NAMESPACE_VERSION
  }

_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
   * @brief Uniform discrete distribution for random numbers.
   * A discrete random distribution on the range @f$[min, max]@f$ with equal
   * probability throughout the range.
   */
  template<typename _IntType = int>
    class uniform_int_distribution
    {
      static_assert(std::is_integral<_IntType>::value,
		    "template argument not an integral type");

public:
      /** The type of the range of the distribution. */
      typedef _IntType result_type;
      /** Parameter type. */
      struct param_type
      {
	typedef uniform_int_distribution<_IntType> distribution_type;

explicit
	param_type(_IntType __a = 0,
		   _IntType __b = std::numeric_limits<_IntType>::max())
	: _M_a(__a), _M_b(__b)
	{
	  __glibcxx_assert(_M_a <= _M_b);
	}

result_type
	a() const
	{ return _M_a; }

result_type
	b() const
	{ return _M_b; }

friend bool
	operator==(const param_type& __p1, const param_type& __p2)
	{ return __p1._M_a == __p2._M_a && __p1._M_b == __p2._M_b; }

private:
	_IntType _M_a;
	_IntType _M_b;
      };

public:
      /**
       * @brief Constructs a uniform distribution object.
       */
      explicit
      uniform_int_distribution(_IntType __a = 0,
			   _IntType __b = std::numeric_limits<_IntType>::max())
      : _M_param(__a, __b)
      { }

explicit
      uniform_int_distribution(const param_type& __p)
      : _M_param(__p)
      { }

/**
       * @brief Resets the distribution state.
       *
       * Does nothing for the uniform integer distribution.
       */
      void
      reset() { }

result_type
      a() const
      { return _M_param.a(); }

result_type
      b() const
      { return _M_param.b(); }

/**
       * @brief Returns the parameter set of the distribution.
       */
      param_type
      param() const
      { return _M_param; }

/**
       * @brief Sets the parameter set of the distribution.
       * @param __param The new parameter set of the distribution.
       */
      void
      param(const param_type& __param)
      { _M_param = __param; }

/**
       * @brief Returns the inclusive lower bound of the distribution range.
       */
      result_type
      min() const
      { return this->a(); }

/**
       * @brief Returns the inclusive upper bound of the distribution range.
       */
      result_type
      max() const
      { return this->b(); }

/**
       * @brief Generating functions.
       */
      template<typename _UniformRandomNumberGenerator>
	result_type
	operator()(_UniformRandomNumberGenerator& __urng)
        { return this->operator()(__urng, _M_param); }

template<typename _UniformRandomNumberGenerator>
	result_type
	operator()(_UniformRandomNumberGenerator& __urng,
		   const param_type& __p);

template<typename _ForwardIterator,
	       typename _UniformRandomNumberGenerator>
	void
	__generate(_ForwardIterator __f, _ForwardIterator __t,
		   _UniformRandomNumberGenerator& __urng)
	{ this->__generate(__f, __t, __urng, _M_param); }

template<typename _ForwardIterator,
	       typename _UniformRandomNumberGenerator>
	void
	__generate(_ForwardIterator __f, _ForwardIterator __t,
		   _UniformRandomNumberGenerator& __urng,
		   const param_type& __p)
	{ this->__generate_impl(__f, __t, __urng, __p); }

template<typename _UniformRandomNumberGenerator>
	void
	__generate(result_type* __f, result_type* __t,
		   _UniformRandomNumberGenerator& __urng,
		   const param_type& __p)
	{ this->__generate_impl(__f, __t, __urng, __p); }

/**
       * @brief Return true if two uniform integer distributions have
       *        the same parameters.
       */
      friend bool
      operator==(const uniform_int_distribution& __d1,
		 const uniform_int_distribution& __d2)
      { return __d1._M_param == __d2._M_param; }

private:
      template<typename _ForwardIterator,
	       typename _UniformRandomNumberGenerator>
	void
	__generate_impl(_ForwardIterator __f, _ForwardIterator __t,
			_UniformRandomNumberGenerator& __urng,
			const param_type& __p);

param_type _M_param;
    };

template<typename _IntType>
    template<typename _UniformRandomNumberGenerator>
      typename uniform_int_distribution<_IntType>::result_type
      uniform_int_distribution<_IntType>::
      operator()(_UniformRandomNumberGenerator& __urng,
		 const param_type& __param)
      {
	typedef typename _UniformRandomNumberGenerator::result_type
	  _Gresult_type;
	typedef typename std::make_unsigned<result_type>::type __utype;
	typedef typename std::common_type<_Gresult_type, __utype>::type
	  __uctype;

const __uctype __urngmin = __urng.min();
	const __uctype __urngmax = __urng.max();
	const __uctype __urngrange = __urngmax - __urngmin;
	const __uctype __urange
	  = __uctype(__param.b()) - __uctype(__param.a());

__uctype __ret;

if (__urngrange > __urange)
	  {
	    // downscaling
	    const __uctype __uerange = __urange + 1; // __urange can be zero
	    const __uctype __scaling = __urngrange / __uerange;
	    const __uctype __past = __uerange * __scaling;
	    do
	      __ret = __uctype(__urng()) - __urngmin;
	    while (__ret >= __past);
	    __ret /= __scaling;
	  }
	else if (__urngrange < __urange)
	  {
	    // upscaling
	    /*
	      Note that every value in [0, urange]
	      can be written uniquely as

(urngrange + 1) * high + low

where

high in [0, urange / (urngrange + 1)]

and

low in [0, urngrange].
	    */
	    __uctype __tmp; // wraparound control
	    do
	      {
		const __uctype __uerngrange = __urngrange + 1;
		__tmp = (__uerngrange * operator()
			 (__urng, param_type(0, __urange / __uerngrange)));
		__ret = __tmp + (__uctype(__urng()) - __urngmin);
	      }
	    while (__ret > __urange || __ret < __tmp);
	  }
	else
	  __ret = __uctype(__urng()) - __urngmin;

return __ret + __param.a();
      }

template<typename _IntType>
    template<typename _ForwardIterator,
	     typename _UniformRandomNumberGenerator>
      void
      uniform_int_distribution<_IntType>::
      __generate_impl(_ForwardIterator __f, _ForwardIterator __t,
		      _UniformRandomNumberGenerator& __urng,
		      const param_type& __param)
      {
	__glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)
	typedef typename _UniformRandomNumberGenerator::result_type
	  _Gresult_type;
	typedef typename std::make_unsigned<result_type>::type __utype;
	typedef typename std::common_type<_Gresult_type, __utype>::type
	  __uctype;

__uctype __ret;

if (__urngrange > __urange)
	  {
	    if (__detail::_Power_of_2(__urngrange + 1)
		&& __detail::_Power_of_2(__urange + 1))
	      {
		while (__f != __t)
		  {
		    __ret = __uctype(__urng()) - __urngmin;
		    *__f++ = (__ret & __urange) + __param.a();
		  }
	      }
	    else
	      {
		// downscaling
		const __uctype __uerange = __urange + 1; // __urange can be zero
		const __uctype __scaling = __urngrange / __uerange;
		const __uctype __past = __uerange * __scaling;
		while (__f != __t)
		  {
		    do
		      __ret = __uctype(__urng()) - __urngmin;
		    while (__ret >= __past);
		    *__f++ = __ret / __scaling + __param.a();
		  }
	      }
	  }
	else if (__urngrange < __urange)
	  {
	    // upscaling
	    /*
	      Note that every value in [0, urange]
	      can be written uniquely as

(urngrange + 1) * high + low

where

high in [0, urange / (urngrange + 1)]

and

low in [0, urngrange].
	    */
	    __uctype __tmp; // wraparound control
	    while (__f != __t)
	      {
		do
		  {
		    const __uctype __uerngrange = __urngrange + 1;
		    __tmp = (__uerngrange * operator()
			     (__urng, param_type(0, __urange / __uerngrange)));
		    __ret = __tmp + (__uctype(__urng()) - __urngmin);
		  }
		while (__ret > __urange || __ret < __tmp);
		*__f++ = __ret;
	      }
	  }
	else
	  while (__f != __t)
	    *__f++ = __uctype(__urng()) - __urngmin + __param.a();
      }

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif