OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	01/31/2023 12:38:15 PM	rwxr-xr-x
📄 algo.h	78.15 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 algobase.h	16.75 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 algorithm	1.35 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 algorithmfwd.h	31.45 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 balanced_quicksort.h	16.55 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 base.h	12.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_iterator.h	1.55 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 checkers.h	2.25 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 compatibility.h	3.7 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 compiletime_settings.h	2.8 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 equally_split.h	3.28 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 features.h	3.46 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 find.h	13.27 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 find_selectors.h	6.83 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 for_each.h	3.85 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 for_each_selectors.h	10.32 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 iterator.h	5.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 list_partition.h	6.39 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 losertree.h	27.92 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 merge.h	9.35 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multiseq_selection.h	21.56 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multiway_merge.h	68.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multiway_mergesort.h	14.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 numeric	20.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 numericfwd.h	7.32 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 omp_loop.h	3.94 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 omp_loop_static.h	4.01 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 par_loop.h	4.45 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 parallel.h	1.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 partial_sum.h	7.3 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 partition.h	14.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 queue.h	5.41 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 quicksort.h	5.98 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random_number.h	4.13 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random_shuffle.h	18.24 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 search.h	5.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 set_operations.h	14.25 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 settings.h	12.17 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 sort.h	7.53 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 tags.h	5.84 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 types.h	3.63 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unique_copy.h	6.02 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 workstealing.h	9.39 KB	12/04/2019 02:25:41 PM	rw-r--r--

Editing: random_number.h

// -*- C++ -*-

// Copyright (C) 2007-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 parallel/random_number.h
 *  @brief Random number generator based on the Mersenne twister.
 *  This file is a GNU parallel extension to the Standard C++ Library.
 */

// Written by Johannes Singler.

#ifndef _GLIBCXX_PARALLEL_RANDOM_NUMBER_H
#define _GLIBCXX_PARALLEL_RANDOM_NUMBER_H 1

#include <parallel/types.h>
#include <tr1/random>
#include <limits>

namespace __gnu_parallel
{
  /** @brief Random number generator, based on the Mersenne twister. */
  class _RandomNumber
  {
  private:
    std::tr1::mt19937   _M_mt;
    uint64_t            _M_supremum;
    uint64_t            _M_rand_sup;
    double              _M_supremum_reciprocal;
    double              _M_rand_sup_reciprocal;

// Assumed to be twice as long as the usual random number.
    uint64_t              __cache;

// Bit results.
    int __bits_left;
    
    static uint32_t
    __scale_down(uint64_t __x,
#if _GLIBCXX_SCALE_DOWN_FPU
               uint64_t /*_M_supremum*/, double _M_supremum_reciprocal)
#else
               uint64_t _M_supremum, double /*_M_supremum_reciprocal*/)
#endif
        {
#if _GLIBCXX_SCALE_DOWN_FPU
          return uint32_t(__x * _M_supremum_reciprocal);
#else
          return static_cast<uint32_t>(__x % _M_supremum);
#endif
        }

public:
    /** @brief Default constructor. Seed with 0. */
    _RandomNumber()
    : _M_mt(0), _M_supremum(0x100000000ULL),
      _M_rand_sup(1ULL << std::numeric_limits<uint32_t>::digits),
      _M_supremum_reciprocal(double(_M_supremum) / double(_M_rand_sup)),
      _M_rand_sup_reciprocal(1.0 / double(_M_rand_sup)),
      __cache(0), __bits_left(0) { }

/** @brief Constructor.
     *  @param __seed Random __seed.
     *  @param _M_supremum Generate integer random numbers in the
     *                  interval @c [0,_M_supremum). */
    _RandomNumber(uint32_t __seed, uint64_t _M_supremum = 0x100000000ULL)
    : _M_mt(__seed), _M_supremum(_M_supremum),
      _M_rand_sup(1ULL << std::numeric_limits<uint32_t>::digits),
      _M_supremum_reciprocal(double(_M_supremum) / double(_M_rand_sup)),
      _M_rand_sup_reciprocal(1.0 / double(_M_rand_sup)),
      __cache(0), __bits_left(0) { }

/** @brief Generate unsigned random 32-bit integer. */
    uint32_t
    operator()()
    { return __scale_down(_M_mt(), _M_supremum, _M_supremum_reciprocal); }

/** @brief Generate unsigned random 32-bit integer in the
        interval @c [0,local_supremum). */
    uint32_t
    operator()(uint64_t local_supremum)
    {
      return __scale_down(_M_mt(), local_supremum,
                        double(local_supremum * _M_rand_sup_reciprocal));
    }

/** @brief Generate a number of random bits, run-time parameter.
     *  @param __bits Number of bits to generate. */
    unsigned long
    __genrand_bits(int __bits)
    {
      unsigned long __res = __cache & ((1 << __bits) - 1);
      __cache = __cache >> __bits;
      __bits_left -= __bits;
      if (__bits_left < 32)
        {
          __cache |= ((uint64_t(_M_mt())) << __bits_left);
          __bits_left += 32;
        }
      return __res;
    }
};

} // namespace __gnu_parallel

#endif /* _GLIBCXX_PARALLEL_RANDOM_NUMBER_H */