Draw a Poisson-distributed count with mean mean_milli/1000.
The mean is given a thousand times over so that fractional means are
expressible without a real type: mean_milli = 2500 means 2.5 events.
Counts the exponential inter-arrivals that fit inside a fixed window,
which is the defining construction of a Poisson process rather than
an approximation of one. Cost is O(mean).
mean_milli must be in [0, POISSON_MAX_MEAN_MILLI]. Zero returns
zero without consuming a draw. Out of range returns zero and, if err
is present, sets ERROR_VALIDATION.
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.