GeneticCode Class Reference

#include <GeneticCode.h>

Collaboration diagram for GeneticCode:

[legend]

Public Member Functions
	GeneticCode ()
	Constructor which initializes all fields with randomized values.
	GeneticCode (GeneticCode const *c)
	Copy constructor.
virtual	~GeneticCode ()
	Destructor.
unsigned int	getSize ()
	Get the size.
unsigned int	getAggressiveness ()
	Get the aggressiveness.
unsigned int	getGreedy ()
	Get the greedy.
unsigned int	getReasonable ()
	Get the reasonable.
GeneticCode *	mutate () const
	Mutate the code in order to produce another code.
GeneticCode *	crossover (GeneticCode *c) const
	Cross the current code with a second one to create a third one.
void	print ()
	Debug function, print the genetic code.
Private Attributes
union GeneticCode::__code	_code
	The genetic code.
Data Structures
union	__code
	The genetic code. More...

---

Detailed Description

< Genetic code definition

Definition at line 45 of file GeneticCode.h.

---

Constructor & Destructor Documentation

GeneticCode::GeneticCode

(

GeneticCode const *

c

)

Copy constructor.

Parameters:

c

genetic code to copy

Definition at line 52 of file GeneticCode.cpp.

: _code(c->_code) {}

---

Member Function Documentation

unsigned int GeneticCode::getSize

(

)

[inline]

Get the size.

Returns:

size

Definition at line 106 of file GeneticCode.h.

References _code, GeneticCode::__code::bitfield, and GeneticCode::__code::_bitfield::size.

Referenced by GeneticReplication::createWorshiper().

{ return _code.bitfield.size; }

Here is the caller graph for this function:

unsigned int GeneticCode::getAggressiveness

(

)

[inline]

Get the aggressiveness.

Returns:

aggressiveness

Definition at line 113 of file GeneticCode.h.

References _code, GeneticCode::__code::_bitfield::aggressiveness, and GeneticCode::__code::bitfield.

Referenced by GeneticBehaviour::think().

{ return _code.bitfield.aggressiveness; }

Here is the caller graph for this function:

unsigned int GeneticCode::getGreedy

(

)

[inline]

Get the greedy.

Returns:

greedy

Definition at line 120 of file GeneticCode.h.

References _code, GeneticCode::__code::bitfield, and GeneticCode::__code::_bitfield::greedy.

Referenced by GeneticBehaviour::think().

{ return _code.bitfield.greedy; }

Here is the caller graph for this function:

unsigned int GeneticCode::getReasonable

(

)

[inline]

Get the reasonable.

Returns:

reasonable

Definition at line 128 of file GeneticCode.h.

References _code, GeneticCode::__code::bitfield, and GeneticCode::__code::_bitfield::reasonable.

Referenced by GeneticBehaviour::think().

{ return _code.bitfield.reasonable; }

Here is the caller graph for this function:

GeneticCode * GeneticCode::mutate

(

)

const

Mutate the code in order to produce another code.

Returns:

a new genetic modified code

Definition at line 58 of file GeneticCode.cpp.

References _code, GeneticCode(), NB_BITS_GENETICCODE, GeneticCode::__code::value, and Random::value().

Referenced by GeneticReplication::getNewWorshipers().

                                       {
  GeneticCode * new_code = new GeneticCode(this);

  //Generate a number between 0 and the number of bits of the structure
  int n = Random::value() % NB_BITS_GENETICCODE;

  //Flip the nth bit of the code
  if((_code.value >> n) & 1){
    new_code->_code.value &= ~(1 << n);//1 -> 0
  } else {
    new_code->_code.value |= (1 << n);//0 -> 1
  }

  return new_code;
}

Here is the call graph for this function:

Here is the caller graph for this function:

GeneticCode * GeneticCode::crossover

(

GeneticCode *

c

)

const

Cross the current code with a second one to create a third one.

Parameters:

c

the second code with wich the current code will be cross

Returns:

a new genetic modified code

Definition at line 75 of file GeneticCode.cpp.

References _code, GeneticCode(), NB_BITS_GENETICCODE, GeneticCode::__code::value, and Random::value().

                                                         {
  //Copy the current code into the new one
  GeneticCode * new_code = new GeneticCode(this);

  //For each bit of the new code, either we keep it, either we take the
  //corresponding bit of c (crossover operation)
  for(int n = 0; n < NB_BITS_GENETICCODE; n++){

    //Generate a number. If it is odd, we take the corresponding bit of c : c[n]
    if(Random::value() & 1){
      if((c->_code.value >> n) & 1){ //If c[n] == 1, then new_code[c] = 1
        new_code->_code.value |= (1 << n);
      } else { //If c[n] == 0, then new_code[c] = 0
        new_code->_code.value &= ~(1 << n);
      }
    } //else, we keep that bit

  }

  return new_code;
}

Here is the call graph for this function:

---

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

• src/GeneticCode.h
• src/GeneticCode.cpp

---