24 #ifndef GINAC_REMEMBER_H 25 #define GINAC_REMEMBER_H 43 bool is_equal(
function const & f)
const;
62 void add_entry(
function const & f,
ex const & result);
88 void add_entry(
function const & f,
ex const & result);
101 #endif // ndef GINAC_REMEMBER_H
unsigned long get_successful_hits() const
void show_statistics(std::ostream &os, unsigned level) const
remember_table_entry(function const &f, ex const &r)
unsigned long get_last_access() const
unsigned long last_access
bool lookup_entry(function const &f, ex &result) const
void add_entry(function const &f, ex const &result)
std::vector< ex > exvector
A list of entries in the remember table having some least significant bits of the hashvalue in common...
A single entry in the remember table of a function.
static unsigned long access_counter
void add_entry(function const &f, ex const &result)
static std::vector< remember_table > & remember_tables()
Lightweight wrapper for GiNaC's symbolic objects.
unsigned remember_strategy
remember_table_list(unsigned as, unsigned strat)
bool lookup_entry(function const &f, ex &result) const
The remember table is organized like an n-fold associative cache in a microprocessor.
unsigned remember_strategy
bool is_equal(function const &f) const