CartesianProductSampler.h File Reference

The class samples all combinations in a discrete set to particles. Each anchor point can be mapped to one particle for a specific mapping. For example, for anchor points [1,2,3,4,5] to particles [a,b,c,d] the sampling space would be: [1,1,1,1],[1,1,1,2],[1,1,1,3],[1,1,1,4],......,[5,5,5,4],[5,5,5,5] Copyright 2007-2010 IMP Inventors. All rights reserved. More...

Include dependency graph for CartesianProductSampler.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	IMP::domino::CartesianProductSampler
	CartesianProductSampler. More...
Namespaces
namespace	IMP
	The IMP kernel provides base classes and key shared functionality.
namespace	IMP::domino
	This module provides a framework for applying a divide-and-conquer sampling.

---

Detailed Description

The class samples all combinations in a discrete set to particles. Each anchor point can be mapped to one particle for a specific mapping. For example, for anchor points [1,2,3,4,5] to particles [a,b,c,d] the sampling space would be: [1,1,1,1],[1,1,1,2],[1,1,1,3],[1,1,1,4],......,[5,5,5,4],[5,5,5,5] Copyright 2007-2010 IMP Inventors. All rights reserved.