|
| 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) |
|
RContainer & | operator= (const RContainer< RPromCritValue, true, false > &src) |
|
RContainer & | operator= (const RContainer< RPromCritValue, false, false > &src) |
|
void | Copy (const RContainer< RPromCritValue, a, false > &src) |
|
RContainer & | operator+= (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 RPromCritValue * | operator[] (size_t idx) const |
|
RPromCritValue * | operator[] (size_t idx) |
|
const RPromCritValue * | GetPtrAt (size_t idx) const |
|
RPromCritValue * | GetPtrAt (size_t idx) |
|
RPromCritValue * | GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
|
RPromCritValue * | GetPtr (const TUse &tag, size_t min=0, size_t max=0) const |
|
RPromCritValue * | GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
|
RPromCritValue * | GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0) |
|
RPromCritValue * | GetInsertPtrAt (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) |
|
void | Create (const iRContainer< C > &src) |
|
iRContainer & | NormalCopy (const iRContainer< C > &src) |
|
void | DeepCopy (const iRContainer< C > &src) |
|
iRContainer & | Add (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) |
|
iRContainer & | operator= (const iRContainer< C > &src) |
|
void | Copy (const iRContainer< C > &src) |
|
iRContainer & | operator+= (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 int | SortOrder (const void *a, const void *b) |
|
static int | SortOrder (const void *a, const void *b) |
|
C ** | Tab |
|
size_t | NbPtr |
|
size_t | MaxPtr |
|
size_t | LastPtr |
|
size_t | IncPtr |
|
PROMETHEE Solution.
The RPromSol class provides a representation of a solution in the PROMETHEE method.