AlignmentList
firstTouch(LifeList *cells1, LifeList *cells2, int firstGen, int ngens) {
int nOld=0, nNew;
int i, lastGen;
AlignmentList list;
lastGen=firstGen+ngens;
assert(firstGen<=lastGen);
list.alignments= (Cell **)calloc(sizeof(Cell *), lastGen-firstGen);
list.firstGen= firstGen;
list.ngens= ngens;
list.nalignments= (int *)calloc(sizeof(int), lastGen-firstGen);
for (i=0; i<firstGen; i++) {
nNew= findTouching(cells1, cells2);
makeWorkSpace(nNew+nOld);
nOld=combineLists(convolution, nNew, oldAlignments, nOld, scratch1);
copyList(scratch1, nOld, oldAlignments, 0);
setValues(oldAlignments, nOld, 1);
generate(cells1);
generate(cells2);
}
for (; i<lastGen; i++) {
nNew= findTouching(cells1, cells2);
nNew= subtractLists(oldAlignments, nOld, convolution, nNew);
list.alignments[i-firstGen]=
(Cell *)calloc(sizeof(Cell), nNew);
list.nalignments[i-firstGen]=
copyList(convolution, nNew, list.alignments[i-firstGen], 0);
makeWorkSpace(nNew+nOld);
nOld=combineLists(convolution, nNew, oldAlignments, nOld, scratch1);
copyList(scratch1, nOld, oldAlignments, 0);
setValues(oldAlignments, nOld, 1);
generate(cells1);
generate(cells2);
}
return list;
}
void test()
{
auto lsts = run();
for (auto lst : lsts)
print(lst);
auto sums = combineLists(lsts);
for (auto s : sums)
std::cout << s << ", ";
std::cout << std::endl;
}
void mergeLifeLists(LifeList *cells1, LifeList *cells2, int transl) {
/* note: destroys neighborhood values */
copyList(cells2->cellList, cells2->ncells, cells2->neighborhoods, transl);
resizeIfNeeded(cells1, cells1->ncells+cells2->ncells);
cells1->ncells=combineLists(cells1->cellList, cells1->ncells,
cells2->neighborhoods, cells2->ncells,
cells1->neighborhoods);
copyList(cells1->neighborhoods, cells1->ncells, cells1->cellList, 0);
}
int placeNewPerturbor(LifeList *seed, LifeList *perturbs,
Cell *placed, int nplaced, int newperturb,
int initialGen, int finalGen, Cell *aligns) {
int i, j;
int nconv, nold, naligns, nelim;
copyLifeList(perturbs+newperturb, &thisperturb);
copyLifeList(&thisperturb, &spread1);
spread(&spread1, 1);
copyLifeList(&spread1, &spread2);
spread(&spread2, 1);
removeLifeList(&spread2, &spread1, 0);
copyLifeList(seed, &cells);
setupPerturbors(perturbs, placed, nplaced, &perturbcells, &cells);
naligns=0;
for (i=0; i<finalGen; i++) {
nconv=convolve(spread2.cellList, spread2.ncells,
cells.cellList, cells.ncells,
&convolution, &scratch1, &scratch2,
makeWorkSpace);
makeWorkSpace(spread1.ncells*cells.ncells);
nold=convolve(spread1.cellList, spread1.ncells,
cells.cellList, cells.ncells,
&oldAlignments, &scratch1, &scratch2,
makeWorkSpace);
nconv=subtractLists(oldAlignments, nold, convolution, nconv);
nconv=subtractLists(aligns, naligns, convolution, nconv);
setValues(convolution, nconv, i);
nelim=0;
for (j=0; j<nconv; j++) {
copyLifeList(&cells, &tmp);
intersectLifeLists(&tmp, &spread2, convolution[j].position);
if (interact(&tmp, &thisperturb, convolution[j].position)) {
convolution[nelim++]=convolution[j];
}
}
makeWorkSpace(nelim + naligns);
naligns=combineLists(convolution, nelim, aligns, naligns, scratch1);
copyList(scratch1, naligns, aligns, 0);
if (i == 0) {
setValues(oldAlignments, nold, -1);
makeWorkSpace(nold + naligns);
naligns=combineLists(oldAlignments, nold, aligns, naligns, scratch1);
copyList(scratch1, naligns, aligns, 0);
}
generate(&cells);
if (broken(cells.cellList, cells.ncells,
perturbcells.cellList, perturbcells.ncells))
break;
}
naligns=removeLessThan(aligns, naligns, initialGen);
return naligns;
}
