-
-void make_population(void)
-{
- for (int i=0; i<conf_pop_size; i++)
- {
- num_placements = 0; // FIXME: This IS a terrible HACK
- struct individual *i2 = ep_alloc(ep_individuals);
- init_individual(i2);
- population2[i] = i2;
-
- if (dbg_init >= VERBOSITY_INDIVIDUAL)
- printf("Making individual %d\n", i);
- struct individual *individual = ep_alloc(ep_individuals); init_individual(individual);
- population1[i] = individual;
-
- int p = 0;
- for (uns j=0; j<GARY_SIZE(requests_point); j++)
- {
- init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_point[j]);
- }
-
- for (uns j=0; j<GARY_SIZE(requests_line); j++)
- {
- init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_line[j]);
-
- for (uns k=0; k<GARY_SIZE(requests_line[j].sections); k++)
- {
- init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_line[j].sections[k]);
-
- for (uns l=0; l<GARY_SIZE(requests_line[j].sections[k].segments); l++)
- {
- init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_line[j].sections[k].segments[l]);
- }
- }
- }
-
- for (uns j=0; j<GARY_SIZE(requests_area); j++)
- {
- init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_area[j]);
- }
-
- hide_segment_labels(individual);
-
- ASSERT(p == num_requests);
- }
-}
-
-bool shall_terminate(void)
-{
- switch (conf_term_cond)
- {
- case TERM_COND_PENALTY:
- return (population1[0]->penalty < conf_penalty_bound);
- case TERM_COND_STAGNATION:
- return (abs(old_best - population1[0]->penalty) < conf_stagnation_bound);
- case TERM_COND_ITERATIONS:
- return (iteration >= conf_iteration_limit);
- default:
- fprintf(stderr, "Warning: No termination condition is set, terminating\n");
- return 1;
- }
-}
-
-void breed(void)
-{
- int i=0;
-
- struct individual **breed_buffer;
- while (i < breed_pop_size)
- {
- int parent1 = randint(0, breed_rbest_size);
- int parent2 = randint(0, breed_rbest_size);
- if (dbg_breeding >= VERBOSITY_INDIVIDUAL)
- printf("Will breed %d and %d\n", parent1, parent2);
-
- breed_buffer = perform_crossover(population1[parent1], population1[parent2]);
- population2[pop2_ind++] = breed_buffer[0];
- population2[pop2_ind++] = breed_buffer[1];
- free(breed_buffer);
- i += 2;
- }
-}
-
-struct individual **perform_crossover(struct individual *parent1, struct individual *parent2)
-{
- struct individual **buffer = xmalloc(2*sizeof(struct individual));
- struct individual *child1 = ep_alloc(ep_individuals); init_individual(child1);
- struct individual *child2 = ep_alloc(ep_individuals); init_individual(child2);
-
- bool *processed;
- GARY_INIT_ZERO(processed, GARY_SIZE(parent1->placements));
-
- for (uns i=0; i<GARY_SIZE(parent1->placements); i++)
- {
- if (! processed[parent1->placements[i].ind])
- {
- if (dbg_breeding >= VERBOSITY_PLACEMENT)
- printf("Creating symbol closure for placement %u\n", i);
-
- struct placement **clos_symbols = get_closure(&(parent1->placements[i]));
- int x = randint(0, 2);
-
- if (x == 0)
- {
- if (dbg_breeding >= VERBOSITY_PLACEMENT)
- printf("Copying parent->child 1->1 and 2->2\n");
- copy_symbols(clos_symbols, parent1, child1, &processed);
- copy_symbols(clos_symbols, parent2, child2, &processed);
- }
- else
- {
- if (dbg_breeding >= VERBOSITY_PLACEMENT)
- printf("Copying parent->child 2->1 and 1->2\n");
- copy_symbols(clos_symbols, parent2, child1, &processed);
- copy_symbols(clos_symbols, parent1, child2, &processed);
- }
-
- GARY_FREE(clos_symbols);
- }
- }
-
- GARY_FREE(processed);
-
- if (conf_mutate_children)
- {
- if (randdouble() < conf_mutate_children_prob) perform_mutation(child1);
- else hide_segment_labels(child1);
-
- if (randdouble() < conf_mutate_children_prob) perform_mutation(child2);
- else hide_segment_labels(child2);
- }
-
- buffer[0] = child1;
- buffer[1] = child2;
- return buffer;
-}
-
-void mutate(void)
-{
- for (int i=0; i < mutate_pop_size; i++)
- {
- if (dbg_mutation >= VERBOSITY_INDIVIDUAL)
- printf("Creating %d-th individual by mutation\n", i);
- int ind = randint(0, mutate_rbest_size);
- if (dbg_mutation >= VERBOSITY_INDIVIDUAL)
- printf("Mutating %d-th individual of original population\n", ind);
- population2[pop2_ind] = ep_alloc(ep_individuals);
- copy_individual(population1[ind], population2[pop2_ind]);
- if (dbg_mutation >= VERBOSITY_INDIVIDUAL)
- printf("Individual %d in pop2 inited from individual %d in pop1\n", pop2_ind, ind);
- perform_mutation(population2[pop2_ind]);
- pop2_ind++;
- }
-}
-
-void perform_mutation(struct individual *individual)
-{
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- double x = randdouble();
- double acc = 0;
-
- if (x <= acc + conf_mutate_move_bound)
- {
- if (dbg_mutation >= VERBOSITY_PLACEMENT)
- printf("Mutation: Moving symbol in placement %u\n", i);
- move_symbol(&(individual->placements[i]));
- continue;
- }
- acc += conf_mutate_move_bound;
-
- if (x <= acc + conf_mutate_regen_bound)
- {
- gen_coords(&(individual->placements[i]));
- continue;
- }
- acc += conf_mutate_regen_bound;
-
- if (x <= acc + conf_mutate_chvar_bound)
- {
- struct placement *p = &(individual->placements[i]);
- switch (p->request->type)
- {
- case REQUEST_POINT:
- case REQUEST_AREA:
- // Does nothing when there are 0 variants... does it mind?
- p->variant_used = randint(-1, GARY_SIZE(p->request->variants));
- break;
- case REQUEST_SEGMENT:
- p->variant_used = randint(0, GARY_SIZE(p->request->variants));
- break;
- case REQUEST_SECTION:
- p->variant_used = randint(0, GARY_SIZE(((struct request_section *) p->request)->segments));
- break;
- default:
- ;
- }
- }
- }
-
- hide_segment_labels(individual);
-}
-
-void elite(void)
-{
- for (int i=0; i<elite_pop_size; i++)
- {
- if (dbg_evolution >= VERBOSITY_INDIVIDUAL)
- {
- printf("Iteration %d: Copying individual #%d from pop 1 to #%d in pop 2\n", iteration, i, pop2_ind);
- }
- population2[pop2_ind] = ep_alloc(ep_individuals);
- copy_individual(population1[i], population2[pop2_ind++]);
- }
-}
-
-int overlaps(struct placement *p1, struct placement *p2)
-{
- if (p1->request->type != REQUEST_POINT &&
- p1->request->type != REQUEST_SEGMENT &&
- p1->request->type != REQUEST_AREA)
- return 0;
-
- if (p2->request->type != REQUEST_POINT &&
- p2->request->type != REQUEST_SEGMENT &&
- p2->request->type != REQUEST_AREA)
- return 0;
-
- if (p1->variant_used == -1 || p2->variant_used == -1)
- return 0;
-
- struct variant *v1, *v2;
-
- v1 = &(p1->request->variants[p1->variant_used]);
- v2 = &(p2->request->variants[p2->variant_used]);
-
- // FIXME: This doesn't fully respect offset which it probably should
- int p1x = p1->x; int p1y = p1->y;
- int p2x = p2->x; int p2y = p2->y;
-
- int overlap = 0;
- for (int y=max2(0, max2(p1y, p2y)); y<min2(page_height_int, min2(p1y+v1->height, p2y+v2->height)); y++)
- for (int x=max2(0, max2(p1x, p2x)); x<min2(page_width_int, min2(p1x+v1->width, p2x+v2->width)); x++)
- {
- if (v1->bitmap[(y-p1y)*v1->width + (x-p1x)] &&
- v2->bitmap[(y-p2y)*v2->width + (x-p2x)])
- overlap++;
- }
-
- return overlap;
-}
-
-int get_overlap(struct placement *p, int **planned_ptr, int iteration)
-{
- int *planned = *planned_ptr;
-
- if (p->variant_used == -1) return 0;
-
- struct map_part **parts = get_map_parts(p);
- if (! parts)
- {
- if (dbg_overlaps >= VERBOSITY_PLACEMENT)
- printf("Placement of request %d seems not to be placed\n", p->request->ind);
- return 0;
- }
-
- struct placement **others;
-
- planned[p->request->ind] = iteration;
- GARY_INIT(others, 0);
-
-//printf("Iterating over parts of placement %d (at [%.2f; %.2f] / %d)\n", p->ind, p->x, p->y, p->variant_used);
- for (uns i=0; i<GARY_SIZE(parts); i++)
- {
- //printf("%d:\t", parts[i]->ind);
- //dump_part_links(parts[i]);
- struct map_placement *mp = parts[i]->placement->next_in_map;
- while (mp)
- {
- if (planned[mp->placement->request->ind] != iteration)
- {
- struct placement **p = GARY_PUSH(others);
- *p = mp->placement;
- planned[mp->placement->request->ind] = iteration;
- }
- mp = mp->next_in_map;
- }
- }
-
- int overlap = 0;
- for (uns i=0; i<GARY_SIZE(others); i++)
- {
- overlap += overlaps(p, others[i]);
- }
-
- GARY_FREE(parts);
- GARY_FREE(others);
-
- if (dbg_overlaps >= VERBOSITY_PLACEMENT)
- {
- printf("Placement %d (of request %d) add %d to overlaps", p->ind, p->request->ind, overlap);
- dump_placement_links(p);
- }
-
- if (p->x < 0) overlap += 0 - p->x;
- if (p->x + p->request->variants[p->variant_used].width > page_width_int)
- overlap += p->x + p->request->variants[p->variant_used].width - page_width_int;
-
- if (p->y < 0) overlap += 0 - p->y;
- if (p->y + p->request->variants[p->variant_used].height > page_height_int)
- overlap += p->y + p->request->variants[p->variant_used].height - page_height_int;
-
- return overlap;
-}
-
-int individual_overlap(struct individual *individual)
-{
- int overlap = 0;
-
- int *planned;
- GARY_INIT_ZERO(planned, GARY_SIZE(individual->placements));
-
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- overlap += get_overlap(&individual->placements[i], &planned, i+1);
- }
-
- GARY_FREE(planned);
-
-// printf("Total overlap is %d\n", overlap);
-
- return overlap;
-}
-
-double get_distance(struct placement *p)
-{
- if (p->variant_used < 0) return 0;
- struct variant *v = &p->request->variants[p->variant_used];
-
- double dx, dy, distance;
- switch (p->request->type)
- {
- case REQUEST_POINT: ;
- struct request_point *rp = (struct request_point *) p->request;
- dx = rp->x + v->offset_x - p->x;
- dy = rp->y + v->offset_y - p->y;
- distance = hypot(dx, dy);
- if (dbg_rank >= VERBOSITY_PLACEMENT)
- printf("Point placed at [%.2f; %.2f], expected at [%.2f; %.2f]\n", p->x, p->y, rp->x, rp->y);
- break;
- case REQUEST_SEGMENT: ;
- struct request_segment *rs = (struct request_segment *) p->request;
- struct sym_text *st = (struct sym_text *) rs->label;
-
- double width = p->request->variants[p->variant_used].width;
- double rotated_x = p->x + width * sin(st->rotate / (-180 / M_PI));
- double rotated_y = p->y + width * cos(st->rotate / (-180 / M_PI));
-
- if (rs->x1 < rs->x2)
- {
- if (p->x < rs->x1)
- {
- dx = rs->x1 - p->x;
- dy = rs->y1 - p->y;
- }
- else if (rotated_x > rs->x2)
- {
- dx = rotated_x - rs->x2;
- dy = rotated_y - rs->y2;
- }
- else
- {
- dx = dy = 0;
- }
- }
- else
- {
- if (p->x < rs->x2)
- {
- dx = rs->x2 - p->x;
- dy = rs->y2 - p->y;
- }
- else if (rotated_x > rs->x1)
- {
- dx = rotated_x - rs->x1;
- dy = rotated_y - rs->y1;
- }
- else
- {
- dx = dy = 0;
- }
- }
-
- distance = hypot(dx, dy);
- break;
- case REQUEST_AREA: ;
- struct request_area *ra = (struct request_area *) p->request;
- dx = ra->cx + v->offset_x - p->x;
- dy = ra->cy + v->offset_y - p->y;
- distance = hypot(dx, dy);
- if (dbg_rank >= VERBOSITY_PLACEMENT)
- printf("Area placed at [%.2f; %.2f], expected at [%.2f; %.2f]\n", p->x, p->y, ra->cx, ra->cy);
- break;
- default:
- return 0;
- }
-
- if (dbg_rank >= VERBOSITY_PLACEMENT)
- printf("Placement %d has distance %.2f\n", p->ind, distance);
- return distance;
-}
-
-double individual_distances(struct individual *individual)
-{
- int distances = 0;
-
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- distances += get_distance(&individual->placements[i]);
- }
-
- return distances;
-}
-
-double get_omittment(struct placement *p)
-{
- if (p->variant_used >= 0) return 0;
-
- // FIX ME :)
- switch (p->request->type)
- {
- case REQUEST_POINT:
- case REQUEST_AREA:
- return 10;
- break;
- default:
- return 0;
- }
-}
-
-double individual_omittment(struct individual *individual)
-{
- int omittment = 0;
-
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- omittment += get_omittment(&individual->placements[i]);
- }
-
- return omittment;
-}
-
-int cmp_individual(const void *a, const void *b)
-{
- struct individual **ia = (struct individual **) a;
- struct individual **ib = (struct individual **) b;
-
- return (*ia)->penalty - (*ib)->penalty;
-}
-
-void rank_population(void)
-{
- int penalty;
-
- for (int i=0; i<conf_pop_size; i++)
- {
- if (dbg_rank >= VERBOSITY_INDIVIDUAL)
- printf("Individual %d\n", i);
- population1[i]->penalty = 0;
-
- penalty = individual_omittment(population1[i]);
- if (dbg_rank >= VERBOSITY_INDIVIDUAL)
- printf("Increasing penalty by %d for omittment\n", penalty);
- population1[i]->penalty += penalty;
-
- penalty = individual_overlap(population1[i]);
- if (dbg_rank >= VERBOSITY_INDIVIDUAL)
- printf("Increasing penalty by %d for overlap\n", penalty);
- population1[i]->penalty += penalty;
-
- penalty = individual_distances(population1[i]);
- if (dbg_rank >= VERBOSITY_INDIVIDUAL)
- printf("Increasing penalty by %d for distances\n", penalty);
- population1[i]->penalty += penalty;
- }
-}
-
-struct map_part **get_map_parts(struct placement *p)
-{
- if (p->variant_used < 0) return NULL;
-
- struct map_part **buffer;
- GARY_INIT(buffer, 0);
-
- if (dbg_map_parts >= VERBOSITY_PLACEMENT)
- printf("Looking for map parts containing placement of request %d, placed at [%.2f; %.2f]\n", p->request->ind, p->x, p->y);
-
- struct variant v;
- switch (p->request->type)
- {
- case REQUEST_POINT:
- case REQUEST_SEGMENT:
- case REQUEST_AREA:
- v = p->request->variants[p->variant_used];
- break;
- default:
- if (dbg_map_parts >= VERBOSITY_ALL)
- printf("Skipping unsupported request type (%d)\n", p->request->type);
- return NULL;
- }
-
- if (dbg_map_parts >= VERBOSITY_PLACEMENT)
- printf("Bitmap is %d x %d\n", v.width, v.height);
-
- int x_min = max2(0, p->x) / conf_map_part_width;
- // CHECK ME: Is rounding needed?
- int x_max = min2(page_width_int, (p->x + v.width)) / conf_map_part_width;
- int y_min = max2(0, p->y) / conf_map_part_height;
- // CHECK ME: Is rounding needed?
- int y_max = min2(page_height_int, (p->y + v.height)) / conf_map_part_height;
-
- if (dbg_map_parts >= VERBOSITY_PLACEMENT)
- printf("Cells between [%d; %d] and [%d; %d] generated\n", x_min, y_min, x_max, y_max);
-
- for (int y=y_min; y<=y_max; y++)
- for (int x=x_min; x<=x_max; x++)
- {
- struct map_part **m = GARY_PUSH(buffer);
- if (dbg_map_parts >= VERBOSITY_ALL)
- printf("Asking for %d of %zu\n", y * num_map_parts_row + x, GARY_SIZE(p->individual->map));
- *m = p->individual->map[y * num_map_parts_row + x];
- }
-
- if (dbg_map_parts >= VERBOSITY_PLACEMENT)
- printf("Returning %zu map parts potentially containing the symbol\n", GARY_SIZE(buffer));
-
- return buffer;
-}
-
-void update_map_parts_delete(struct placement *p)
-{
- struct map_placement *mp = p->map_links;
- while (mp)
- {
- mp->prev_in_map->next_in_map = mp->next_in_map;
- if (mp->next_in_map)
- mp->next_in_map->prev_in_map = mp->prev_in_map;
-
- struct map_placement *tmp = mp;
- mp = mp->next_in_placement;
- free(tmp);
- }
- p->map_links = NULL;
-}
-
-void update_map_parts_create(struct placement *p)
-{
- struct map_part **parts = get_map_parts(p);
- if (parts == NULL) return;
-
- for (uns i=0; i<GARY_SIZE(parts); i++)
- {
- struct map_placement *mp = xmalloc(sizeof(struct map_placement));
- mp->placement = p;
- mp->part = parts[i];
-
- mp->next_in_map = parts[i]->placement->next_in_map;
- mp->prev_in_map = parts[i]->placement;
- parts[i]->placement->next_in_map = mp;
- if (mp->next_in_map) mp->next_in_map->prev_in_map = mp;
-
- mp->next_in_placement = p->map_links;
- mp->prev_in_placement = NULL;
- p->map_links = mp;
- }
-
- GARY_FREE(parts);
-}
-
-void update_map_parts(struct placement *p)
-{
- update_map_parts_delete(p);
- update_map_parts_create(p);
-}
-
-void gen_coords(struct placement *p)
-{
- switch(p->request->type)
- {
- case REQUEST_POINT:
- gen_coords_point(p);
- break;
- case REQUEST_AREA:
- gen_coords_area(p);
- break;
- case REQUEST_SEGMENT:
- gen_coords_segment(p);
- break;
- case REQUEST_LINE:
- if (dbg_movement)
- printf("Not yet implemented\n");
- break;
- default:
- if (dbg_movement >= VERBOSITY_ALL)
- printf("Testing request type\n");
- ASSERT(p->request->type != REQUEST_INVALID);
- }
-
- update_map_parts(p);
-}
-
-double gen_movement(void)
-{
- double m = (random() % 100000) / 10000;
- m = pow(m, 1.0/3) * flip(1, -1);
- if (dbg_movement >= VERBOSITY_ALL)
- printf("Movement %.2f\n", m);
- return m;
-}
-
-double gen_movement_uniform(void)
-{
- return (move_max - move_min) * randdouble() * flip(1, -1);
-}
-
-void gen_coords_point(struct placement *p)
-{
- p->x = p->x + gen_movement();
-}
-
-void gen_coords_segment(struct placement *p)
-{
- struct request_segment *rs = (struct request_segment *) p->request;
- p->x = (rs->x1 + rs->x2) / 2;
- p->y = (rs->y1 + rs->y2) / 2;
-}
-
-void gen_coords_area(struct placement *p)
-{
- struct request_area *ra = (struct request_area *) p->request;
-
- p->x = p->x + gen_movement();
- p->y = p->y + gen_movement();
-
- if (dbg_movement >= VERBOSITY_PLACEMENT)
- printf("Moved label to [%.2f; %.2f] from [%.2f; %.2f]\n", p->x, p->y, ra->cx, ra->cy);
-}
-
-int randint(int min, int max)
-{
- if (min == max) return min;
- int r = random();
- return min + (r % (max - min));
-}
-
-struct placement **get_closure(struct placement *placement)
-{
- struct placement **closure;
- GARY_INIT(closure, 0);
- bool *chosen = xmalloc(GARY_SIZE(placement->individual->placements) * sizeof(bool));
- for (uns i=0; i<GARY_SIZE(placement->individual->placements); i++) { chosen[i] = 0; }
- chosen[placement->request->ind] = 1;
-
- struct placement **p = GARY_PUSH(closure); *p = placement;
-
- uns first = 0;
- while (first < GARY_SIZE(closure))
- {
- if (dbg_breeding >= VERBOSITY_ALL)
- printf("Iterating, first is %u of current %zu\n", first, GARY_SIZE(closure));
- struct placement **overlapping = get_overlapping(placement);
- if (! overlapping) { first++; continue; }
-
- struct placement **filtered = filter(overlapping, &chosen);
- if (dbg_breeding >= VERBOSITY_ALL)
- printf("There are %zu new overlapping symbols\n", GARY_SIZE(filtered));
- GARY_FREE(overlapping);
- overlapping = filtered;
- for (uns j=0; j<GARY_SIZE(overlapping); j++)
- {
- if (! chosen[overlapping[j]->request->ind])
- {
- if (overlaps(*p, overlapping[j]))
- {
- p = GARY_PUSH(closure); *p = overlapping[j];
- if (dbg_breeding >= VERBOSITY_ALL)
- printf("Adding placement of request %d (in fact at [%.2f; %.2f] of size %d x %d)\n", overlapping[j]->request->ind, overlapping[j]->x, overlapping[j]->y, overlapping[j]->request->variants[overlapping[j]->variant_used].width, overlapping[j]->request->variants[overlapping[j]->variant_used].height);
- chosen[overlapping[j]->request->ind] = 1;
- }
- }
- }
- GARY_FREE(overlapping);
- first++;
- }
-
- free(chosen);
-
- return closure;
-}
-
-void copy_symbols(struct placement **closure, struct individual *parent, struct individual *child, bool **processed_ptr)
-{
- bool *processed = *processed_ptr;
- if (dbg_breeding >= VERBOSITY_ALL)
- printf("Will copy %zu symbols\n", GARY_SIZE(closure));
-
- for (uns i=0; i<GARY_SIZE(closure); i++)
- {
- processed[closure[i]->ind] = 1;
- int ind = closure[i]->ind;
- child->placements[ind] = parent->placements[ind];
- child->placements[ind].individual = child;
- child->placements[ind].processed = 0;
- child->placements[ind].map_links = NULL;
- update_map_parts(&child->placements[ind]);
- }
-}
-
-void move_symbol(struct placement *p)
-{
- switch (p->request->type)
- {
- case REQUEST_POINT:
- case REQUEST_AREA:
- move_symbol_point(p);
- break;
- case REQUEST_SEGMENT:
- move_symbol_segment(p);
- break;
- default:
- ASSERT(p->request->type != REQUEST_INVALID);
- }
-}
-
-void move_symbol_point(struct placement *p)
-{
- p->x += gen_movement_uniform();
- p->y += gen_movement_uniform();
-}
-
-void move_symbol_segment(struct placement *p)
-{
- double m = gen_movement_uniform();
- // CHECK ME
- p->x += m;
- p->y += m * ((struct request_segment *) p->request)->slope;
-}
-
-void hide_segment_labels(struct individual *individual)
-{
- // BEWARE: This fully depends on current genetic encoding
-
- int used = -1, num = -1;
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- switch (individual->placements[i].request->type)
- {
- case REQUEST_SECTION:
- used = individual->placements[i].variant_used;
- num = 0;
- break;
- case REQUEST_SEGMENT:
- if (num == used)
- individual->placements[i].variant_used = 0;
- else
- individual->placements[i].variant_used = -1;
- num++;
- break;
- default:
- ;
- }
- }
-}
-
-void init_placement(struct placement *p, struct individual *individual, struct request *r)
-{
- p->ind = num_placements++;
- p->request = r;
- p->processed = 0;
- p->x = p->y = 0; // To prevent valgrind from complaining
- p->variant_used = 0;
- p->map_links = NULL;
- p->individual = individual;
- switch (r->type)
- {
- case REQUEST_POINT: ;
- struct request_point *rp = (struct request_point *) r;
- p->x = rp->x;
- p->y = rp->y;
- break;
- case REQUEST_LINE: ;
- break;
- case REQUEST_SECTION: ;
- struct request_section *rls = (struct request_section *) r;
- p->variant_used = randint(0, rls->num_segments);
- break;
- case REQUEST_SEGMENT: ;
- struct request_segment *rs = (struct request_segment *) r;
- p->x = rs->x2;
- p->y = rs->y2;
- break;
- case REQUEST_AREA: ;
- struct request_area *ra = (struct request_area *) r;
- p->x = ra->cx;
- p->y = ra->cy;
- p->variant_used = 0;
- break;
- default:
- ASSERT(p->request->type != REQUEST_INVALID);
- }
-
- gen_coords(p);
- if (dbg_init >= VERBOSITY_PLACEMENT)
- printf("Inited placement to [%.2f; %.2f]\n", p->x, p->y);
-}
-
-/**
-void reset_individual_map(struct individual *i)
-{
- for (uns j=0; j<num_map_parts; j++)
- {
- struct map_placement *mp = i->map[j]->placement;
- while (mp)
- {
- struct map_placement *tmp = mp;
- mp = mp->next_in_map;
- free(tmp);
- }
-
- free(i->map[j]);
- struct map_part *part = xmalloc(sizeof(struct map_part));
- part->ind = j;
-
- mp = xmalloc(sizeof(struct map_placement));
- part->placement = mp;
- mp->placement = &dummy_placement;
- mp->next_in_map = mp->prev_in_map = NULL;
- mp->next_in_placement = mp->prev_in_placement = NULL;
- i->map[j] = part;
- }
-}
-**/
-
-/**
-void update_individual(struct individual *individual)
-{
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- update_map_parts_delete(&individual->placements[i]);
- }
-}
-**/
-
-void clear_individual(struct individual *individual)
-{
- for (uns j=0; j<num_map_parts; j++)
- {
- struct map_placement *mp = individual->map[j]->placement;
- while (mp)
- {
- struct map_placement *tmp = mp;
- mp = mp->next_in_map;
- free(tmp);
- }
-
- free(individual->map[j]);
- }
-
- GARY_FREE(individual->map);
- GARY_FREE(individual->placements);
- ep_free(ep_individuals, individual);
-}
-
-void clear_population(struct individual **pop)
-{
- for (uns i=0; i<GARY_SIZE(pop); i++)
- {
- clear_individual(pop[i]);
- }
-}
-
-struct placement **get_overlapping(struct placement *p)
-{
- struct placement **buffer;
- GARY_INIT(buffer, 0);
-
- struct map_part **parts = get_map_parts(p);
- if (! parts) return NULL;
-
- for (uns i=0; i<GARY_SIZE(parts); i++)
- {
- struct map_placement *mp = parts[i]->placement->next_in_map;
- while (mp)
- {
- if (p->variant_used >= 0)
- {
- struct placement **p = GARY_PUSH(buffer);
- *p = mp->placement;
- }
- mp = mp->next_in_map;
- }
- }
- GARY_FREE(parts);
-
- if (dbg_map_parts >= VERBOSITY_PLACEMENT)
- printf("Returning %zu potentially overlapping placements\n", GARY_SIZE(buffer));
-
- return buffer;
-}
-
-struct placement **filter(struct placement **list, bool **pred_ptr)
-{
- bool *pred = *pred_ptr; // As GARY can't be passed directly
- struct placement **filtered;
- GARY_INIT(filtered, 0);
-
- for (uns i=0; i<GARY_SIZE(list); i++)
- {
- if (pred[list[i]->request->ind])
- continue;
-
- struct placement **p = GARY_PUSH(filtered);
- *p = list[i];
- }
-
- return filtered;
-}
-
-int flip(int a, int b)
-{
- return (random() % 2 ? a : b);
-}
-
-double randdouble(void)
-{
- return ((double) rand() / (double) RAND_MAX);
-}
-
-void init_individual(struct individual *individual)
-{
- GARY_INIT(individual->placements, num_requests);
- GARY_INIT(individual->map, 0);
- for (uns j=0; j<num_map_parts; j++)
- {
- GARY_PUSH(individual->map);
- struct map_part *part = xmalloc(sizeof(struct map_part));
- struct map_placement *mp = xmalloc(sizeof(struct map_placement));
- part->placement = mp;
- part->ind = j;
- mp->placement = &dummy_placement;
- mp->next_in_map = mp->prev_in_map = NULL;
- mp->next_in_placement = mp->prev_in_placement = NULL;
- individual->map[j] = part;
- }
- individual->penalty = 0;
-}
-
-void copy_individual(struct individual *src, struct individual *dest)
-{
- init_individual(dest);
- dest->penalty = src->penalty;
-
- for (uns i=0; i<GARY_SIZE(src->placements); i++)
- {
- dest->placements[i] = src->placements[i];
- dest->placements[i].map_links = NULL;
- dest->placements[i].individual = dest;
-
- update_map_parts_create(&dest->placements[i]);
- }
-}