void partialOscillation(LifeList *cells, LifeList *working,
int testUpTo, int testPhases,
int nmatches, PartialOscillatorDesc *posc) {
int i,j;
History hist;
Transformation normT;
Transformation oscT;
normT= normalize(cells);
hist= makeHistory(cells, testUpTo+testPhases);
initMatchList(posc, nmatches);
for (i=1; i<=testUpTo; i++) {
int matchSize;
int tx, ty;
for (j=0; j<testPhases; j++) {
getGeneration(cells, hist, j);
getGeneration(working, hist, i+j);
bestMatches(cells, working, i, nmatches, posc);
}
}
getGeneration(cells, hist, 0);
freeHistory(hist);
transformBack(cells->cellList, normT, cells->ncells);
}
// int totalDistance(RST* root);
// Must check for errors in instance, if so output error to console.
// If option output is given, output file to a text
// If option output is not given output to screen
int main(int argc, char** argv){
char* filename = NULL;
char** lines;
Plane plane;
char* options = NULL;
bool correctFile = true;
int** MST = NULL;
int* degrees;
//initiallize rand() with current time
srand(time(NULL));
// Cheching for arguments, if they are greater than or equal to two, assume
// their are options and a filename being passed in trying to be passed in.
if(argc >= 2){
filename = getFilename(argv, argc);
options = getOption(argv, argc);
}
// Grab Data
if (filename == NULL){
plane = getParameters();
plane.instance_size = plane.NUM_PT;
} else {
lines = readFile(filename);
// Check to see if a file was succesffully parsed
if(lines == NULL){
printf("File not found\n");
printf("Exiting...\n");
return -1;
}
plane.generation = getGeneration(filename);
plane = getFileParameters(lines);
correctFile = checkFile(plane);
free(lines);
}
// Ensure instances is of the correct size;
if(!correctFile){
printf("File is corrupt, the instance file does not match specification\n");
return -2;
}
if(filename != NULL){
// If we opened up a file, the Plane instance is all ready generated for us.
printPlane(plane, filename, options);
if(plane.instance_size > 1){
MST = prims(plane);
printMST(MST,plane.instance_size, filename, options);
degrees = nodeDegree(MST, plane.instance_size-1);
} else {
printf("Can not generate MST, insufficient nodes \n");
}
} else {
while(plane.generation < plane.total_gen){
// If not we need to generate instances for the number of planes required
plane.instance = genInstance(plane.NUM_PT, plane.MAX_X, plane.MAX_Y);
printPlane(plane, NULL, options);
filename = genFilename(plane.NUM_PT, plane.generation);
if(plane.instance_size > 1){
MST = prims(plane);
printMST(MST,plane.instance_size, filename, options);
degrees = nodeDegree(MST, plane.instance_size-1);
} else {
printf("Can not generate MST, insufficient nodes \n");
}
plane.generation++;
}
}
RST* root;
int rootIndex = findRoot(MST, plane.instance_size-1);
printf("Root index %i\n", rootIndex);
root = buildNode(NULL, rootIndex, NULL, 0, 0 );
buildTree(root, plane.instance, MST, plane.instance_size-1);
// Need to create code to free plane.instance and and sub arrays of instance
printList(root,0);
//printf("Overlap is %i\n", maxOverlap(root));
//printf("Distance is %i\n", totalDistance(root));
freeMST(MST, plane.instance_size-1);
freePlane(&plane);
freeRST(root);
// need to free MST
return 0;
}
Boolean UNIX_ComputerSystem::getGeneration(CIMProperty &p) const
{
p = CIMProperty(PROPERTY_GENERATION, getGeneration());
return true;
}
