IMP::base::SparseSymmetricPairMemoizer< Generator, Checker > Class Template Reference

#include <IMP/base/cache.h>

Detailed Description

template<class Generator, class Checker>
class IMP::base::SparseSymmetricPairMemoizer< Generator, Checker >

Implement a cache on sparse pairs of values. The cache is infinite (or at least n^2).

Definition at line 89 of file cache.h.

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...

Member Function Documentation

template<class Generator , class Checker >

template<class F >

F IMP::base::SparseSymmetricPairMemoizer< Generator, Checker >::apply_to_current_contents

(

F

f

)

Apply a function to the current (unfilled) state of the memoizer.

Definition at line 213 of file cache.h.

template<class Generator , class Checker >

void IMP::base::SparseSymmetricPairMemoizer< Generator, Checker >::remove

(

const Key &

a

)

Clear all entries involve the Key.

The removed entries are returned

Definition at line 219 of file cache.h.

---

The documentation for this class was generated from the following file:

• cache.h