Represent a subset of the particles being optimized.
Domino acts by dividing the particles being changed into subsets and optimizing the subsets independently. Each subset is represented using a Subset class. These classes, like the Assignment classes simply store a constant list (in this case of particles). The list is stored in sorted order. Their interface is more or less that of a constant vector in C++ or a constant list in python.
Examples: restraint cache, save assignments, multiscale
Inheritance diagram for IMP::domino::Subset:Public Member Functions | |
| Subset (ParticlesTemp ps) | |
| bool | get_contains (const Subset &o) const |
| Model * | get_model () const |
| std::string | get_name () const |
Public Member Functions inherited from IMP::base::ConstArray< WeakPointer< Particle >, Particle * > | |
| ConstArray (unsigned int sz, WeakPointer< Particle >fill) | |
| ConstArray (It b, It e) | |
| ConstArray (const Vector &i) | |
| std::size_t | __hash__ () const |
| WeakPointer< Particle > | operator[] (unsigned int i) const |
| void | show (std::ostream &out=std::cout) const |
| unsigned int | size () const |
|
explicit |
Construct a subset from a non-empty list of particles.