IMP::domino::Order Class Reference
Store a persistent ordering for a subset based on the list. More...
#include <IMP/domino/Order.h>
Inheritance diagram for IMP::domino::Order:Public Member Functions | |
| Order (Subset outer, const ParticlesTemp &order) | |
| template<class It > | |
| Ints | get_list_ordered (It b, It e) const |
| Ints | get_list_ordered (const Assignment &a) const |
| template<class It > | |
| Assignment | get_subset_ordered (It b, It e) const |
| Assignment | get_subset_ordered (const Ints &a) const |
| Public Member Functions inherited from IMP::base::ConstVector< unsigned int > | |
| ConstVector (unsigned int sz, unsigned intfill) | |
| ConstVector (It b, It e) | |
| ConstVector (const Vector &i) | |
| unsigned int | operator[] (unsigned int i) const |
| void | show (std::ostream &out=std::cout) const |
| unsigned int | size () const |
Detailed Description
Return a list of indexes into s, representing a permutation of the particles in s, so that they are ordered according to all_particles. This order can be used to write s to disk, as the order in s can change between domino runs.
The documentation for this class was generated from the following file: