VitterStrides

Random sampling utility. Complexity: O(n) References: Jeffrey Scott Vitter, An efficient algorithm for sequential random sampling

static if(is(typeof( )))

struct VitterStrides {

this(size_t N, size_t n);

bool empty();

size_t length();

size_t tail();

sizediff_t opCall(G gen);

}

Constructors

this this(size_t N, size_t n)

Postblit

this(this) this(this): Undocumented in source.

Members

Functions

empty bool empty()
length size_t length()
opCall sizediff_t opCall(G gen)
tail size_t tail()

Examples

import mir.random.engine.xorshift;
auto gen = Xorshift(112);
auto strides = VitterStrides(20, 3);
size_t s;
foreach(_; 0..3)
{
    s += strides(gen) + 1;
    assert(s + strides.tail == 20);
}

Meta

Source

See Implementation

mir random algorithm functions

structs