|
| RChromoSG (cInst *inst, size_t id) |
|
virtual void | Init (cThreadData *thData) |
|
virtual void | Evaluate (void) |
|
double | ReAllocate (void) |
|
size_t | CalcNewProtosNb (void) |
|
void | DoKMeans (void) |
|
void | DivideWorstObjects (void) |
|
void | MergeBestGroups (void) |
|
void | TreatSocialObjects (void) |
|
void | kMeansOptimisation (void) |
|
virtual void | Optimisation (void) |
|
virtual void | LocalOptimisation (void) |
|
bool | SameGroup (size_t obj1, size_t obj2) const |
|
virtual void | Copy (const cChromo &chromo) |
|
double | GetSimJ (void) |
|
double | GetAgreementCriterion (void) const |
|
double | GetDisagreementCriterion (void) const |
|
double | GetFi (void) const |
|
double | GetFiPlus (void) const |
|
double | GetFiMinus (void) const |
|
virtual | ~RChromoSG (void) |
|
| RChromoG (cInst *inst, size_t id) |
|
virtual void | Clear (void) |
|
virtual void | RandomConstruct (void) |
|
virtual void | Crossover (cChromo *parent1, cChromo *parent2) |
|
virtual void | Mutation (void) |
|
virtual void | Inversion (void) |
|
virtual void | Modify (void) |
|
virtual void | Verify (void) |
|
virtual | ~RChromoG (void) |
|
| RChromo (cInst *inst, size_t id) |
|
virtual void | StrongMutation (void) |
|
virtual void | Print (void) |
|
virtual | ~RChromo (void) |
|
| RGroups (RCursor< cObj > objs, const size_t max) |
|
void | Init (void) |
|
void | ClearGroups (void) |
|
cGroup * | ReserveGroup (size_t id=cNoRef) |
|
void | ReleaseGroup (cGroup *group) |
|
void | InsertObj (cGroup *to, cObj *obj) |
|
void | InsertObjs (const cGroup *from, cGroup *to) |
|
void | DeleteObj (cGroup *from, cObj *obj) |
|
void | DeleteObjs (cGroup *grp) |
|
cGroup * | GetGroup (size_t id) const |
|
cGroup * | GetGroup (const cObj *obj) const |
|
cObj * | GetObj (size_t idx) const |
|
RCursor< cObj > | GetObjs (const RGroup< cGroup, cObj, cChromo > &grp) const |
|
void | CopyGrouping (const RGroups &grps) |
|
void | ComputeOrd (void) |
|
bool | SameGroupment (const RGroups *grps) const |
|
RCursor< cObj > | GetObjsCursor (void) const |
|
RCursor< cGroup > | GetUsedGroups (void) const |
|
double | ComputeAdjustedRandIndex (const cChromo &groups) const |
|
virtual | ~RGroups (void) |
|
| RContainer (size_t m, size_t i=0) |
|
| RContainer (const RContainer< cGroup, true, false > &src) |
|
| RContainer (const RContainer< cGroup, false, false > &src) |
|
int | Compare (const RContainer< cGroup, 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< cGroup, a, o > &src) |
|
RContainer & | operator= (const RContainer< cGroup, true, false > &src) |
|
RContainer & | operator= (const RContainer< cGroup, false, false > &src) |
|
void | Copy (const RContainer< cGroup, a, false > &src) |
|
RContainer & | operator+= (const RContainer< cGroup, 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 cGroup * | operator[] (size_t idx) const |
|
cGroup * | operator[] (size_t idx) |
|
const cGroup * | GetPtrAt (size_t idx) const |
|
cGroup * | GetPtrAt (size_t idx) |
|
cGroup * | GetPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) const |
|
cGroup * | GetPtr (const TUse &tag, size_t min=0, size_t max=0) const |
|
cGroup * | GetInsertPtr (const TUse &tag, bool sortkey, size_t min=0, size_t max=0) |
|
cGroup * | GetInsertPtr (const TUse &tag, size_t min=0, size_t max=0) |
|
cGroup * | GetInsertPtrAt (const TUse &tag, size_t pos) |
|
RContainer< cGroup, 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 cGroup **tab, size_t min=0, size_t max=0) const |
|
size_t | GetTab (cGroup **tab, size_t min=0, size_t max=0) |
|
void | InsertPtrAt (cGroup *ins, size_t pos, bool del) |
|
void | InsertPtrAt (cGroup *ins, size_t pos) |
|
void | InsertPtr (cGroup *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< cGroup > &src1, const iRContainer< cGroup > &src2) |
|
void | Union (const iRContainer< cGroup > &src1, const iRContainer< cGroup > &src2) |
|
virtual | ~RContainer (void) |
|
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) |
|
template<class cInst, class cChromo, class cThreadData, class cGroup, class cObj>
singleton R::RChromoSG< cInst, cChromo, cThreadData, cGroup, cObj >
Similarity-based Grouping Genetic Algorithm Chromosome.
The RChromoSG class provides a representation for a chromosome for the similarity-based grouping genetic algorithm.