Package 'runonce' helps automating the saving of long-running code
    to help running the same code multiple times. If you run some long-running 
    code once, it saves the result in a file on disk. Then, if the result 
    already exists, i.e. if the code has already been run and its output has 
    already been saved, it just reads the result from the stored file instead 
    of running the code again.

Provides methods for fast computation of running sample 
    statistics for time series. These include: (1) mean, (2) 
    standard deviation, and (3) variance over a fixed-length window 
    of time-series, (4) correlation, (5) covariance, and (6) 
    Euclidean distance (L2 norm) between short-time pattern and 
    time-series. Implemented methods utilize Convolution Theorem to 
    compute convolutions via Fast Fourier Transform (FFT).

Interface to the 'UNU.RAN' library for Universal Non-Uniform RANdom variate generators. 
	     Thus it allows to build non-uniform random number generators from quite arbitrary
	     distributions. In particular, it provides an algorithm for fast numerical inversion
	     for distribution with given density function.
	     In addition, the package contains densities, distribution functions and quantiles
	     from a couple of distributions.

A collection of efficient implementations of popular offline change-point detection algorithms, featuring a consistent, object-oriented interface for practical use.

Package to tackle large-scale problems asynchronously across
    a distributed network. Employing a database centric model, rush
    enables workers to communicate tasks and their results over a shared
    'Redis' database. Key features include low task overhead, efficient
    caching, and robust error handling. The package powers the
    asynchronous optimization algorithms in the 'bbotk' and 'mlr3tuning'
    packages.

By placing on a circle 10 points numbered from 1 to 10, and connecting them by a straight line to the point corresponding to its multiplication by 2. (1 must be connected to 1 * 2 = 2, point 2 must be set to 2 * 2 = 4, point 3 to 3 * 2 = 6 and so on). You will obtain an amazing geometric figure that complicates and beautifies itself by varying the number of points and the multiplication table you use.