IMP Reference Guide
2.8.0
The Integrative Modeling Platform
|
#include <IMP/cache.h>
Implement a cache on sparse pairs of values. The cache is infinite (or at least n^2).
Public Types | |
typedef Generator::result_type::value_type | Entry |
typedef Generator::argument_type::value_type | Key |
typedef SparseSymmetricPairMemoizer < Generator, Checker > | This |
Public Member Functions | |
SparseSymmetricPairMemoizer (const Vector< Key > &domain, const Generator &gen=Generator(), const Checker &check=Checker()) | |
Generator & | access_generator () const |
template<class F > | |
F | apply (F f) |
template<class F > | |
F | apply_to_current_contents (F f) |
void | clear () |
const Generator & | get_generator () const |
void | insert (const Entry &e) |
void | remove (const Key &a) |
Clear all entries involve the Key. More... | |
F IMP::SparseSymmetricPairMemoizer< Generator, Checker >::apply_to_current_contents | ( | F | f | ) |
void IMP::SparseSymmetricPairMemoizer< Generator, Checker >::remove | ( | const Key & | a | ) |