53#ifndef GUM_LEARNING_SCORING_CACHE_H
54#define GUM_LEARNING_SCORING_CACHE_H
161#ifndef DOXYGEN_SHOULD_SKIP_THIS
The class for generic Hash Tables.
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
ScoringCache & operator=(ScoringCache &&from)
move operator
void insert(const IdCondSet &idset, double score)
insert a new score into the cache
ScoringCache & operator=(const ScoringCache &from)
copy operator
void erase(const IdCondSet &idset)
removes a score (if it exists)
void insert(IdCondSet &&idset, double score)
insert a new score into the cache
void clear()
removes all the stored scores
virtual ~ScoringCache()
destructor
bool exists(const IdCondSet &idset)
indicates whether a given score exists
ScoringCache()
default constructor
double score(const IdCondSet &idset)
returns a given score
std::size_t size() const
returns the number of scores saved in the cache
ScoringCache(const ScoringCache &from)
copy constructor
virtual ScoringCache * clone() const
virtual copy constructor
ScoringCache(ScoringCache &&from)
move constructor
A class used by learning caches to represent uniquely sets of variables.
include the inlined functions if necessary
gum is the global namespace for all aGrUM entities
a cache for caching scores and independence tests results