Private structure to represent data about a pattern. More...

Collaboration diagram for gum::prm::StructuredInference< GUM_SCALAR >::PData:

Public Attributes
const gspan::Pattern &	pattern
	The pattern for which this represents data about it. More...

GSpan< GUM_SCALAR >::MatchedInstances &	matches
	A reference over the usable matches of pattern. More...

UndiGraph	graph
	A yet to be triangulated undigraph. More...

NodeProperty< Size >	mod
	The pattern's variables modalities. More...

Bijection< NodeId, std::string >	node2attr
	A bijection to easily keep track between graph and attributes, its of the form instance_name DOT attr_name. More...

NodeProperty< std::pair< Idx, std::string > >	map
	To ease translating potentials from one match to another. More...

Bijection< NodeId, const DiscreteVariable *>	vars
	Bijection between graph's nodes and their corresponding DiscreteVariable, for inference purpose. More...

NodeProperty< Potential< GUM_SCALAR > *>	pots
	To handle barren nodes. More...

Set< NodeId >	barren
	Set of barren nodes. More...

Public Member Functions
	PData (const gspan::Pattern &p, typename GSpan< GUM_SCALAR >::MatchedInstances &m)
	Default constructor. More...

	PData (const PData &source)
	Copy constructor. More...

	~PData ()
	Destructor. More...

NodeSet &	inners ()
	Returns the set of inner nodes. More...

NodeSet &	obs ()
	Returns the set of inner and observed nodes given all the matches of pattern. More...

NodeSet &	outputs ()
	Returns the set of outputs nodes given all the matches of pattern. More...

NodeSet &	queries ()
	Returns the set of queried nodes given all the matches of pattern. More...

const List< NodeSet > *	partial_order ()

Detailed Description

template<typename GUM_SCALAR>
struct gum::prm::StructuredInference< GUM_SCALAR >::PData

Private structure to represent data about a pattern.

Definition at line 156 of file structuredInference.h.

Constructor & Destructor Documentation

◆ PData() [1/2]

template<typename GUM_SCALAR >

gum::prm::StructuredInference< GUM_SCALAR >::PData::PData	(	const gspan::Pattern &	p,
		typename GSpan< GUM_SCALAR >::MatchedInstances &	m
	)

Default constructor.

Definition at line 816 of file structuredInference_tpl.h.

                                                         :
         pattern(p),
         matches(m), __real_order(0) {
       GUM_CONSTRUCTOR(StructuredInference< GUM_SCALAR >::PData);
 
       for (int i = 0; i < 4; ++i)
         __partial_order.push_front(NodeSet());
     }

◆ PData() [2/2]

template<typename GUM_SCALAR>

gum::prm::StructuredInference< GUM_SCALAR >::PData::PData ( const PData & source )

Copy constructor.

◆ ~PData()

template<typename GUM_SCALAR >

INLINE gum::prm::StructuredInference< GUM_SCALAR >::PData::~PData ( )

Destructor.

Definition at line 1005 of file structuredInference_tpl.h.

                                                           {
       GUM_DESTRUCTOR(StructuredInference< GUM_SCALAR >::PData);
     }

Member Function Documentation

◆ inners()

template<typename GUM_SCALAR>

NodeSet& gum::prm::StructuredInference< GUM_SCALAR >::PData::inners ( )

inline

Returns the set of inner nodes.

Definition at line 189 of file structuredInference.h.

Referenced by gum::prm::StructuredInference< GUM_SCALAR >::__buildPatternGraph(), gum::prm::StructuredInference< GUM_SCALAR >::__eliminateObservedNodes(), gum::prm::StructuredInference< GUM_SCALAR >::__eliminateObservedNodesInSource(), gum::prm::StructuredInference< GUM_SCALAR >::__insertNodeInElimLists(), gum::prm::StructuredInference< GUM_SCALAR >::__removeBarrenNodes(), and gum::prm::StructuredInference< GUM_SCALAR >::__removeNode().

189 { return __partial_order[0]; }

gum::prm::StructuredInference::PData::__partial_order

List< NodeSet > __partial_order

We'll use a PartialOrderedTriangulation with three sets: output, nodes and obs with children outside ...

Definition: structuredInference.h:209

Here is the caller graph for this function:

◆ obs()

template<typename GUM_SCALAR>

NodeSet& gum::prm::StructuredInference< GUM_SCALAR >::PData::obs ( )

inline

Returns the set of inner and observed nodes given all the matches of pattern.

Definition at line 192 of file structuredInference.h.

Referenced by gum::prm::StructuredInference< GUM_SCALAR >::__buildPatternGraph(), gum::prm::StructuredInference< GUM_SCALAR >::__eliminateObservedNodes(), gum::prm::StructuredInference< GUM_SCALAR >::__eliminateObservedNodesInSource(), and gum::prm::StructuredInference< GUM_SCALAR >::__insertNodeInElimLists().

192 { return __partial_order[1]; }

gum::prm::StructuredInference::PData::__partial_order

List< NodeSet > __partial_order

We'll use a PartialOrderedTriangulation with three sets: output, nodes and obs with children outside ...

Definition: structuredInference.h:209

Here is the caller graph for this function:

◆ outputs()

template<typename GUM_SCALAR>

NodeSet& gum::prm::StructuredInference< GUM_SCALAR >::PData::outputs ( )

inline

Returns the set of outputs nodes given all the matches of pattern.

Definition at line 194 of file structuredInference.h.

Referenced by gum::prm::StructuredInference< GUM_SCALAR >::__buildPatternGraph(), and gum::prm::StructuredInference< GUM_SCALAR >::__insertNodeInElimLists().

194 { return __partial_order[2]; }

gum::prm::StructuredInference::PData::__partial_order

List< NodeSet > __partial_order

We'll use a PartialOrderedTriangulation with three sets: output, nodes and obs with children outside ...

Definition: structuredInference.h:209

Here is the caller graph for this function:

◆ partial_order()

template<typename GUM_SCALAR >

const List< NodeSet > * gum::prm::StructuredInference< GUM_SCALAR >::PData::partial_order ( )

Definition at line 839 of file structuredInference_tpl.h.

References gum::prm::StructuredInference< GUM_SCALAR >::PData::__partial_order, and gum::prm::StructuredInference< GUM_SCALAR >::PData::__real_order.

                                                              {
       if (!__real_order) {
         __real_order = new List< NodeSet >();
 
         for (const auto set : __partial_order)
           if (set.size() > 0) __real_order->insert(set);
       }
 
       return __real_order;
     }