- fclose(fd_dump);
-}
-
-void dump_individual(struct individual *individual)
-{
-printf("*** Dumping INDIVIDUAL ***\n");
-printf("(There are %d requests)\n", num_requests);
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- struct placement *p = &(individual->placements[i]);
-
- switch (p->request->type)
- {
- case REQUEST_POINT:
- printf("Point at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_point *) p->request)->zindex);
- break;
- case REQUEST_LINE: ;
- struct request_line *rl = (struct request_line *) p->request;
- printf("Line: ");
- print_label(rl->sections[0].segments[0].label);
- break;
- case REQUEST_SECTION: ;
- printf("*");
- break;
- case REQUEST_SEGMENT: ;
- if (p->variant_used >= 0)
- printf("Segment placed at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_segment *) p->request)->zindex);
- else
- printf("Segment not placed\n");
- break;
- case REQUEST_AREA: ;
- struct request_area *ra = (struct request_area *) p->request;
- printf("Area label ");
- print_label(ra->label);
- printf(" at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_area *) p->request)->zindex);
- break;
- default:
- printf("Testing request type (dump_individual)\n");
- ASSERT(p->request->type != 0);
- }
- }
- printf("\nTotal penalty: %d\n", individual->penalty);
-}
-
-void plan_individual(struct individual *individual)
-{
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- struct symbol *s = NULL;
- z_index_t zindex = 0;
- if (individual->placements[i].variant_used < 0) continue;
- switch (individual->placements[i].request->type)
- {
- case REQUEST_POINT: ;
- struct request_point *rp = (struct request_point *) individual->placements[i].request;
- s = rp->sym;
- zindex = rp->zindex;
- break;
- case REQUEST_SEGMENT: ;
- struct request_segment *rs = (struct request_segment *) individual->placements[i].request;
- s = rs->label;
- zindex = rs->zindex;
- break;
- case REQUEST_LINE: ;
- break;
- case REQUEST_AREA: ;
- struct request_area *ra = (struct request_area *) individual->placements[i].request;
- s = ra->label;
- zindex = ra->zindex;
- break;
- default:
- ASSERT(individual->placements[i].request != REQUEST_INVALID);
- continue;
- }
-
-if (dbg_plan)
- printf("Will plan symbol at [%.2f; %.2f] on %u\n", individual->placements[i].x, individual->placements[i].y, zindex);
-
- if (s) switch (s->type)
- {
- case SYMBOLIZER_POINT: ;
- struct sym_point *sp = (struct sym_point *) s;
- sp->x = individual->placements[i].x;
- sp->y = individual->placements[i].y;
- sym_plan((struct symbol *) sp, zindex);
- break;
- case SYMBOLIZER_ICON: ;
- struct sym_icon *si = (struct sym_icon *) s;
- si->sir.x = individual->placements[i].x;
- si->sir.y = individual->placements[i].y;
- sym_plan((struct symbol *) si, zindex);
- break;
- case SYMBOLIZER_TEXT: ;
- struct sym_text *st = (struct sym_text *) s;
- st->x = individual->placements[i].x;
- st->y = individual->placements[i].y;
- st->next_duplicate = NULL;
- if (dbg_plan) printf("Planning text %s at [%.2f; %.2f] on %u, with rotation %.2f\n", osm_val_decode(st->text), st->x, st->y, zindex, st->rotate);
- sym_plan((struct symbol *) st, zindex);
- break;
- default:
- ASSERT(s->type != SYMBOLIZER_INVALID);
- }
- }
-}
-
-void dump_penalties(struct individual **population)
-{
- for (int i=0; i<conf_pop_size; i++)
- {
- printf("Individual %d has penalty %d\n", i, population[i]->penalty);
- }
-}
-
-void labeller_label(void)
-{
- make_graph();
- label_graph();
- bfs_wrapper();
- make_segments();
-
-printf("Having %u point requests, %u line requests and %u area requests\n", GARY_SIZE(requests_point), GARY_SIZE(requests_line), GARY_SIZE(requests_area));
-
- GARY_INIT(population1, conf_pop_size);
- GARY_INIT(population2, conf_pop_size);
- make_population();
- rank_population();
- qsort(population1, conf_pop_size, sizeof(struct individual *), cmp_individual);
-
- if (dbg_evolution)
- dump_penalties(population1);
-
-
- breed_pop_size = conf_breed_pop_size * conf_pop_size;
- breed_rbest_size = conf_breed_rbest * conf_pop_size;
- if (dbg_evolution)
- {
- printf("Breeding parameters:\n");
- printf(" %d individuals are created\n", breed_pop_size);
- printf(" %d best individuals in old population are considered\n", breed_rbest_size);
- }
-
- mutate_pop_size = conf_mutate_pop_size * conf_pop_size;
- mutate_rbest_size = conf_mutate_rbest * conf_pop_size;
- if (dbg_evolution)
- {
- printf("Mutation parameters:\n");
- printf(" %d individuals are created\n", mutate_pop_size);
- printf(" %d best individuals in old population are considered\n", mutate_rbest_size);
- }
-
- elite_pop_size = conf_elite_pop_size * conf_pop_size;
- if (dbg_evolution)
- {
- printf("Elitism parameters:\n");
- printf(" %d best individuals are copied\n", elite_pop_size);
- }
-
- while (! shall_terminate())
- {
- iteration++;
- if (dbg_evolution)
- printf("*** Iteration %d ***\n", iteration);
-
- breed();
- mutate();
- elite();
-
- struct individual **swp = population1;
- population1 = population2;
- population2 = swp;
- pop2_ind = 0;
-
- if (dbg_evolution)
- dump_penalties(population1);
-
- rank_population();
- qsort(population1, conf_pop_size, sizeof(struct individual *), cmp_individual);
-
- if (dbg_evolution)
- dump_penalties(population1);
- }
-
- plan_individual(population1[0]);
-
- labeller_cleanup();
-
- return;
-}
-
-void labeller_cleanup(void)
-{
-}
-
-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)
- 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:
- // FIXME: Warn the user that no condition is set
- return 1;
- }
-}
-
-void breed(void)
-{
- int i=0;
-
- struct individual **breed_buffer;
- while (i < breed_pop_size)
- {
- int parent1 = randint(0, breed_rbest_size-1);
- int parent2 = randint(0, breed_rbest_size-1);
- 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;
- }
-
- return;
-}
-
-struct individual **perform_crossover(struct individual *parent1, struct individual *parent2)
-{
- struct individual **buffer = malloc(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(1, 2);
-
- if (x == 1)
- {
- 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 (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child1);
- if (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child2);
- }
-
- buffer[0] = child1;
- buffer[1] = child2;
- return buffer;
-}
-
-void mutate(void)
-{
- for (int i=0; i < mutate_pop_size; i++)
- {
- if (dbg_mutation)
- printf("%d\n", i);
- int ind = randint(1, mutate_rbest_size);
- if (dbg_mutation)
- printf("Mutating %d-th individual of original population\n", ind);
- copy_individual(population1[ind], population2[pop2_ind]);
- if (dbg_mutation)
- 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)
- 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_SEGMENT:
- case REQUEST_AREA:
- // Does nothing when there are 0 variants... does it mind?
- p->variant_used = randint(0, GARY_SIZE(p->request->variants) - 1);
- break;
- case REQUEST_SECTION:
- p->variant_used = randint(0, GARY_SIZE(((struct request_section *) p->request)->segments)-1);
- break;
- default:
- ;
- }
- }
- }
-}
-
-void elite(void)
-{
- for (int i=0; i<elite_pop_size; i++)
- {
- 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]);
-
- 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)
-{
- struct map_part **parts = get_map_parts(p);
- if (! parts)
- {
- if (dbg_overlaps)
- printf("Placement of request %d seems not to be placed\n", p->request->ind);
- return 0;
- }
-
- struct placement **others;
- bool *planned;
-
- GARY_INIT_ZERO(planned, num_requests);
- planned[p->request->ind] = 1;
- GARY_INIT(others, 0);
-
- for (uns i=0; i<GARY_SIZE(parts); i++)
- {
- struct map_placement *mp = parts[i]->placement->next;
- while (mp)
- {
- if (! planned[mp->placement->request->ind])
- {
- struct placement **p = GARY_PUSH(others);
- *p = mp->placement;
- planned[mp->placement->request->ind] = true;
- }
- mp = mp->next;
- }
- }
-
- int overlap = 0;
- for (uns i=0; i<GARY_SIZE(others); i++)
- {
- overlap += overlaps(p, others[i]);
- }
-
- GARY_FREE(planned);
- GARY_FREE(parts);
- GARY_FREE(others);
-
- return overlap;
-}
-
-int individual_overlap(struct individual *individual)
-{
- int overlap = 0;
-
- for (uns i=0; i<GARY_SIZE(individual->placements); i++)
- {
- overlap += get_overlap(&individual->placements[i]);
- }
-
- return overlap;
-}
-
-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)
- printf("Individual %d\n", i);
- population1[i]->penalty = 0;
-
- penalty = individual_overlap(population1[i]);
- if (dbg_rank)
- printf("Increasing penalty by %d for overlap\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)
- 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:
- return NULL;
- }
-
- 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)
- 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)
- printf("Asking for %d of %u\n", y * num_map_parts_row + x, GARY_SIZE(p->individual->map));
- *m = p->individual->map[y * num_map_parts_row + x];
- }
-
- return buffer;
-}
-
-void update_map_parts(struct placement *p)
-{
- struct placement_link *ml = p->map_links;
- while (ml)
- {
- struct map_placement *mp = ml->mp;
-
- mp->prev->next = mp->next;
- if (mp->next)
- mp->next->prev = mp->prev;
- free(mp);
-
- struct placement_link *tmp = ml;
- ml = ml->next;
- free(tmp);
- }
- p->map_links = NULL;
-
- 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 = malloc(sizeof(struct map_placement));
- mp->placement = p;
-
- mp->next = parts[i]->placement->next;
- mp->prev = parts[i]->placement;
- parts[i]->placement->next = mp;
- if (mp->next) mp->next->prev = mp;
-
- struct placement_link *ml = malloc(sizeof(struct placement_link));
- ml->mp = mp;
- ml->next = p->map_links;
- p->map_links = ml;
- }
-
- GARY_FREE(parts);
-}
-
-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)
- 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)
- 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;
- int a = flip(1, 2);
- p->x = (a == 1 ? rs->x1 : rs->x2);
- p->y = (a == 1 ? rs->y1 : rs->y2);
-}
-
-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)
- printf("Moved label to [%.2f; %.2f] from [%.2f; %.2f]\n", p->x, p->y, ra->cx, ra->cy);
-}
-
-struct map_part **get_parts(struct placement *symbol, struct individual *individual)
-{
- struct map_part **buffer;
- GARY_INIT(buffer, 0);
- int x_min = symbol->x / conf_part_size;
- int x_max = (symbol->x /*+ symbol->bitmap->width*/ + conf_part_size - 1) / conf_part_size;
- int y_min = symbol->y / conf_part_size;
- int y_max = (symbol->y /*+ symbol->bitmap->height*/ + conf_part_size - 1) / conf_part_size;
-
- for (int x=x_min; x < x_max; x++)
- for (int y=y_min; y < y_max; y++)
- {
- struct map_part *m = GARY_PUSH(buffer);
- *m = individual->map[x][y];
- }
-
- return buffer;
-}
-
-int randint(int min, int max)
-{
- if (min == max) return min;
- int r = random();
- //printf("Returning %d + (%d %% (%d - %d)) = %d + %d %% %d = %d + %d = %d\n", min, r, max, min, min, r, max-min, min, r%(max-min), min+(r%(max-min)));
- return min + (r % (max - min));
- return (r * (max - min));
-}
-
-struct placement **get_closure(struct placement *placement)
-{
- struct placement **closure;
- GARY_INIT(closure, 0);
- bool *chosen = malloc(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 %d of current %u\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 %u 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++;
- }
-
- 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 %u 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].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)
-{
- // FIXME
- 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);
- printf("Valid request: %d\n", p->request->type);
- }
-
- gen_coords(p);
- if (dbg_init)
- printf("Inited placement to [%.2f; %.2f]\n", p->x, p->y);
-}
-
-void init_individual(struct individual *i)
-{
-//printf("Initing individual\n");
- GARY_INIT(i->placements, num_requests);
- GARY_INIT(i->map, 0);
- for (uns j=0; j<num_map_parts; j++)
- {
- struct map_part *part = GARY_PUSH(i->map);
- GARY_INIT(part->placement, 0);
- struct map_placement *mp = GARY_PUSH(part->placement);
- mp->placement = &dummy_placement;
- mp->next = mp->prev = NULL;
- }
- i->penalty = 0; // FIXME
-
- if (dbg_init)
- printf("Individual inited, has %u map parts\n", GARY_SIZE(i->map));
-}
-
-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;
- while (mp)
- {
- if (p->variant_used >= 0)
- {
- struct placement **p = GARY_PUSH(buffer);
- *p = mp->placement;
- }
- mp = mp->next;
- }
- }
- GARY_FREE(parts);
-
- if (dbg_map_parts)
- printf("Returning %u 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 cleanup(void)
-{
- hash_cleanup();
- GARY_FREE(requests_point);