PROMETHEE Solution. More...

#include <rpromsol.h>

Inheritance diagram for RPromSol:
[legend]
Collaboration diagram for RPromSol:
[legend]

Public Member Functions

 RPromSol (size_t id, size_t nbcrit=30)
 
 RPromSol (size_t id, const RString &name, size_t nbcrit=30)
 
int Compare (const RPromSol &sol) const
 
int Compare (const RPromSol *sol) const
 
int Compare (const size_t id) const
 
int Compare (const RString &name) const
 
double GetFi (void) const
 
double GetFiPlus (void) const
 
double GetFiMinus (void) const
 
size_t GetId (void) const
 
RString GetName (void) const
 
virtual ~RPromSol (void)
 

Private Attributes

size_t Id
 
RString Name
 
double Fi
 
double FiPlus
 
double FiMinus
 

Additional Inherited Members

- Protected Member Functions inherited from RContainer< RPromCritValue, true, false >
 RContainer (size_t m, size_t i=0)
 
 RContainer (const RContainer< RPromCritValue, true, false > &src)
 
 RContainer (const RContainer< RPromCritValue, false, false > &src)
 
int Compare (const RContainer< RPromCritValue, true, false > &) const
 
size_t GetNb (void) const
 
size_t GetMaxPos (void) const
 
size_t GetMaxNb (void) const
 
size_t GetIncNb (void) const
 
bool VerifyIndex (size_t idx) const
 
void VerifyTab (size_t max=0)
 
void Clear (size_t m=0, size_t i=0, bool force=false)
 
void ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max)
 
void ReOrder (int sortOrder(const void *, const void *))
 
void ReOrder (void)
 
void Exchange (size_t pos1, size_t pos2)
 
void Shift (size_t idx, bool reverse)
 
void Transfer (RContainer< RPromCritValue, a, o > &src)
 
RContaineroperator= (const RContainer< RPromCritValue, true, false > &src)
 
RContaineroperator= (const RContainer< RPromCritValue, false, false > &src)
 
void Copy (const RContainer< RPromCritValue, a, false > &src)
 
RContaineroperator+= (const RContainer< RPromCritValue, a, o > &src)
 
size_t GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, size_t min=0, size_t max=0) const
 
const RPromCritValueoperator[] (size_t idx) const
 
RPromCritValueoperator[] (size_t idx)
 
const RPromCritValueGetPtrAt (size_t idx) const
 
RPromCritValueGetPtrAt (size_t idx)
 
RPromCritValueGetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
RPromCritValueGetPtr (const TUse &tag, size_t min=0, size_t max=0) const
 
RPromCritValueGetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
RPromCritValueGetInsertPtr (const TUse &tag, size_t min=0, size_t max=0)
 
RPromCritValueGetInsertPtrAt (const TUse &tag, size_t pos)
 
RContainer< RPromCritValue,
false, false > * 
GetPtrs (const TUse &tag, size_t min=0, size_t max=0) const
 
