|
using | URBG = wtl::sfmt19937_64 |
|
◆ assign()
void edal::Patch::assign |
( |
size_t |
n, |
|
|
const Individual & |
founder |
|
) |
| |
Fill this patch with the same number of females and males.
- Parameters
-
n | The number of inital individuals in this patch |
founder | The individual to be copied |
◆ emplace_back()
void edal::Patch::emplace_back |
( |
Individual && |
ind | ) |
|
|
inline |
Add an individual to this patch.
- Parameters
-
◆ empty()
bool edal::Patch::empty |
( |
| ) |
const |
|
inline |
- Returns
- Whether this patch is empty or not
◆ make_destinations()
std::vector< std::pair< unsigned int, unsigned int > > edal::Patch::make_destinations |
( |
size_t |
n, |
|
|
size_t |
row, |
|
|
size_t |
col, |
|
|
size_t |
num_rows, |
|
|
size_t |
num_cols |
|
) |
| const |
Change row/col with probability \(m\) = Individual::MIGRATION_RATE_.
With probability \( m > 0 \), each offspring becomes a "migrant." Each migrant goes to one of the 8 neighboring patches. For patches at the boundary, the probability \( m \) is reduced according to the number of neighbors they have.
◆ size()
size_t edal::Patch::size |
( |
| ) |
const |
|
inline |
- Returns
- The number of individuals in this patch
The documentation for this class was generated from the following files: