DRAND48(3P)

๐Ÿ’– DRAND48(3P) ๐Ÿ’–

okay bestie, gather round ๐Ÿซถ this is the drand48(3P) page, straight out of the POSIX Programmer's Manual. it's the whole girl-gang of pseudo-random number functions and they're all here. no cap.


๐ŸŒธ PROLOG ๐ŸŒธ

so like, real talk before we even start: this manual page is part of the POSIX Programmer's Manual. the Linux implementation of this interface may differ โ€” consult the corresponding Linux manual page for the details on Linux behavior โ€” or honestly the interface may just not be implemented on Linux at all. ๐Ÿ’€ check before you commit, babes.


โœจ NAME โœจ

drand48, erand48, jrand48, lcong48, lrand48, mrand48, nrand48, seed48, srand48 โ€” generate uniformly distributed pseudo-random numbers ๐ŸŽฒโœจ


๐ŸŽ€ SYNOPSIS ๐ŸŽ€

#include <stdlib.h>

double drand48(void);
double erand48(unsigned short xsubi[3]);
long jrand48(unsigned short xsubi[3]);
void lcong48(unsigned short param[7]);
long lrand48(void);
long mrand48(void);
long nrand48(unsigned short xsubi[3]);
unsigned short *seed48(unsigned short seed16v[3]);
void srand48(long seedval);

๐Ÿ’… DESCRIPTION ๐Ÿ’…

so this whole family of functions shall generate pseudo-random numbers using a linear congruential algorithm and 48-bit integer arithmetic. that's the whole vibe. iconic.

the drand48() and erand48() functions shall return non-negative, double-precision, floating-point values, uniformly distributed over the interval [0.0,1.0). so like, zero is invited to the party, one is not. ๐Ÿ™ˆ

the lrand48() and nrand48() functions shall return non-negative, long integers, uniformly distributed over the interval [0,231).

the mrand48() and jrand48() functions shall return signed long integers uniformly distributed over the interval [-231,231).

๐Ÿงš the initialization girlies

the srand48(), seed48(), and lcong48() functions are initialization entry points, and one of them should be invoked before either drand48(), lrand48(), or mrand48() is called. (although it is not recommended practice, constant default initializer values shall be supplied automatically if drand48(), lrand48(), or mrand48() is called without a prior call to an initialization entry point.) meanwhile erand48(), nrand48(), and jrand48() do not require an initialization entry point to be called first. they're low maintenance like that. ๐Ÿ’…

๐ŸŒˆ the math part (it's giving STEM)

all the routines work by generating a sequence of 48-bit integer values, X_i, according to the linear congruential formula:

Xn+1 = (aX_n +c)mod m        nโ‰ฅ 0

the parameter m=2^48; hence 48-bit integer arithmetic is performed. unless lcong48() is invoked, the multiplier value a and the addend value c are given by:

a = 5DEECE66D16 = 2736731631558

c = B16 = 138

the value returned by any of the drand48(), erand48(), jrand48(), lrand48(), mrand48(), or nrand48() functions is computed by first generating the next 48-bit X_i in the sequence. then the appropriate number of bits, according to the type of data item to be returned, are copied from the high-order (leftmost) bits of X_i and transformed into the returned value. cute little bit surgery, honestly. โœ‚๏ธโœจ

๐Ÿ“ internal buffer vs. you bring your own storage

the drand48(), lrand48(), and mrand48() functions store the last 48-bit X_i generated in an internal buffer; that is why the application shall ensure that these are initialized prior to being invoked. the erand48(), nrand48(), and jrand48() functions require the calling program to provide storage for the successive X_i values in the array specified as an argument when the functions are invoked. that is why these routines do not have to be initialized; the calling program merely has to place the desired initial value of X_i into the array and pass it as an argument.

by using different arguments, erand48(), nrand48(), and jrand48() allow separate modules of a large program to generate several independent streams of pseudo-random numbers; that is, the sequence of numbers in each stream shall not depend upon how many times the routines are called to generate numbers for the other streams. parallel queen behavior. ๐Ÿ‘‘

๐Ÿ’œ srand48()

the initializer function srand48() sets the high-order 32 bits of X_i to the low-order 32 bits contained in its argument. the low-order 16 bits of X_i are set to the arbitrary value 330E_16.

๐Ÿฆ‹ seed48()

the initializer function seed48() sets the value of X_i to the 48-bit value specified in the argument array.

  • the low-order 16 bits of X_i are set to the low-order 16 bits of seed16v[0].
  • the mid-order 16 bits of X_i are set to the low-order 16 bits of seed16v[1].
  • the high-order 16 bits of X_i are set to the low-order 16 bits of seed16v[2].

in addition, the previous value of X_i is copied into a 48-bit internal buffer, used only by seed48(), and a pointer to this buffer is the value returned by seed48(). this returned pointer, which can just be ignored if not needed, is useful if a program is to be restarted from a given point at some future time โ€” use the pointer to get at and store the last X_i value, and then use this value to reinitialize via seed48() when the program is restarted. save-scumming, but make it C. ๐ŸŽฎ

๐ŸŒธ lcong48()

the initializer function lcong48() allows the user to specify the initial X_i, the multiplier value a, and the addend value c.

  • argument array elements param[0-2] specify X_i
  • param[3-5] specify the multiplier a
  • param[6] specifies the 16-bit addend c

after lcong48() is called, a subsequent call to either srand48() or seed48() shall restore the standard multiplier and addend values, a and c, specified above. so don't think your custom values stick around forever, bestie. ๐Ÿ™ˆ

โš ๏ธ the drand48(), lrand48(), and mrand48() functions need not be thread-safe. plan accordingly, fr fr.

โญ RETURN VALUE โญ

as described in the DESCRIPTION above. go scroll up, it's all there. ๐Ÿซถ


๐Ÿ’€ ERRORS ๐Ÿ’€

no errors are defined. slay, nothing to handle.

the following sections are informative.


๐ŸŽ€ EXAMPLES ๐ŸŽ€

none. ๐Ÿ˜ญ we move.


๐Ÿงš APPLICATION USAGE ๐Ÿงš

these functions should be avoided whenever non-trivial requirements (including safety) have to be fulfilled. like, read that again. if it matters, don't use these. periodt.


๐Ÿ’œ RATIONALE ๐Ÿ’œ

none.


๐ŸŒˆ FUTURE DIRECTIONS ๐ŸŒˆ

none.


๐Ÿ‘‘ SEE ALSO ๐Ÿ‘‘

  • initstate()
  • rand()
  • the Base Definitions volume of POSIX.1โ€2017, <stdlib.h>

portions of this text are reprinted and reproduced in electronic form from IEEE Std 1003.1-2017, Standard for Information Technology -- Portable Operating System Interface (POSIX), The Open Group Base Specifications Issue 7, 2018 Edition, Copyright (C) 2018 by the Institute of Electrical and Electronics Engineers, Inc and The Open Group. in the event of any discrepancy between this version and the original IEEE and The Open Group Standard, the original IEEE and The Open Group Standard is the referee document. the original Standard can be obtained online at http://www.opengroup.org/unix/online.html .

any typographical or formatting errors that appear in this page are most likely to have been introduced during the conversion of the source files to man page format. to report such errors, see https://www.kernel.org/doc/man-pages/reporting_bugs.html .


and that's the whole page, bestie!! ๐ŸŽ€โœจ courtesy of IEEE/The Open Group, dated 2017 โ€” like, the year the whole thing got stamped and sent out into the world. you're welcome, go seed responsibly. ๐Ÿ’…๐Ÿ’–

๐Ÿ“ฆ where this page comes from