/usr/include/qsopt_ex/urandom.h is in libqsopt-ex-dev 2.5.10.3-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 | /****************************************************************************/
/* */
/* This file is part of QSopt_ex. */
/* */
/* (c) Copyright 2006 by David Applegate, William Cook, Sanjeeb Dash, */
/* and Daniel Espinoza */
/* */
/* Sanjeeb Dash ownership of copyright in QSopt_ex is derived from his */
/* copyright in QSopt. */
/* */
/* This code may be used under the terms of the GNU General Public License */
/* (Version 2.1 or later) as published by the Free Software Foundation. */
/* */
/* Alternatively, use is granted for research purposes only. */
/* */
/* It is your choice of which of these two licenses you are operating */
/* under. */
/* */
/* We make no guarantees about the correctness or usefulness of this code. */
/* */
/****************************************************************************/
#ifndef __URANDOM_H__
#define __URANDOM_H__
/****************************************************************************/
/* */
/* urandom.c */
/* */
/****************************************************************************/
/* since urandom's generator does everything modulo ILL_PRANDMAX, if two
* seeds are congruent mod x and x|ILL_PRANDMAX, then the resulting numbers
* will be congruent mod x. One example was if ILL_PRANDMAX = 1000000000 and
* urandom is used to generate a point set from a 1000x1000 grid, seeds
* congruent mod 1000 generate the same point set.
*
* For this reason, we use 1000000007 (a prime)
*/
#define ILL_PRANDMAX 1000000007
typedef struct ILLrandstate
{
int a;
int b;
int arr[55];
}
ILLrandstate;
void ILLutil_sprand (
int seed,
ILLrandstate * r);
int ILLutil_lprand (
ILLrandstate * r);
#endif
|