Crossings Minimization  1.0
random.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

void init_genrand (unsigned long s)
 
void init_by_array (unsigned long init_key[], int key_length)
 
unsigned long genrand_int32 (void)
 
long genrand_int31 (void)
 
double genrand_real1 (void)
 
double genrand_real2 (void)
 
double genrand_real3 (void)
 
double genrand_res53 (void)
 
void genrand_permute (void *A, int length, int element_size)
 
int * genrand_permutation (void *A, int length, int element_size)
 

Function Documentation

◆ genrand_int31()

long genrand_int31 ( void  )

Definition at line 139 of file random.c.

References genrand_int32().

Referenced by genrand_permutation(), and genrand_permute().

Here is the call graph for this function:

◆ genrand_int32()

unsigned long genrand_int32 ( void  )

Definition at line 100 of file random.c.

References init_genrand(), LOWER_MASK, M, MATRIX_A, mt, mti, N, and UPPER_MASK.

Referenced by genrand_int31(), genrand_real1(), genrand_real2(), genrand_real3(), and genrand_res53().

Here is the call graph for this function:

◆ genrand_permutation()

int* genrand_permutation ( void *  A,
int  length,
int  element_size 
)

PRE: A is an array of 'length' items, each of which is 'element_size' bytes long. POST: A has been randomly permuted retval == an allocated array of int's containing the actual permutation: the old A[retval[i]] is now at A[i] To restore the array A back to its original state, do for( i = 0; i < length; ++i ) { B[ i ] = A[ i ]; where B is an array of the same type as A } for( i = 0; i < length; ++i ) { A[ retval[ i ] ] = B[ i ]; }

Definition at line 198 of file random.c.

References genrand_int31().

Here is the call graph for this function:

◆ genrand_permute()

void genrand_permute ( void *  A,
int  length,
int  element_size 
)

Added by Matthias Stallmann

Id
random.h 96 2014-09-09 16:37:16Z mfms

PRE: A is an array of 'length' items, each of which is 'element_size' bytes long. POST: A has been randomly permuted

The following are added by Matthias Stallmann

Id
random.c 96 2014-09-09 16:37:16Z mfms

Definition at line 183 of file random.c.

References genrand_int31().

Referenced by maxCrossingsEdge(), maxCrossingsLayer(), maxCrossingsNode(), maxStretchEdge(), and sifting().

Here is the call graph for this function:

◆ genrand_real1()

double genrand_real1 ( void  )

Definition at line 146 of file random.c.

References genrand_int32().

Here is the call graph for this function:

◆ genrand_real2()

double genrand_real2 ( void  )

Definition at line 154 of file random.c.

References genrand_int32().

Here is the call graph for this function:

◆ genrand_real3()

double genrand_real3 ( void  )

Definition at line 162 of file random.c.

References genrand_int32().

Here is the call graph for this function:

◆ genrand_res53()

double genrand_res53 ( void  )

Definition at line 170 of file random.c.

References genrand_int32().

Here is the call graph for this function:

◆ init_by_array()

void init_by_array ( unsigned long  init_key[],
int  key_length 
)

Definition at line 73 of file random.c.

References init_genrand(), mt, and N.

Here is the call graph for this function:

◆ init_genrand()

void init_genrand ( unsigned long  s)

Definition at line 53 of file random.c.

References mt, mti, and N.

Referenced by genrand_int32(), init_by_array(), and main().