The Sampler architecture of org.apache.commons.rng.sampling.distribution is nicely written for fast sampling of small dataset sizes. The constructors for the samplers do not check the input parameters are valid for the respective distributions (in contrast to the old org.apache.commons.math3.random.distribution classes). I assume this is a design choice for speed. Thus most of the samplers can be used within a loop to sample just one value with very little overhead.
The PoissonSampler precomputes log factorial numbers upon construction if the mean is above 40. This is done using the InternalUtils.FactorialLog class. As of version 1.0 this internal class is currently only used in the PoissonSampler.
The cache size is limited to 2*PIVOT (where PIVOT=40). But it creates and precomputes the cache every time a PoissonSampler is constructed if the mean is above the PIVOT value.
Why not create this once in a static block for the PoissonSampler?
This will make the construction cost of a new PoissonSampler negligible. If the table is computed dynamically as a static construction method then the overhead will be in the first use. Thus the following call will be much faster:
I have tested this modification (see attached file) and the results are:
Thus the speed improvements would be approximately 3-4 fold for single use Poisson sampling.