Class used to perform Function Graph Operations in the FMDP Framework. More...

#include <agrum/multidim/patterns/regress.h>

Collaboration diagram for gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >:

Public Member Functions
Constructors / Destructors
	Regress (const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > vfunction, const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > probDist, const Set< const DiscreteVariable * > primedVars, const DiscreteVariable targetVar, const GUM_SCALAR neutral)
	Default constructor. More...

	~Regress ()
	Default destructor. More...

Main Method
MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *	compute ()
	Computes and builds the Function Graph that is the result of the operation. More...

Detailed Description

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>
class gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >

Class used to perform Function Graph Operations in the FMDP Framework.

Definition at line 54 of file regress.h.

Constructor & Destructor Documentation

◆ Regress()

template<typename GUM_SCALAR , template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy>

INLINE gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::Regress	(	const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *	vfunction,
		const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *	probDist,
		const Set< const DiscreteVariable * > *	primedVars,
		const DiscreteVariable *	targetVar,
		const GUM_SCALAR	neutral
	)

Default constructor.

Definition at line 48 of file regress_tpl.h.

References gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__default, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__nbVar, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__primedVars, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__rd, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__targetVar, and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

                                                                :
       __DG1(DG1),
       __DG2(DG2), __neutral(neutral), __combine(), __project(),
       __DG1InstantiationNeeded(DG1->realSize(), true, false),
       __DG2InstantiationNeeded(DG2->realSize(), true, false) {
     GUM_CONSTRUCTOR(Regress);
     __rd =
        MultiDimFunctionGraph< GUM_SCALAR,
                               TerminalNodePolicy >::getReducedAndOrderedInstance();
     __nbVar = 0;
     __default = nullptr;
     __primedVars = primedVars;
     __targetVar = targetVar;
   }

Here is the call graph for this function:

◆ ~Regress()

template<typename GUM_SCALAR , template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy>

INLINE gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress ( )

Default destructor.

Definition at line 76 of file regress_tpl.h.

References gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__default, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG1InstantiationNeeded, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG2InstantiationNeeded, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__nbVar, gum::HashTable< Key, Val, Alloc >::beginSafe(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute(), DEALLOCATE, and gum::HashTable< Key, Val, Alloc >::endSafe().

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::Regress().

                    {
     GUM_DESTRUCTOR(Regress);
 
     for (auto instIter = __DG1InstantiationNeeded.beginSafe();
          instIter != __DG1InstantiationNeeded.endSafe();
          ++instIter)
       DEALLOCATE(instIter.val(), sizeof(short int) * __nbVar);
 
     for (auto instIter = __DG2InstantiationNeeded.beginSafe();
          instIter != __DG2InstantiationNeeded.endSafe();
          ++instIter)
       DEALLOCATE(instIter.val(), sizeof(short int) * __nbVar);
 
     if (__nbVar != 0) DEALLOCATE(__default, sizeof(short int) * __nbVar);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Function Documentation

◆ __compute()

template<typename GUM_SCALAR , template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy>

INLINE NodeId gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute	(	O4DGContext &	currentSituation,
		Idx	lastInstVarPos
	)

private

The main recursion function.

Definition at line 328 of file regress_tpl.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute().

                                                                      {
     NodeId newNode = 0;
 
     // If both current nodes are terminal,
     // we only have to compute the resulting value
     if (__DG1->isTerminalNode(currentSituation.DG1Node())
         && __DG2->isTerminalNode(currentSituation.DG2Node())) {
       // We have to compute new valueand we insert a new node in diagram with
       // this value, ...
       GUM_SCALAR newVal = __neutral;
       GUM_SCALAR tempVal = __combine(__DG1->nodeValue(currentSituation.DG1Node()),
                                      __DG2->nodeValue(currentSituation.DG2Node()));
       for (Idx targetModa = 0; targetModa < __targetVar->domainSize();
            ++targetModa)
         newVal = __project(newVal, tempVal);
       return __rd->manager()->addTerminalNode(newVal);
     }
 
     // If not,
     // we'll have to do some exploration
 
     // First we ensure that we hadn't already visit this pair of node under hte
     // same circumstances
     short int* dg1NeededVar =
        __DG1InstantiationNeeded.exists(currentSituation.DG1Node())
           ? __DG1InstantiationNeeded[currentSituation.DG1Node()]
           : __default;
     Idx dg1CurrentVarPos =
        __DG1->isTerminalNode(currentSituation.DG1Node())
           ? __nbVar
           : __rd->variablesSequence().pos(
              __DG1->node(currentSituation.DG1Node())->nodeVar());
     short int* dg2NeededVar =
        __DG2InstantiationNeeded.exists(currentSituation.DG2Node())
           ? __DG2InstantiationNeeded[currentSituation.DG2Node()]
           : __default;
     Idx dg2CurrentVarPos =
        __DG2->isTerminalNode(currentSituation.DG2Node())
           ? __nbVar
           : __rd->variablesSequence().pos(
              __DG2->node(currentSituation.DG2Node())->nodeVar());
 
     short int* instNeeded =
        static_cast< short int* >(ALLOCATE(sizeof(short int) * __nbVar));
 
     for (Idx i = 0; i < __nbVar; i++) {
       instNeeded[i] = dg1NeededVar[i] + dg2NeededVar[i];
     }
 
     double curSitKey = currentSituation.key(instNeeded);
 
     if (__explorationTable.exists(curSitKey)) {
       DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
 
       return __explorationTable[curSitKey];
     }
 
     // ====================================================
 
     NodeId origDG1 = currentSituation.DG1Node(),
            origDG2 = currentSituation.DG2Node();
 
     const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* leaddg =
        nullptr;
     NodeId leadNodeId = 0;
     Idx    leadVarPos = __rd->variablesSequence().size();
     typedef void (O4DGContext::*SetNodeFunction)(const NodeId&);
     SetNodeFunction leadFunction = nullptr;
 
     bool sameVar = false;
 
     if (!__DG1->isTerminalNode(currentSituation.DG1Node())) {
       if (currentSituation.varModality(dg1CurrentVarPos) != 0) {
         // If var associated to current node has already been instanciated, we
         // have to jump it
         currentSituation.setDG1Node(
            __DG1->node(currentSituation.DG1Node())
               ->son(currentSituation.varModality(dg1CurrentVarPos) - 1));
 
         newNode = __compute(currentSituation, lastInstVarPos);
         __explorationTable.insert(curSitKey, newNode);
         currentSituation.setDG1Node(origDG1);
         currentSituation.setDG2Node(origDG2);
 
         DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
 
         return newNode;
       }
 
       leaddg = __DG1;
       leadNodeId = currentSituation.DG1Node();
       leadVarPos = dg1CurrentVarPos;
       leadFunction = &O4DGContext::setDG1Node;
     }
 
     if (!__DG2->isTerminalNode(currentSituation.DG2Node())) {
       if (currentSituation.varModality(dg2CurrentVarPos) != 0) {
         // If var associated to current node has already been instanciated, we
         // have to jump it
         currentSituation.setDG2Node(
            __DG2->node(currentSituation.DG2Node())
               ->son(currentSituation.varModality(dg2CurrentVarPos) - 1));
 
         newNode = __compute(currentSituation, lastInstVarPos);
         __explorationTable.insert(curSitKey, newNode);
         currentSituation.setDG1Node(origDG1);
         currentSituation.setDG2Node(origDG2);
 
         DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
 
         return newNode;
       }
 
       if (leadVarPos == dg2CurrentVarPos) { sameVar = true; }
 
       if (leadVarPos > dg2CurrentVarPos) {
         leaddg = __DG2;
         leadNodeId = currentSituation.DG2Node();
         leadVarPos = dg2CurrentVarPos;
         leadFunction = &O4DGContext::setDG2Node;
       }
     }
 
     // ====================================================
     // Anticipated Exploration
 
     // Before exploring nodes, we have to ensure that every anticipated
     // exploration is done
     for (Idx varPos = lastInstVarPos + 1; varPos < leadVarPos; ++varPos) {
       if (instNeeded[varPos]) {
         const DiscreteVariable* curVar = __rd->variablesSequence().atPos(varPos);
         NodeId*                 sonsIds =
            static_cast< NodeId* >(ALLOCATE(sizeof(NodeId) * curVar->domainSize()));
 
         for (Idx modality = 0; modality < curVar->domainSize(); modality++) {
           currentSituation.chgVarModality(varPos, modality + 1);
 
           sonsIds[modality] = __compute(currentSituation, varPos);
         }
 
         newNode = __rd->manager()->addInternalNode(curVar, sonsIds);
 
         __explorationTable.insert(curSitKey, newNode);
         currentSituation.chgVarModality(varPos, 0);
         currentSituation.setDG1Node(origDG1);
         currentSituation.setDG2Node(origDG2);
 
         DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
 
         return newNode;
       }
     }
 
     // ====================================================
     // Terminal Exploration
     if (sameVar && __DG1->node(origDG1)->nodeVar() == __targetVar) {
       GUM_SCALAR newVal = __neutral;
       for (Idx targetModa = 0; targetModa < __targetVar->domainSize();
            ++targetModa)
         newVal = __project(
            newVal,
            __combine(__DG1->nodeValue(__DG1->node(origDG1)->son(targetModa)),
                      __DG2->nodeValue(__DG2->node(origDG2)->son(targetModa))));
       newNode = __rd->manager()->addTerminalNode(newVal);
       __explorationTable.insert(curSitKey, newNode);
       DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
       return newNode;
     }
     if (__DG1->isTerminalNode(origDG1)) {
       if (__DG2->node(origDG2)->nodeVar() == __targetVar) {
         GUM_SCALAR newVal = __neutral;
         for (Idx targetModa = 0; targetModa < __targetVar->domainSize();
              ++targetModa)
           newVal = __project(
              newVal,
              __combine(__DG1->nodeValue(origDG1),
                        __DG2->nodeValue(__DG2->node(origDG2)->son(targetModa))));
         newNode = __rd->manager()->addTerminalNode(newVal);
         __explorationTable.insert(curSitKey, newNode);
         DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
         return newNode;
       }
     } else {
       if (__DG1->node(origDG1)->nodeVar() == __targetVar
           && __DG2->isTerminalNode(origDG2)) {
         GUM_SCALAR newVal = __neutral;
         for (Idx targetModa = 0; targetModa < __targetVar->domainSize();
              ++targetModa)
           newVal = __project(
              newVal,
              __combine(__DG1->nodeValue(__DG1->node(origDG1)->son(targetModa)),
                        __DG2->nodeValue(origDG2)));
         newNode = __rd->manager()->addTerminalNode(newVal);
         __explorationTable.insert(curSitKey, newNode);
         DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
         return newNode;
       }
     }
 
     // ====================================================
     // Normal Exploration
 
     // If only one of the current node is terminal,
     // we have to pursue deeper on the other diagram
     if (sameVar) {
       // If so - meaning it's the same variable - we have to go
       // down on both
       const InternalNode* dg1Node = __DG1->node(origDG1);
       const InternalNode* dg2Node = __DG2->node(origDG2);
 
       const DiscreteVariable* curVar = dg1Node->nodeVar();
       Idx                     varPos = __rd->variablesSequence().pos(curVar);
       NodeId*                 sonsIds =
          static_cast< NodeId* >(ALLOCATE(sizeof(NodeId) * curVar->domainSize()));
 
       for (Idx modality = 0; modality < curVar->domainSize(); modality++) {
         currentSituation.chgVarModality(varPos, modality + 1);
         currentSituation.setDG1Node(dg1Node->son(modality));
         currentSituation.setDG2Node(dg2Node->son(modality));
 
         sonsIds[modality] = __compute(currentSituation, varPos);
       }
 
       newNode = __rd->manager()->addInternalNode(curVar, sonsIds);
 
       __explorationTable.insert(curSitKey, newNode);
       currentSituation.chgVarModality(varPos, 0);
       currentSituation.setDG1Node(origDG1);
       currentSituation.setDG2Node(origDG2);
 
       DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
 
       return newNode;
     }
     // ====================================================
     else {
       const InternalNode* leaddgNode = leaddg->node(leadNodeId);
 
       const DiscreteVariable* curVar = leaddgNode->nodeVar();
       NodeId*                 sonsIds =
          static_cast< NodeId* >(ALLOCATE(sizeof(NodeId) * curVar->domainSize()));
 
       for (Idx modality = 0; modality < curVar->domainSize(); modality++) {
         currentSituation.chgVarModality(leadVarPos, modality + 1);
         (currentSituation.*leadFunction)(leaddgNode->son(modality));
 
         sonsIds[modality] = __compute(currentSituation, leadVarPos);
       }
 
       newNode = __rd->manager()->addInternalNode(curVar, sonsIds);
 
       __explorationTable.insert(curSitKey, newNode);
       currentSituation.chgVarModality(leadVarPos, 0);
       currentSituation.setDG1Node(origDG1);
       currentSituation.setDG2Node(origDG2);
 
       DEALLOCATE(instNeeded, sizeof(short int) * __nbVar);
 
       return newNode;
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ __establishVarOrder()

template<typename GUM_SCALAR , template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy>

INLINE void gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder ( )

private

Computes an order for the final Decision graph that will minimize the number of re exploration.

Definition at line 142 of file regress_tpl.h.

References gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__default, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG1, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG2, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__nbVar, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__primedVars, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__rd, and ALLOCATE.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute().

                               {
     SequenceIteratorSafe< const DiscreteVariable* > fite =
        __DG1->variablesSequence().beginSafe();
     SequenceIteratorSafe< const DiscreteVariable* > site =
        __DG2->variablesSequence().beginSafe();
 
     while (fite != __DG1->variablesSequence().endSafe()
            && site != __DG2->variablesSequence().endSafe()) {
       // Test : if var from first order is already in final order
       // we move onto the next one
       if (__rd->variablesSequence().exists(*fite)) {
         ++fite;
         continue;
       }
 
       // Test : if var from second order is already in final order
       // we move onto the next one
       if (__rd->variablesSequence().exists(*site)) {
         ++site;
         continue;
       }
 
       // Test : is current var of the first order present in the second order.
       // if not we add it to final order
       if (!__DG2->variablesSequence().exists(*fite)
           && !__primedVars->exists(*fite)) {
         __rd->add(**fite);
         ++fite;
         continue;
       }
 
       // Test : is current var of the second order present in the first order.
       // if not we add it to final order
       if (!__DG1->variablesSequence().exists(*site)
           && !__primedVars->exists(*site)) {
         __rd->add(**site);
         ++site;
         continue;
       }
 
       // Test : is current var of the second order present in the first order.
       // if not we add it to final order
       if (*fite == *site) {
         __rd->add(**fite);
         ++fite;
         ++site;
         continue;
       }
 
       // Test : if chosing first order var cost less in terms or re exploration,
       // we chose it
       __rd->add(**fite);
       ++fite;
     }
 
     // Whenever an iterator has finished its sequence,
     // the other may still be in the middle of its one.
     // Hence, this part ensures that any variables remaining
     // will be added to the final sequence if needed.
     if (fite == __DG1->variablesSequence().endSafe()) {
       for (; site != __DG2->variablesSequence().endSafe(); ++site)
         if (!__rd->variablesSequence().exists(*site)) __rd->add(**site);
     } else {
       for (; fite != __DG1->variablesSequence().endSafe(); ++fite)
         if (!__rd->variablesSequence().exists(*fite)) __rd->add(**fite);
     }
 
     // Various initialization needed now that we have a bigger picture
     __nbVar = __rd->variablesSequence().size();
 
     if (__nbVar != 0) {
       __default = static_cast< short int* >(ALLOCATE(sizeof(short int) * __nbVar));
       for (Idx i = 0; i < __nbVar; i++)
         __default[i] = (short int)0;
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ __findRetrogradeVariables()

template<typename GUM_SCALAR , template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy>

INLINE void gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables	(	const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > *	dg,
		HashTable< NodeId, short int * > &	dgInstNeed
	)

private

Establish for each node in both function graph if it has retrograde variables beneath it.

Definition at line 230 of file regress_tpl.h.

References gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__nbVar, gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__rd, ALLOCATE, gum::HashTable< Key, Val, Alloc >::begin(), gum::HashTable< Key, Val, Alloc >::clear(), DEALLOCATE, gum::Link< T >::element(), gum::HashTable< Key, Val, Alloc >::end(), gum::HashTable< Key, Val, Alloc >::insert(), and gum::Link< T >::nextLink().

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute().

                                                         {
     HashTable< NodeId, short int* > nodesVarDescendant;
     Size                            tableSize = Size(__nbVar * sizeof(short int));
 
     for (auto varIter = dg->variablesSequence().rbeginSafe();
          varIter != dg->variablesSequence().rendSafe();
          --varIter) {
       Idx varPos = __rd->variablesSequence().pos(*varIter);
 
       const Link< NodeId >* nodeIter = dg->varNodeListe(*varIter)->list();
       while (nodeIter != nullptr) {
         short int* instantiationNeeded =
            static_cast< short int* >(ALLOCATE(tableSize));
         dgInstNeed.insert(nodeIter->element(), instantiationNeeded);
         short int* varDescendant = static_cast< short int* >(ALLOCATE(tableSize));
         nodesVarDescendant.insert(nodeIter->element(), varDescendant);
         for (Idx j = 0; j < __nbVar; j++) {
           instantiationNeeded[j] = (short int)0;
           varDescendant[j] = (short int)0;
         }
 
 
         varDescendant[varPos] = (short int)1;
         for (Idx modality = 0; modality < dg->node(nodeIter->element())->nbSons();
              ++modality) {
           if (!dg->isTerminalNode(dg->node(nodeIter->element())->son(modality))) {
             short int* sonVarDescendant =
                nodesVarDescendant[dg->node(nodeIter->element())->son(modality)];
             for (Idx varIdx = 0; varIdx < __nbVar; varIdx++) {
               varDescendant[varIdx] += sonVarDescendant[varIdx];
               if (varDescendant[varIdx] && varIdx < varPos)
                 instantiationNeeded[varIdx] = (short int)1;
             }
           }
         }
         nodeIter = nodeIter->nextLink();
       }
     }
 
     for (auto varIter = dg->variablesSequence().beginSafe();
          varIter != dg->variablesSequence().endSafe();
          ++varIter) {
       const Link< NodeId >* nodeIter = dg->varNodeListe(*varIter)->list();
       while (nodeIter != nullptr) {
         for (Idx modality = 0; modality < dg->node(nodeIter->element())->nbSons();
              ++modality) {
           NodeId sonId = dg->node(nodeIter->element())->son(modality);
           if (!dg->isTerminalNode(sonId)) {
             for (Idx varIdx = 0; varIdx < __nbVar; ++varIdx) {
               if (dgInstNeed[nodeIter->element()][varIdx]
                   && nodesVarDescendant[sonId][varIdx]) {
                 dgInstNeed[sonId][varIdx] = (short int)1;
               }
             }
           }
         }
         nodeIter = nodeIter->nextLink();
       }
     }
 
     for (HashTableIterator< NodeId, short int* > it = nodesVarDescendant.begin();
          it != nodesVarDescendant.end();
          ++it) {
       DEALLOCATE(it.val(), tableSize);
     }
 
     nodesVarDescendant.clear();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ compute()

template<typename GUM_SCALAR , template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy>

INLINE MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy > * gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute ( )

Computes and builds the Function Graph that is the result of the operation.

Definition at line 104 of file regress_tpl.h.

Referenced by gum::MDDOperatorStrategy< GUM_SCALAR >::regress(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

                   {
     __establishVarOrder();
     __findRetrogradeVariables(__DG1, __DG1InstantiationNeeded);
     __findRetrogradeVariables(__DG2, __DG2InstantiationNeeded);
 
     Idx* varInst = nullptr;
     if (__nbVar != 0) {
       varInst = static_cast< Idx* >(ALLOCATE(sizeof(Idx) * __nbVar));
       for (Idx i = 0; i < __nbVar; i++)
         varInst[i] = (Idx)0;
     }
 
     O4DGContext conti(varInst, __nbVar);
     conti.setDG1Node(__DG1->root());
     conti.setDG2Node(__DG2->root());
 
     NodeId root = __compute(conti, (Idx)0 - 1);
     __rd->manager()->setRootNode(root);
 
     if (__nbVar != 0) DEALLOCATE(varInst, sizeof(Idx) * __nbVar);
 
     __rd->erase(*__targetVar);
 
     return __rd;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

◆ __combine

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

const COMBINEOPERATOR< GUM_SCALAR > gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__combine

private

The functions to be performed on the leaves.

Definition at line 123 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute().

◆ __default

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

short int* gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__default

private

Just a computationnal trick.

Definition at line 136 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::Regress(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

◆ __DG1

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG1

private

One of the two function graphs used for the operation.

Definition at line 102 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute().

◆ __DG1InstantiationNeeded

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

HashTable< NodeId, short int* > gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG1InstantiationNeeded

private

Table uses to know if a given node of given function graph has retrograde variables.

Definition at line 132 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

◆ __DG2

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

const MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG2

private

The other one.

Definition at line 105 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute().

◆ __DG2InstantiationNeeded

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

HashTable< NodeId, short int* > gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__DG2InstantiationNeeded

private

Definition at line 133 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

◆ __explorationTable

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

HashTable< double, NodeId > gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__explorationTable

private

The hashtable used to know if two pair of nodes have already been visited.

Definition at line 128 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute().

◆ __nbVar

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

Idx gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__nbVar

private

The total number of variable implied in the operation.

Definition at line 120 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::Regress(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

◆ __neutral

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

const GUM_SCALAR gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__neutral

private

The function to be performed on the leaves.

Definition at line 117 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute().

◆ __primedVars

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

const Set< const DiscreteVariable* >* gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__primedVars

private

The set of variables we want to keep at the end.

Definition at line 111 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::Regress().

◆ __project

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

const PROJECTOPERATOR< GUM_SCALAR > gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__project

private

Definition at line 124 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute().

◆ __rd

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

MultiDimFunctionGraph< GUM_SCALAR, TerminalNodePolicy >* gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__rd

private

The resulting function graph.

Definition at line 108 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__establishVarOrder(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::Regress().

◆ __targetVar

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>

const DiscreteVariable* gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__targetVar

private

The variable we work on to eleminate.

Definition at line 114 of file regress.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::compute(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::Regress().

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

agrum/multidim/utils/FunctionGraphUtilities/operators/regress.h
agrum/multidim/utils/FunctionGraphUtilities/operators/regress_tpl.h

Public Member Functions

Detailed Description

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy> class gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >

Constructor & Destructor Documentation

◆ Regress()

◆ ~Regress()

Member Function Documentation

◆ __compute()

◆ __establishVarOrder()

◆ __findRetrogradeVariables()

◆ compute()

Member Data Documentation

◆ __combine

◆ __default

◆ __DG1

◆ __DG1InstantiationNeeded

◆ __DG2

◆ __DG2InstantiationNeeded

◆ __explorationTable

◆ __nbVar

◆ __neutral

◆ __primedVars

◆ __project

◆ __rd

◆ __targetVar

template<typename GUM_SCALAR, template< typename > class COMBINEOPERATOR, template< typename > class PROJECTOPERATOR, template< typename > class TerminalNodePolicy = ExactTerminalNodePolicy>
class gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >