PPL API Reference
Overview Core Algorithm Abstractions Utilities Parallel Methods
Modules Class Hierarchy Classes Functions
Todo List Bug List Dead Code
Classes

Samplers (S) generate configurations in $\mathcal{C}_{space}$ (usually $\mathcal{C}_{free}$). More...

+ Collaboration diagram for Samplers:

Classes

class  SamplerMethod< MPTraits >
 
class  UniformRandomSampler< MPTraits >
 

Detailed Description

Samplers (S) generate configurations in $\mathcal{C}_{space}$ (usually $\mathcal{C}_{free}$).

A Sampler (S) is defined as an algorithm which generates configurations $\mathcal{C}_{space}$, however this is typically restricted to $\mathcal{C}_{free}$. They either take in a number of desired samples or a set of input configurations to apply the algorithm to. The base method can be found in SamplerMethod.h.