OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	01/31/2023 12:38:15 PM	rwxr-xr-x
📄 algorithmfwd.h	21.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 alloc_traits.h	19.13 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 allocated_ptr.h	3.43 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 allocator.h	6.73 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 atomic_base.h	23.28 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 atomic_futex.h	9.35 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 atomic_lockfree_defines.h	2.2 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_ios.h	15.7 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_ios.tcc	5.94 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_string.h	235.15 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_string.tcc	52.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 boost_concept_check.h	26.41 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 c++0x_warning.h	1.44 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 char_traits.h	20.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 codecvt.h	20.8 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 concept_check.h	3.34 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 cpp_type_traits.h	9.37 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 cxxabi_forced.h	1.77 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 cxxabi_init_exception.h	2.17 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 deque.tcc	33.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 enable_special_members.h	12.1 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 exception.h	2.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 exception_defines.h	1.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 exception_ptr.h	6.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 forward_list.h	47.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 forward_list.tcc	14.68 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 fstream.tcc	32.14 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 functexcept.h	3.18 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 functional_hash.h	8 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 gslice.h	5.39 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 gslice_array.h	7.59 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 hash_bytes.h	2.1 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 hashtable.h	71.56 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 hashtable_policy.h	65.47 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 indirect_array.h	7.68 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 invoke.h	3.57 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ios_base.h	30.22 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 istream.tcc	30.36 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 list.tcc	15.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_classes.h	24.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_classes.tcc	8.18 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_conv.h	15.7 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets.h	89.98 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets.tcc	38.64 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets_nonio.h	67.33 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 locale_facets_nonio.tcc	44.46 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 localefwd.h	5.51 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 mask_array.h	7.42 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 memoryfwd.h	2.36 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 move.h	6.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 nested_exception.h	4.66 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 node_handle.h	7.97 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ostream.tcc	12.03 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ostream_insert.h	3.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 parse_numbers.h	7.84 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 postypes.h	8.02 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 predefined_ops.h	8.87 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 ptr_traits.h	4.75 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 quoted_string.h	4.47 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random.h	171.19 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random.tcc	103.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 range_access.h	9.75 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 refwrap.h	13.48 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex.h	95.9 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex.tcc	16.1 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_automaton.h	10.47 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_automaton.tcc	7.65 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_compiler.h	16.79 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_compiler.tcc	18.46 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_constants.h	14.36 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_error.h	4.85 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_executor.h	7.31 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_executor.tcc	16.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_scanner.h	6.92 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 regex_scanner.tcc	14.66 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 shared_ptr.h	22.37 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 shared_ptr_atomic.h	9.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 shared_ptr_base.h	52.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 slice_array.h	9.13 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 specfun.h	44.03 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 sstream.tcc	9.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 std_abs.h	3.21 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 std_function.h	23.41 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 std_mutex.h	9.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_algo.h	208.85 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_algobase.h	49.22 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_bvector.h	33.03 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_construct.h	7.22 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_deque.h	75.95 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_function.h	32.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_heap.h	19.73 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_iterator.h	40.77 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_iterator_base_funcs.h	7.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_iterator_base_types.h	8.48 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_list.h	63.65 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_map.h	50.02 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_multimap.h	39 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_multiset.h	33.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_numeric.h	13.51 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_pair.h	18.21 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_queue.h	21.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_raw_storage_iter.h	3.74 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_relops.h	4.49 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_set.h	33.63 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_stack.h	11.18 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_tempbuf.h	8.15 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_tree.h	73.07 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_uninitialized.h	27 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stl_vector.h	54.33 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stream_iterator.h	6.5 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 streambuf.tcc	4.81 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 streambuf_iterator.h	12.33 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 string_view.tcc	6.48 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 stringfwd.h	2.55 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 uniform_int_dist.h	9.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unique_ptr.h	24.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_map.h	67.04 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unordered_set.h	52.56 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 uses_allocator.h	6.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_after.h	22.12 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_array.h	21.3 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_array.tcc	7.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 valarray_before.h	18.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 vector.tcc	26.95 KB	12/04/2019 02:25:41 PM	rw-r--r--

Editing: uniform_int_dist.h

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

// Copyright (C) 2009-2017 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 must be 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; }

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

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();
      }

// operator!= and operator<< and operator>> are defined in <bits/random.h>

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif