#include <Fitness.h>

Inheritance diagram for Fitness:

Public Member Functions
virtual bool	isBetterThan (FitnessP)=0
virtual Fitness *	copy ()=0
	object copy (for duplication of an individual)
bool	isValid ()
void	setInvalid ()
virtual void	setValue (double value)
virtual double	getValue ()
virtual void	write (XMLNode &)
virtual void	read (XMLNode &xFitness)
Public Attributes
unsigned int	cid
	coherence index, used in asynchronous parallel algoritmhs
Protected Attributes
bool	valid_
	is fitness value up-to-date
double	value_
	actual fitness value
Individual *	individual_

Detailed Description

Fitness base class.

A fitness object is used to represent individual's appropriateness for the problem.

Definition at line 14 of file Fitness.h.

Member Function Documentation

virtual double Fitness::getValue ( ) [inline, virtual]

Return fitness value.

Definition at line 62 of file Fitness.h.

virtual bool Fitness::isBetterThan ( FitnessP ) [pure virtual]

Mandatory comparison operator.

Returns:: true if this object is 'better' than the given parameter fitness object

Implemented in FitnessMax, and FitnessMin.

bool Fitness::isValid ( ) [inline]

Is fitness object up to date.

Definition at line 44 of file Fitness.h.

virtual void Fitness::read ( XMLNode & xFitness ) [inline, virtual]

Read single fitness value from XML node. If the value is undefined (e.g. when reading unevaluated individual from XMLNode), validity is set to false.

Definition at line 74 of file Fitness.h.

void Fitness::setInvalid ( ) [inline]

Set fitness object to invalid state (called after any change of individual's genotype).

Definition at line 50 of file Fitness.h.

virtual void Fitness::setValue ( double value ) [inline, virtual]

Set fitness value.

Definition at line 56 of file Fitness.h.

virtual void Fitness::write ( XMLNode & ) [inline, virtual]

Write fitness object to XMLNode.

Reimplemented in FitnessMax, and FitnessMin.

Definition at line 68 of file Fitness.h.

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