50#ifndef GUM_MULTI_DIM_FUNCTION_GRAPH_LEAST_SQUARE_TEST_POLICY_H
51#define GUM_MULTI_DIM_FUNCTION_GRAPH_LEAST_SQUARE_TEST_POLICY_H
72 template <
typename GUM_ELEMENT >
88 void*
operator new(
size_t s);
90 void operator delete(
void* p);
Headers of the ITestPolicy.
ITestPolicy()
Allocators and Deallocators redefinition.
void addObservation(Idx attr, GUM_ELEMENT value)
Comptabilizes the new observation.
double _score_
Keeping computed score.
void add(const LeastSquareTestPolicy< GUM_ELEMENT > &src)
Performs the merging of current LeastSquareTestPolicy instance with given instance.
double sumValue() const
Returns global sum (needed for the merging).
virtual ~LeastSquareTestPolicy()
Destructor.
double secondaryscore() const
Returns a second criterion to severe ties.
HashTable< Idx, Idx > _nbObsTable_
Nb Observation for each modality assumed by variable.
LeastSquareTestPolicy()
Constructor.
void computeScore()
Returns the performance of current variable according to the test.
const HashTable< Idx, LinkedList< double > * > & obsTable() const
Returns global sum (needed for the merging).
const HashTable< Idx, double > & sumAttrTable() const
Returns sum per modality table (needed for the merging).
HashTable< Idx, double > _sumAttrTable_
Sum for each modality assumed by variable.
bool isTestRelevant() const
Returns true if enough observation were made so that the test can be relevant.
double score()
Returns the performance of current variable according to the test.
const HashTable< Idx, Idx > & nbObsTable() const
Returns nbobs per modality table (needed for the merging).
HashTable< Idx, LinkedList< double > * > _obsTable_
Not sure if needed.
Headers of the ContingencyTable class.
Size Idx
Type for indexes.
Template implementations for the LeastSquareTestPolicy class.
Headers of the Link and LinkedList classes.
gum is the global namespace for all aGrUM entities