Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Where possible, edges connecting nodes are
given different colours to make them easier to distinguish in
large graphs.
Variables
Type
Visibility
Attributes
Name
Initial
integer(kind=int64),
private
::
old
Source Code
function pcg32_step(self)result(r)!! Advance the LCG one step and return the XSH-RR permutation of the!! *previous* state as an unsigned value in [0, 2**32).class(pcg32_t),intent(inout)::selfinteger(int64)::rinteger(int64)::oldold=self%stateself%state=u64_add(u64_mul(old,PCG_MULTIPLIER),self%increment)r=rotate_right32(ibits(ieor(u64_shr(old,18_default_int),old),27,32),&ibits(old,59,5))end function pcg32_step