Construction, identical for both engines and on every compiler: take a
fresh 64-bit word w from the generator, keep its top 53 bits
u = ibits(w, 11, 53) (an integer in [0, 253)), and return
real(u, dp) * 2**-53. Every integer below 253 is exact in IEEE
binary64 and 2-53 is a power of two, so the product is exact: no
rounding, no compiler-dependent fused multiply-add, and the result can
never reach 1.0. Values are therefore multiples of 2-53 in
[0, 1 - 2**-53].
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.