size_t GetTab (const void **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (void **tab, size_t min=0, size_t max=0)
 
size_t GetTab (const RPromCritValue **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (RPromCritValue **tab, size_t min=0, size_t max=0)
 
void InsertPtrAt (RPromCritValue *ins, size_t pos, bool del)
 
void InsertPtrAt (RPromCritValue *ins, size_t pos)
 
void InsertPtr (RPromCritValue *ins, bool del=false, size_t min=0, size_t max=0)
 
void DeletePtrAt (size_t pos, bool shift, bool del)
 
void DeletePtrAt (size_t pos, bool shift)
 
void DeletePtrAt (size_t pos)
 
void DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, size_t min=0, size_t max=0)
 
void Inter (const iRContainer< RPromCritValue > &src1, const iRContainer< RPromCritValue > &src2)
 
void Union (const iRContainer< RPromCritValue > &src1, const iRContainer< RPromCritValue > &src2)
 
virtual ~RContainer (void)
 
- Protected Member Functions inherited from iRContainer< C >
void Create (const iRContainer< C > &src)
 
iRContainerNormalCopy (const iRContainer< C > &src)
 
void DeepCopy (const iRContainer< C > &src)
 
iRContainerAdd (const iRContainer< C > &src)
 
size_t GetNb (void) const
 
size_t GetMaxPos (void) const
 
size_t GetMaxNb (void) const
 
size_t GetIncNb (void) const
 
bool VerifyIndex (size_t idx) const
 
void VerifyTab (size_t max=0)
 
void Clear (size_t m=0, size_t i=0, bool force=false)
 
void ReOrder (int sortOrder(const void *, const void *), size_t min, size_t max)
 
void ReOrder (int sortOrder(const void *, const void *))
 
void ReOrder (void)
 
void Exchange (size_t pos1, size_t pos2)
 
void Shift (size_t idx, bool reverse)
 
void Transfer (iRContainer< C > &src)
 
iRContaineroperator= (const iRContainer< C > &src)
 
void Copy (const iRContainer< C > &src)
 
iRContaineroperator+= (const iRContainer< C > &src)
 
size_t GetIndex (bool order, const TUse &tag, bool &find, size_t min=0, size_t max=0) const
 
size_t GetIndex (const TUse &tag, bool &find, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
bool IsIn (const TUse &tag, size_t min=0, size_t max=0) const
 
const C * operator[] (size_t idx) const
 
C * operator[] (size_t idx)
 
const C * GetPtrAt (size_t idx) const
 
C * GetPtrAt (size_t idx)
 
C * GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const
 
C * GetPtr (const TUse &tag, size_t min=0, size_t max=0) const
 
C * GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
C * GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0)
 
C * GetInsertPtrAt (const TUse &tag, size_t pos)
 
size_t GetTab (const void **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (void **tab, size_t min=0, size_t max=0)
 
size_t GetTab (const C **tab, size_t min=0, size_t max=0) const
 
size_t GetTab (C **tab, size_t min=0, size_t max=0)
 
void InsertPtrAt (C *ins, size_t pos, bool del)
 
void InsertPtrAt (C *ins, size_t pos)
 
void InsertPtr (C *ins, bool del=false, size_t min=0, size_t max=0)
 
void DeletePtrAt (size_t pos, bool shift, bool del)
 
void DeletePtrAt (size_t pos, bool shift)
 
void DeletePtrAt (size_t pos)
 
void DeletePtr (const TUse &tag, bool sortkey, bool del, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0)
 
void DeletePtr (const TUse &tag, size_t min=0, size_t max=0)
 
void Inter (const iRContainer< C > &src1, const iRContainer< C > &src2)
 
void Union (const iRContainer< C > &src1, const iRContainer< C > &src2)
 
virtual ~iRContainer (void)
 
- Static Protected Member Functions inherited from RContainer< RPromCritValue, true, false >
static int SortOrder (const void *a, const void *b)
 
- Static Protected Member Functions inherited from iRContainer< C >
static int SortOrder (const void *a, const void *b)
 
- Protected Attributes inherited from iRContainer< C >
C ** Tab
 
size_t NbPtr
 
size_t MaxPtr
 
size_t LastPtr
 
size_t IncPtr
 

Detailed Description

PROMETHEE Solution.

The RPromSol class provides a representation of a solution in the PROMETHEE method.

Constructor & Destructor Documentation

RPromSol ( size_t  id,
size_t  nbcrit = 30 
)

Construct a PROMETHEE solution.

Parameters
idIdentifier of the solution.
nbcritNumber of criteria.
RPromSol ( size_t  id,
const RString name,
size_t  nbcrit = 30 
)

Construct a PROMETHEE solution.

Parameters
idIdentifier of the solution.
nameName of the solution
nbcritNumber of criteria.
virtual ~RPromSol ( void  )
virtual

Destruct a PROMETHEE solution.

Member Function Documentation

int Compare ( const RPromSol sol) const

Compare two PROMETHEE solutions.

Parameters
solThe solution used for the comparison.
Returns
The function returns -1,0,+1 depends if the identifier of the current solution is less, equal or greater than the one passed as argument.
int Compare ( const RPromSol sol) const

Compare two PROMETHEE solutions.

Parameters
solThe solution used for the comparison.
Returns
The function returns -1,0,+1 depends if the identifier of the current solution is less, equal or greater than the one passed as argument.
int Compare ( const size_t  id) const

Compare the identifier of the PROMETHEE solution with another identifier.

Parameters
idThe identifier used for the comparison.
Returns
The function returns -1,0,+1 depends if the identifier of the current solution is less, equal or greater than the one passed as argument.
int Compare ( const RString name) const

Compare the name of the PROMETHEE solution with another string.

Parameters
nameThe string used for the comparison.
Returns
The function returns -1,0,+1 depends if the identifier of the current solution is less, equal or greater than the one passed as argument.
double GetFi ( void  ) const
Returns
Fi of the solution.
double GetFiPlus ( void  ) const
Returns
Fi+ of the solution.
double GetFiMinus ( void  ) const
Returns
Fi- of the solution.
size_t GetId ( void  ) const
Returns
Identifier of the solution.
RString GetName ( void  ) const

Return the name of the solution.

Member Data Documentation

size_t Id
private

The identifier of the solution.

RString Name
private

Name of the solution.

double Fi
private

The fi of the solution.

double FiPlus
private

The fi+ of the solution.

double FiMinus
private

The fi- of the solution.