gum::prm::GSpan< GUM_SCALAR >::LabelSort Class Reference

Private class used to sort LabelData using STL sort algorithms. More...

Collaboration diagram for gum::prm::GSpan< GUM_SCALAR >::LabelSort:

Public Attributes
GSpan *	gspan
	A pointer over an instance of the GSpan class using this class. More...

Public Member Functions
	LabelSort (GSpan *my_gspan)
	Default constructor. More...
	LabelSort (const LabelSort &source)
	Copy constructor. More...
	~LabelSort ()
	Destructor. More...
bool	operator() (gspan::LabelData *i, gspan::LabelData *j)
	Returns true if i's cost is lesser than j's. More...

Detailed Description

template<typename GUM_SCALAR>
class gum::prm::GSpan< GUM_SCALAR >::LabelSort

Private class used to sort LabelData using STL sort algorithms.

Definition at line 283 of file gspan.h.

Constructor & Destructor Documentation

LabelSort() [1/2]

template<typename GUM_SCALAR >

INLINE gum::prm::GSpan< GUM_SCALAR >::LabelSort::LabelSort

(

GSpan *

my_gspan

)

Default constructor.

Parameters

my_gspan

A pointer over the GSpan using this class.

Definition at line 442 of file gspan_tpl.h.

                                                                  :
        gspan(my_gspan) {
      GUM_CONSTRUCTOR(GSpan< GUM_SCALAR >::LabelSort);
    }

LabelSort() [2/2]

template<typename GUM_SCALAR >

INLINE gum::prm::GSpan< GUM_SCALAR >::LabelSort::LabelSort

(

const LabelSort &

source

)

Copy constructor.

Parameters

source

The copied LabelSort.

Definition at line 448 of file gspan_tpl.h.

                                                                          :
        gspan(source.gspan) {
      GUM_CONS_CPY(GSpan< GUM_SCALAR >::LabelSort);
    }

~LabelSort()

template<typename GUM_SCALAR >

INLINE gum::prm::GSpan< GUM_SCALAR >::LabelSort::~LabelSort

(

)

Destructor.

Definition at line 454 of file gspan_tpl.h.

                                                    {
      GUM_DESTRUCTOR(GSpan< GUM_SCALAR >::LabelSort);
    }

Member Function Documentation

operator()()

template<typename GUM_SCALAR >

INLINE bool gum::prm::GSpan< GUM_SCALAR >::LabelSort::operator()	(	gspan::LabelData *	i,
		gspan::LabelData *	j
	)

Returns true if i's cost is lesser than j's.

Parameters

i	A LabelData.
j	A LabelData.

Returns

true if i's cost is above than j's cost.

Definition at line 459 of file gspan_tpl.h.

References gum::prm::GSpan< GUM_SCALAR >::__tree, and gum::prm::GSpan< GUM_SCALAR >::LabelSort::gspan.

                                                                              {
      // We want a descending order
      // return gspan->__cost[i] > gspan->__cost[j];
      return gspan->__tree.strategy()(i, j);
    }

Member Data Documentation

gspan

template<typename GUM_SCALAR>

GSpan* gum::prm::GSpan< GUM_SCALAR >::LabelSort::gspan

A pointer over an instance of the GSpan class using this class.

Definition at line 310 of file gspan.h.

Referenced by gum::prm::GSpan< GUM_SCALAR >::LabelSort::operator()().

---

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

• agrum/PRM/inference/gspan.h
• agrum/PRM/inference/gspan_tpl.h