struct individual **population2;
int dbg_segments = 0;
+int dbg_plan = 0;
+int dbg_requests = 0;
+int dbg_graph = 0;
+int dbg_bfs = 0;
+int dbg_map_parts = 0;
+int dbg_movement = 0;
+int dbg_init = 0;
int page_width_int;
int page_height_int;
int num_requests = 0;
+int conf_map_part_width = 5;
+int conf_map_part_height = 5;
+int num_map_parts_row;
+int num_map_parts_col;
+int num_map_parts;
+
void make_graph(void);
void label_graph(void);
void join_edge(struct graph_edge *e, int dir);
void mutate(void);
void elite(void);
void rank_population(void);
+void plan_individual(struct individual *individual);
-void make_bitmap(struct point_variant *v, struct symbol *sym);
-void make_bitmap_icon(struct point_variant *v, struct sym_icon *si);
-void make_bitmap_point(struct point_variant *v, struct sym_point *sp);
-void make_bitmap_label(struct point_variant *v, struct sym_text *text);
+void make_bitmap(struct variant *v, struct symbol *sym);
+void make_bitmap_icon(struct variant *v, struct sym_icon *si);
+void make_bitmap_point(struct variant *v, struct sym_point *sp);
+void make_bitmap_label(struct variant *v, struct sym_text *text);
void cut_edge(struct graph_edge *e, double dist);
struct request_line *make_new_line(void);
void gen_coords_segment(struct placement *p);
void gen_coords_area(struct placement *p);
+struct map_part **get_map_parts(struct placement *p);
+void update_map_parts(struct placement *p);
+
void make_segments_old(void);
void labeller_cleanup(void);
struct individual **perform_crossover(struct individual *parent1, struct individual *parent2);
void perform_mutation(struct individual *individual);
-void init_placement(struct placement *p, struct request *r);
+void hide_segment_labels(struct individual *individual);
+void init_placement(struct placement *p, struct individual *individual, struct request *r);
void init_individual(struct individual *i);
struct map_part **get_parts(struct placement *symbol, struct individual *individual);
int max4(int a, int b, int c, int d);
int min4(int a, int b, int c, int d);
+struct placement dummy_placement;
+
int max2(int a, int b)
{
return (a > b ? a : b);
page_width_int = floor(page_width);
page_height_int = floor(page_height);
+
+ num_map_parts_row = (page_width_int + conf_map_part_width) / conf_map_part_width;
+ num_map_parts_col = (page_height_int + conf_map_part_height) / conf_map_part_height;
+ num_map_parts = num_map_parts_row * num_map_parts_col;
}
-void make_bitmap(struct point_variant *v, struct symbol *sym)
+void make_bitmap(struct variant *v, struct symbol *sym)
{
switch (sym->type)
{
}
}
-void make_bitmap_icon(struct point_variant *v, struct sym_icon *si)
+void make_bitmap_icon(struct variant *v, struct sym_icon *si)
{
- v->width = si->sir.icon->width;
- v->height = si->sir.icon->height;
- v->bitmap = malloc((int) ceil(v->width * v->height * sizeof(bool)));
+ v->width = si->sir.width + 1;
+ v->height = si->sir.height + 1;
+ v->bitmap = malloc(v->width * v->height * sizeof(bool));
for (int i=0; i<v->width*v->height; i++) v->bitmap[i] = 1;
}
-void make_bitmap_point(struct point_variant *v, struct sym_point *sp)
+void make_bitmap_point(struct variant *v, struct sym_point *sp)
{
- v->width = v->height = sp->size;
- v->bitmap = malloc(sp->size*sp->size * sizeof(bool));
+ v->width = v->height = sp->size + 1;
+ v->bitmap = malloc(v->width * v->height * sizeof(bool));
// FIXME: Okay, memset would be much nicer here
for (int i=0; i<sp->size*sp->size; i++) v->bitmap[i] = 1;
}
-void make_bitmap_label(struct point_variant *v, struct sym_text *text)
+void make_bitmap_label(struct variant *v, struct sym_text *text)
{
- int x_ld = 0;
- int y_ld = 0;
- int x_lu = 0;
- int y_lu = 0;
- int x_rd = 0;
- int y_rd = 0;
- int x_ru = 0;
- int y_ru = 0;
-
- v->width = max4(x_ld, x_lu, x_rd, x_ru) - min4(x_ld, x_lu, x_rd, x_ru);
- v->height = max4(y_ld, y_lu, y_rd, y_ru) - min4(y_ld, y_lu, y_rd, y_ru);
- //v->bitmap = malloc((int) (ceil(v->width) * ceil(v->height) * sizeof(bool)));
-
v->width = ceil(text->tw);
v->height = ceil(text->th);
v->bitmap = malloc(v->width * v->height * sizeof(bool));
-// printf("Allocated bitmap of %d bools for %d x %d label\n", v->width * v->height, v->width, v->height);
for (int i=0; i<v->height; i++)
for (int j=0; j<v->width; j++)
{
v->bitmap[i*v->width + j] = 1;
-// printf("Writing at %d\n", i*v->width + j);
}
}
void labeller_add_point(struct symbol *sym, struct osm_object *object, z_index_t zindex)
{
-printf("Adding point\n");
+ if (dbg_requests)
+ printf("Adding point\n");
if (object->type != OSM_TYPE_NODE)
{
printf("Warning: Point label requested on non-point object\n");
r->offset_y = 0;
r->num_variants = 1;
- GARY_INIT(r->variants, 0);
+ GARY_INIT(r->request.variants, 0);
- struct point_variant *v = GARY_PUSH(r->variants);
+ struct variant *v = GARY_PUSH(r->request.variants);
struct osm_node *n = (struct osm_node *) object; // FIXME: Compiler warning
r->x = n->x;
void labeller_add_line(struct symbol *sym, z_index_t zindex)
{
-printf("Adding line on %u\n", zindex);
+ if (dbg_requests)
+ printf("Adding line on %u\n", zindex);
struct buffer_line *b = GARY_PUSH(buffer_line);
b->line = (struct sym_line *) sym;
b->zindex = zindex;
return;
}
- printf("[LAB] Labelling way %ju on %u\n", o->id, zindex);
+ if (dbg_requests)
+ printf("[LAB] Labelling way %ju on %u\n", o->id, zindex);
struct buffer_linelabel *ll = GARY_PUSH(buffer_linelabel);
ll->way = (struct osm_way *) o;
ll->label = sym;
void labeller_add_arealabel(struct symbol *sym, struct osm_object *o, z_index_t zindex)
{
-printf("Adding area on %u\n", zindex);
+ if (dbg_requests)
+ printf("Adding area on %u\n", zindex);
struct request_area *r = GARY_PUSH(requests_area);
r->request.type = REQUEST_AREA;
osm_obj_center(o, &(r->cx), &(r->cy));
- GARY_INIT(r->variants, 0);
- struct point_variant *v = GARY_PUSH(r->variants);
+ GARY_INIT(r->request.variants, 0);
+ struct variant *v = GARY_PUSH(r->request.variants);
switch (sym->type)
{
case SYMBOLIZER_ICON:
- printf("DEBUG: Icon label\n");
+ if (dbg_requests)
+ printf("DEBUG: Icon label\n");
make_bitmap_icon(v, (struct sym_icon *) sym);
break;
case SYMBOLIZER_TEXT:
- printf("DEBUG: Text label\n");
+ if (dbg_requests)
+ printf("DEBUG: Text label\n");
make_bitmap_label(v, (struct sym_text *) sym);
default:
// FIXME
void label_graph(void)
{
-printf("There are %u line labels requested\n", GARY_SIZE(buffer_linelabel));
+ if (dbg_graph)
+ printf("There are %u line labels requested\n", GARY_SIZE(buffer_linelabel));
for (uns i=0; i<GARY_SIZE(buffer_linelabel); i++)
{
if (buffer_linelabel[i].label->type == SYMBOLIZER_TEXT)
- printf("Labelling nodes of way %s\n", osm_val_decode(((struct sym_text *) buffer_linelabel[i].label)->text));
+ if (dbg_graph)
+ printf("Labelling nodes of way %s\n", osm_val_decode(((struct sym_text *) buffer_linelabel[i].label)->text));
CLIST_FOR_EACH(struct osm_ref *, ref, buffer_linelabel[i].way->nodes)
{
- printf("Looking for node %ju\n", ref->o->id);
+ if (dbg_graph)
+ printf("Looking for node %ju\n", ref->o->id);
struct graph_node *n = hash_find(ref->o->id);
if (n == NULL)
{
}
else
{
- printf("Searching among %u edges\n", GARY_SIZE(n->edges));
+ if (dbg_graph)
+ printf("Searching among %u edges\n", GARY_SIZE(n->edges));
for (uns j=0; j<GARY_SIZE(n->edges); j++)
{
if (n->edges[j]->id == buffer_linelabel[i].way->o.id)
{
- printf("Labelling node %ju\n", n->id);
+ if (dbg_graph)
+ printf("Labelling node %ju\n", n->id);
n->edges[j]->label = buffer_linelabel[i].label;
n->edges[j]->zindex = buffer_linelabel[i].zindex;
}
void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir)
{
-printf("BFS edge called for edge %d (going %d) in direction %d\n", e->num, e->dir, dir);
+ if (dbg_bfs)
+ printf("BFS edge called for edge %d (going %d) in direction %d\n", e->num, e->dir, dir);
struct graph_edge *candidate = NULL;
for (uns i=0; i<GARY_SIZE(node->edges); i++)
{
struct graph_edge *other = node->edges[i];
-if (e->num == 987) printf("Got label %d\n", e->num);
if ((other->longline != (uns) -1) && (other->longline != e->longline)) continue;
-if (e->num == 987) printf("Continuing with edge %d\n", e->num);
-printf("Testing %d ?= %d\n", other->visited, e->longline);
if ((uns) other->visited != e->longline) {
- printf("Pushing new edge %d / %ju\n", other->num, other->id);
+ if (dbg_bfs)
+ printf("Pushing new edge %d / %ju\n", other->num, other->id);
struct graph_edge **e_ptr = GARY_PUSH(bfs_queue);
*e_ptr = other;
other->visited = e->longline;
if (candidate)
{
-printf("New line in longline %u\n", e->longline);
+ if (dbg_bfs)
+ printf("New line in longline %u\n", e->longline);
struct graph_edge *other = candidate;
other->longline = e->longline;
other->dir = dir;
void bfs(uns longline)
{
-printf("BFS called for longline %u\n", longline);
-printf("%d longlines are believed to exist, %d exist\n", num_longlines, GARY_SIZE(longlines));
+if (dbg_bfs)
+ printf("BFS called for longline %u\n", longline);
+if (dbg_bfs)
+ printf("%d longlines are believed to exist, %d exist\n", num_longlines, GARY_SIZE(longlines));
for (uns i=0; i<GARY_SIZE(bfs_queue); i++)
{
struct graph_edge *cur = bfs_queue[i];
- printf("Exploring new edge %d; %d remaining\n", cur->num, GARY_SIZE(bfs_queue));
+ if (dbg_bfs)
+ printf("Exploring new edge %d; %d remaining\n", cur->num, GARY_SIZE(bfs_queue));
//ASSERT(! cur->visited);
cur->visited = longline;
{
GARY_PUSH(longlines);
longlines[num_longlines].first = node->edges[i];
- printf("Running new BFS\n");
- printf("Creating longline %u\n", num_longlines);
+ if (dbg_bfs)
+ printf("Running new BFS\n");
+ if (dbg_bfs)
+ printf("Creating longline %u\n", num_longlines);
GARY_RESIZE(bfs_queue, 0);
struct graph_edge **e = GARY_PUSH(bfs_queue);
*e = node->edges[i];
node->edges[i]->longline = num_longlines;
bfs(node->edges[i]->longline);
//dump_longlines();
- printf("Joined %d edges\n", dbg_num_hits); dbg_num_hits = 0;
- printf("Planned %u edges\n", GARY_SIZE(bfs_queue));
+ if (dbg_bfs)
+ printf("Joined %d edges\n", dbg_num_hits); dbg_num_hits = 0;
+ if (dbg_bfs)
+ printf("Planned %u edges\n", GARY_SIZE(bfs_queue));
num_longlines++;
}
}
rs->request.ind = num_requests++;
rs->request.type = REQUEST_SEGMENT;
- struct point_variant *v = malloc(sizeof(struct point_variant));
+ struct variant *v = malloc(sizeof(struct variant));
make_bitmap(v, sym);
- rs->variant = v;
+ rs->request.variants = v;
return rs;
}
*new = *e;
e->next = new;
+ // FIXME? Create new label for new edge, don't only copy pointer?
+
struct osm_node *n1 = e->n1->o;
struct osm_node *n2 = e->n2->o;
e->length = hypot(abs(n1->x - n11->x), abs(n1->y - n11->y));
new->length = hypot(abs(n11->x - n2->x), abs(n11->y - n2->y));
+ new->visited = 0;
}
void make_segments(void)
}
else
{
- printf("Warning: Skipping line\n");
+ if (dbg_segments)
+ printf("Warning: Skipping line\n");
continue;
// FIXME;
}
- printf("New longline\n");
+ if (dbg_segments)
+ printf("New longline\n");
while (e)
{
- if (cur_length + e->length > conf_max_section_length + conf_max_section_overlay)
+ if (e->visited < 0)
{
- if (dbg_segments)
- printf("Edge too long, length is %.2f; %.2f - %.2f = %.2f\n", e->length, conf_max_section_length, cur_length, conf_max_section_length - cur_length);
- cut_edge(e, conf_max_section_length - cur_length);
+ printf("BEWARE: Edge cycle\n");
+ break;
}
+ e->visited = -1; // FIXME
- if (cur_length + e->length > conf_max_section_length)
- {
- if (dbg_segments)
- printf("Making new section, new length would be %f, allowed is %.2f / %.2f\n", cur_length + e->length, conf_max_section_length, conf_max_section_overlay);
-
- struct osm_node *n1 = e->n1->o;
- struct osm_node *n2 = e->n2->o;
- rs = make_new_segment(rls, e->label);
- rs->x1 = n1->x;
- rs->y1 = n1->y;
- rs->x2 = n2->x;
- rs->y2 = n2->y;
- rs->zindex = e->zindex;
-
- rs->label = malloc(sizeof(struct sym_text));
- *((struct sym_text *) rs->label) = *((struct sym_text *) e->label);
- rls = make_new_section(request);
- cur_length = 0;
- }
+ if (dbg_segments)
+ printf("Taking edge from [%.2f; %.2f] to [%.2f; %.2f] of length %.2f\n", e->n1->o->x, e->n1->o->y, e->n2->o->x, e->n2->o->y, e->length);
if (st && (e->length < st->tw))
{
e = e->next;
- printf("Warning: Skipping segment\n");
+ //printf("Warning: Skipping segment\n");
continue;
}
+ if (cur_length + e->length > conf_max_section_length + conf_max_section_overlay)
+ {
+ if (dbg_segments)
+ printf("Edge too long, length is %.2f; %.2f - %.2f = %.2f\n", e->length, conf_max_section_length, cur_length, conf_max_section_length - cur_length);
+ // HACK to prevent cutting to 0 lenght
+ cut_edge(e, max2(conf_max_section_length - cur_length, 2));
+ }
+
rs = make_new_segment(rls, e->label);
rs->label = malloc(sizeof(struct sym_text));
*((struct sym_text *) rs->label) = *((struct sym_text *) e->label);
rs->x2 = e->n2->o->x;
rs->y2 = e->n2->o->y;
+ // FIXME: Set text rotation
rs->angle = atan2(rs->x2 - rs->x1, rs->y2 - rs->y1);
rs->zindex = e->zindex;
cur_length += e->length;
+ if (cur_length > conf_max_section_length)
+ {
+ if (dbg_segments)
+ printf("Making new section, new length would be %f, allowed is %.2f / %.2f\n", cur_length + e->length, conf_max_section_length, conf_max_section_overlay);
+
+ rls = make_new_section(request);
+ cur_length = 0;
+ }
+
e = e->next;
}
for (uns i=0; i<GARY_SIZE(individual->placements); i++)
{
-fprintf(stderr, "%d-th placement\n", i);
+ if (individual->placements[i].variant_used == -1) continue;
+
struct placement *p = &(individual->placements[i]);
- struct point_variant *v = NULL;
+ struct variant *v = NULL;
switch (p->request->type)
{
case REQUEST_SEGMENT: ;
- struct request_segment *rs = (struct request_segment *) p->request;
- v = rs->variant;
- break;
case REQUEST_POINT: ;
- struct request_point *rp = (struct request_point *) p->request;
- v = &(rp->variants[p->variant_used]);
- break;
case REQUEST_AREA: ;
- struct request_area *ra = (struct request_area *) p->request;
- printf("Using %d-th of %d variants\n", p->variant_used, GARY_SIZE(ra->variants));
- v = &(ra->variants[p->variant_used]);
+ v = &(p->request->variants[p->variant_used]);
break;
default:
- printf("Testing request type (dump_bitmaps): %d\n", p->request->type);
ASSERT(p->request->type != REQUEST_INVALID);
continue;
}
- printf("Got after with %d-th placement of request type %d\n", i, p->request->type);
-
- printf("Rendering %d-th label %d x %d (w x h)\n", i, v->width, v->height);
for (int row = max2(p->y, 0); row < min2(p->y + v->height, page_height_int); row++)
{
for (int col = max2(p->x, 0); col < min2(p->x + v->width, page_width_int); col++)
{
- printf("Writing to %d\n", row*page_width_int + col);
bitmap[row * page_width_int + col] = 1;
}
}
printf("\nTotal penalty: %d\n", individual->penalty);
}
-void labeller_label(void)
+void plan_individual(struct individual *individual)
{
- make_graph();
- label_graph();
-//dump_graph();
- bfs_wrapper();
-//dump_longlines();
- make_segments();
-dump_linelabel_requests();
-
-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();
-
- printf("Dealing with %d requests\n", num_requests);
-
-/*
- while (! shall_terminate())
- {
- iteration++;
-
- struct individual **swp = population1;
- population1 = population2;
- population2 = swp;
- pop2_ind = 0;
- }
-*/
-
- dump_individual(population1[0]);
-//dump_bitmaps(population1[0]);
-
- for (uns i=0; i<GARY_SIZE(population1[0]->placements); i++)
+ for (uns i=0; i<GARY_SIZE(individual->placements); i++)
{
-//printf("(%d) Coping with %d\n", i, population1[0]->placements[i].request->type);
-
struct symbol *s = NULL;
z_index_t zindex = 0;
- switch (population1[0]->placements[i].request->type)
+ if (individual->placements[i].variant_used < 0) continue;
+ switch (individual->placements[i].request->type)
{
case REQUEST_POINT: ;
- struct request_point *rp = (struct request_point *) population1[0]->placements[i].request;
+ struct request_point *rp = (struct request_point *) individual->placements[i].request;
s = rp->sym;
zindex = rp->zindex;
-// printf("%u\n", zindex);
break;
case REQUEST_SEGMENT: ;
- struct request_segment *rs = (struct request_segment *) population1[0]->placements[i].request;
+ struct request_segment *rs = (struct request_segment *) individual->placements[i].request;
s = rs->label;
-// printf("Assigned label to s\n");
-// print_label(s);
zindex = rs->zindex;
-// printf("%u\n", zindex);
break;
case REQUEST_LINE: ;
-// printf("*** Line detected ***\n");
break;
case REQUEST_AREA: ;
- struct request_area *ra = (struct request_area *) population1[0]->placements[i].request;
+ struct request_area *ra = (struct request_area *) individual->placements[i].request;
s = ra->label;
zindex = ra->zindex;
-// printf("%u\n", zindex);
break;
default:
-// printf("Testing request type (flushing final placements)\n");
- ASSERT(population1[0]->placements[i].request != REQUEST_INVALID);
-// printf("Yep, in default, continuing\n");
+ ASSERT(individual->placements[i].request != REQUEST_INVALID);
continue;
}
-printf("Will plan symbol at [%.2f; %.2f] on %u\n", population1[0]->placements[i].x, population1[0]->placements[i].y, zindex);
+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 = population1[0]->placements[i].x;
- sp->y = population1[0]->placements[i].y;
+ 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 = population1[0]->placements[i].x;
- si->sir.y = population1[0]->placements[i].y;
+ 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 = population1[0]->placements[i].x;
- st->y = population1[0]->placements[i].y;
+ st->x = individual->placements[i].x;
+ st->y = individual->placements[i].y;
st->next_duplicate = NULL;
- printf("Planning text %s at [%.2f; %.2f] on %u\n", osm_val_decode(st->text), st->x, st->y, zindex);
+ 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:
-// printf("Testing symbolizer type\n");
ASSERT(s->type != SYMBOLIZER_INVALID);
}
}
+}
+
+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();
+
+ printf("Dealing with %d requests\n", num_requests);
+
+/*
+ while (! shall_terminate())
+ {
+ iteration++;
+
+ struct individual **swp = population1;
+ population1 = population2;
+ population2 = swp;
+ pop2_ind = 0;
+ }
+*/
+
+ plan_individual(population1[0]);
+
labeller_cleanup();
return;
{
for (int i=0; i<conf_pop_size; i++)
{
- printf("Making individual %d\n", i);
+ 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++]), (struct request *) &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++]), (struct request *) &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++]), (struct request *) &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++]), (struct request *) &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++]), (struct request *) &requests_area[j]);
+ init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_area[j]);
}
-if (p != num_requests)
-{
- printf("Say bye\n");
- exit(42);
-}
+ hide_segment_labels(individual);
-printf("Testing p\n");
ASSERT(p == num_requests);
}
}
// FIXME
}
+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;
+ int x_max = min2(page_width_int, (p->x + v.width + conf_map_part_width - 1)) / conf_map_part_width;
+ int y_min = max2(0, p->y) / conf_map_part_height;
+ int y_max = min2(page_height_int, (p->y + v.height + conf_map_part_height - 1)) / 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 = mp->next;
+ if (mp->next)
+ mp->next->prev = mp->prev;
+ free(mp);
+
+ struct placement_link *tmp = ml;
+ ml = ml->next;
+ free(tmp);
+ }
+
+ 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;
+ 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)
gen_coords_segment(p);
break;
case REQUEST_LINE:
- printf("Not yet implemented\n");
+ if (dbg_movement)
+ printf("Not yet implemented\n");
break;
default:
- printf("Testing request type\n");
+ 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() % 1000000) / 10000;
m = pow(m, 1.0/3) * flip(1, -1);
- printf("Movement %.2f\n", m);
+ if (dbg_movement)
+ printf("Movement %.2f\n", m);
return m;
}
p->x = p->x + gen_movement();
p->y = p->y + gen_movement();
- printf("Moved label to [%.2f; %.2f] from [%.2f; %.2f]\n", p->x, p->y, ra->cx, ra->cy);
+ 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)
case REQUEST_LINE:
case REQUEST_SEGMENT:
case REQUEST_AREA:
- printf("Not yet implemented\n");
+ if (dbg_movement)
+ printf("Not yet implemented\n");
default:
ASSERT(p->request->type != REQUEST_INVALID);
}
p->y += (double) (move_min + randdouble()) * flip(1, -1);
}
-void init_placement(struct placement *p, struct request *r)
+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->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: ;
}
gen_coords(p);
-// printf("Inited placement to [%.2f; %.2f]\n", p->x, p->y);
+ 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 UNUSED)
projects / leo.git / blobdiff