40 for (
Idx i = 0; i < db_conditioning_ids.size(); ++i) {
void setConditioningNodes(const std::vector< Idx > &db_conditioning_ids)
Sets the conditioning nodes (useful for computing degrees of freedom).
static double __criticalValue(double proba, Size df)
Computes the critical value of a given chi2 test (used by the cache).
double __confidence_proba
The confidence probability used for critical values.
Size __conditioning_size
The domain size of the conditioning nodes.
Copyright 2005-2019 Pierre-Henri WUILLEMIN et Christophe GONZALES (LIP6) {prenom.nom}_at_lip6.fr.
HashTable< Idx, double > __critical_values
A set of already computed critical values.
Size degreesOfFreedom(const std::pair< Idx, Idx > &pair)
Returns the number of degrees of freedom.
Base class for all aGrUM's exceptions.
void clear()
Removes all the elements in the hash table.
void setConfidenceProba(double new_proba)
Modifies the confidence probability.
Size Idx
Type for indexes.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
value_type & insert(const Key &key, const Val &val)
Adds a new element (actually a copy of this element) into the hash table.
double criticalValue(const std::pair< Idx, Idx > &pair)
Computes the critical value according to the number of degrees of freedom.
const std::vector< std::size_t > & __modalities
The modalities of the random variables.