5 #include <ucw/mempool.h>
6 #include <ucw/eltpool.h>
13 #define HASH_NODE struct graph_node
14 #define HASH_PREFIX(x) hash_##x
15 #define HASH_KEY_ATOMIC id
16 #define HASH_WANT_FIND
18 #define HASH_WANT_CLEANUP
19 #include <ucw/hashtable.h>
26 #define BLOCK_SIZE 4096
28 //struct mempool *mpool_requests;
30 static struct request_point *requests_point;
31 static struct request_line *requests_line;
32 static struct request_area *requests_area;
34 static struct graph_edge **bfs_queue;
35 static struct longline *longlines; int num_longlines;
36 static struct buffer_line *buffer_line;
37 static struct buffer_linelabel *buffer_linelabel;
39 struct eltpool *ep_individuals;
41 struct individual **population1;
42 struct individual **population2;
55 int conf_pop_size = 50;
57 int conf_penalty_bound = 0;
58 int conf_stagnation_bound = 0;
59 int conf_iteration_limit = 4;
61 int conf_term_cond = TERM_COND_ITERATIONS;
63 int conf_breed_rbest_perc = 80;
64 int conf_breed_pop_size_perc = 20;
65 int conf_breed_perc = 50; // Percentage of new pop created by breeding
67 bool conf_mutate_children = 1;
68 int conf_mutate_children_prob = 0.3;
70 int conf_mutate_rbest_perc = 60;
71 int conf_mutate_pop_size_perc = 20;
73 int conf_mutate_move_bound = 0.2;
74 int conf_mutate_regen_bound = 0.1;
75 int conf_mutate_chvar_bound = 0.1;
77 int conf_elite_perc = 5;
79 double conf_max_section_length = 100;
80 double conf_max_section_overlay = 10;
82 int old_best = 0; // FIXME: Shall be int max
86 int conf_part_size = 50;
93 void make_graph(void);
94 void label_graph(void);
95 void join_edge(struct graph_edge *e, int dir);
96 void bfs(uns longline);
97 void make_segments(void);
99 void make_population(void);
100 bool shall_terminate(void);
104 void rank_population(void);
105 void plan_individual(struct individual *individual);
107 void make_bitmap(struct point_variant *v, struct symbol *sym);
108 void make_bitmap_icon(struct point_variant *v, struct sym_icon *si);
109 void make_bitmap_point(struct point_variant *v, struct sym_point *sp);
110 void make_bitmap_label(struct point_variant *v, struct sym_text *text);
112 void cut_edge(struct graph_edge *e, double dist);
113 struct request_line *make_new_line(void);
114 struct request_section *make_new_section(struct request_line *rl);
115 struct request_segment *make_new_segment(struct request_section *rls, struct symbol *sym);
117 void dump_bitmaps(struct individual *individual);
118 void dump_graph(void);
120 void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir);
121 void bfs_wrapper(void);
123 void dump_longlines(void);
124 void dump_linelabel_requests(void);
125 void dump_individual(struct individual *individual);
126 void print_label(struct symbol *sym);
128 double gen_movement(void);
129 void gen_coords(struct placement *p);
130 void gen_coords_point(struct placement *p);
131 void gen_coords_segment(struct placement *p);
132 void gen_coords_area(struct placement *p);
134 void make_segments_old(void);
136 void labeller_cleanup(void);
138 struct individual **perform_crossover(struct individual *parent1, struct individual *parent2);
139 void perform_mutation(struct individual *individual);
141 void init_placement(struct placement *p, struct request *r);
142 void init_individual(struct individual *i);
143 struct map_part **get_parts(struct placement *symbol, struct individual *individual);
145 int randint(int min, int max);
147 struct placement **get_closure(struct placement *placement, struct individual *parent1, struct individual *parent2);
148 void copy_symbols(struct placement **closure, struct individual *parent, struct individual *child);
149 void move_symbol(struct placement *p);
150 void move_symbol_point(struct placement *p);
152 struct placement **get_overlapping(struct placement *p);
153 void filter(struct placement **list, bool *pred);
155 int flip(int a, int b);
156 double randdouble(void);
160 void copy_individual(struct individual *src, struct individual *dest);
162 int max2(int a, int b);
163 int min2(int a, int b);
164 int max4(int a, int b, int c, int d);
165 int min4(int a, int b, int c, int d);
167 int max2(int a, int b)
169 return (a > b ? a : b);
172 int min2(int a, int b)
174 return (a < b ? a : b);
177 int max4(int a, int b, int c, int d)
179 return max2(max2(a, b), max2(c, d));
182 int min4(int a, int b, int c, int d)
184 return min2(min2(a, b), min2(c, d));
187 void print_label(struct symbol *sym)
191 case SYMBOLIZER_TEXT: ;
192 struct sym_text *st = (struct sym_text *) sym;
193 printf("%s\n", osm_val_decode(st->text));
200 void labeller_init(void)
202 GARY_INIT(requests_point, 0);
203 GARY_INIT(requests_line, 0);
204 GARY_INIT(requests_area, 0);
205 GARY_INIT(buffer_line, 0);
206 GARY_INIT(buffer_linelabel, 0);
207 ep_individuals = ep_new(sizeof(struct individual), 1);
209 page_width_int = floor(page_width);
210 page_height_int = floor(page_height);
213 void make_bitmap(struct point_variant *v, struct symbol *sym)
217 case SYMBOLIZER_POINT:
218 make_bitmap_point(v, (struct sym_point *) sym);
220 case SYMBOLIZER_ICON:
221 make_bitmap_icon(v, (struct sym_icon *) sym);
223 case SYMBOLIZER_TEXT:
224 make_bitmap_label(v, (struct sym_text *) sym);
227 ASSERT(sym->type != SYMBOLIZER_INVALID);
231 void make_bitmap_icon(struct point_variant *v, struct sym_icon *si)
233 v->width = si->sir.icon->width;
234 v->height = si->sir.icon->height;
235 v->bitmap = malloc((int) ceil(v->width * v->height * sizeof(bool)));
236 for (int i=0; i<v->width*v->height; i++) v->bitmap[i] = 1;
239 void make_bitmap_point(struct point_variant *v, struct sym_point *sp)
241 v->width = v->height = sp->size;
242 v->bitmap = malloc(sp->size*sp->size * sizeof(bool));
243 // FIXME: Okay, memset would be much nicer here
244 for (int i=0; i<sp->size*sp->size; i++) v->bitmap[i] = 1;
247 void make_bitmap_label(struct point_variant *v, struct sym_text *text)
258 v->width = max4(x_ld, x_lu, x_rd, x_ru) - min4(x_ld, x_lu, x_rd, x_ru);
259 v->height = max4(y_ld, y_lu, y_rd, y_ru) - min4(y_ld, y_lu, y_rd, y_ru);
260 //v->bitmap = malloc((int) (ceil(v->width) * ceil(v->height) * sizeof(bool)));
262 v->width = ceil(text->tw);
263 v->height = ceil(text->th);
264 v->bitmap = malloc(v->width * v->height * sizeof(bool));
265 // printf("Allocated bitmap of %d bools for %d x %d label\n", v->width * v->height, v->width, v->height);
266 for (int i=0; i<v->height; i++)
267 for (int j=0; j<v->width; j++)
269 v->bitmap[i*v->width + j] = 1;
270 // printf("Writing at %d\n", i*v->width + j);
274 void labeller_add_point(struct symbol *sym, struct osm_object *object, z_index_t zindex)
276 printf("Adding point\n");
277 if (object->type != OSM_TYPE_NODE)
279 printf("Warning: Point label requested on non-point object\n");
283 struct request_point *r = GARY_PUSH(requests_point);
285 r->request.type = REQUEST_POINT;
286 r->request.ind = num_requests++;
295 GARY_INIT(r->variants, 0);
297 struct point_variant *v = GARY_PUSH(r->variants);
299 struct osm_node *n = (struct osm_node *) object; // FIXME: Compiler warning
304 case SYMBOLIZER_ICON:
305 make_bitmap_icon(v, (struct sym_icon *) sym);
306 r->x = ((struct sym_icon *)sym)->sir.x;
307 r->y = ((struct sym_icon *)sym)->sir.y;
309 case SYMBOLIZER_POINT:
310 make_bitmap_point(v, (struct sym_point *) sym);
312 case SYMBOLIZER_TEXT: ;
313 struct sym_text *st = (struct sym_text *) sym;
314 struct osm_node *n = (struct osm_node *) object;
315 make_bitmap_label(v, st);
321 // printf("Inited point to [%.2f; %.2f] on %u\n", r->x, r->y, r->zindex);
324 void labeller_add_line(struct symbol *sym, z_index_t zindex)
326 printf("Adding line on %u\n", zindex);
327 struct buffer_line *b = GARY_PUSH(buffer_line);
328 b->line = (struct sym_line *) sym;
330 sym_plan(sym, zindex);
333 void labeller_add_linelabel(struct symbol *sym, struct osm_object *o, z_index_t zindex)
335 if (o->type != OSM_TYPE_WAY)
341 printf("[LAB] Labelling way %ju on %u\n", o->id, zindex);
342 struct buffer_linelabel *ll = GARY_PUSH(buffer_linelabel);
343 ll->way = (struct osm_way *) o;
348 void labeller_add_arealabel(struct symbol *sym, struct osm_object *o, z_index_t zindex)
350 printf("Adding area on %u\n", zindex);
351 struct request_area *r = GARY_PUSH(requests_area);
353 r->request.type = REQUEST_AREA;
354 r->request.ind = num_requests++;
356 r->o = (struct osm_multipolygon *) o;
360 osm_obj_center(o, &(r->cx), &(r->cy));
362 GARY_INIT(r->variants, 0);
363 struct point_variant *v = GARY_PUSH(r->variants);
366 case SYMBOLIZER_ICON:
367 printf("DEBUG: Icon label\n");
368 make_bitmap_icon(v, (struct sym_icon *) sym);
370 case SYMBOLIZER_TEXT:
371 printf("DEBUG: Text label\n");
372 make_bitmap_label(v, (struct sym_text *) sym);
379 void make_graph(void)
382 struct mempool *mp_edges = mp_new(BLOCK_SIZE);
384 printf("Extracting nodes, will iterate over %lld ways\n", GARY_SIZE(buffer_line));
385 for (uns i=0; i<GARY_SIZE(buffer_line); i++)
387 struct osm_way *way = (struct osm_way *) buffer_line[i].line->s.o;
388 struct graph_node *g_prev = NULL;
389 struct osm_node *o_prev = NULL;
391 CLIST_FOR_EACH(struct osm_ref *, ref, way->nodes)
393 // FIXME: Shall osm_object's type be checked here?
394 struct osm_node *o_node = (struct osm_node *) ref->o;
396 struct graph_node *g_node = hash_find(ref->o->id);
399 g_node = hash_new(ref->o->id);
400 GARY_INIT(g_node->edges, 0);
402 g_node->id = ref->o->id;
403 g_node->num = num_nodes++;
413 struct graph_edge *e = mp_alloc(mp_edges, sizeof(struct graph_edge)); num_edges_dbg++;
414 e->num = num_edges++;
415 e->id = buffer_line[i].line->s.o->id;
416 e->color = buffer_line[i].line->color;
417 e->length = hypot(abs(o_prev->x - o_node->x), abs(o_prev->y - o_node->y));
423 e->longline = (uns) -1;
424 e->line = buffer_line[i].line;
428 struct graph_edge **edge = GARY_PUSH(g_prev->edges);
430 edge = GARY_PUSH(g_node->edges);
438 printf("Made graph with %d edges\n", num_edges_dbg);
441 void dump_graph(void)
443 HASH_FOR_ALL(hash, node)
445 printf("* Node: (%d) #%ju [%.2f; %.2f]\n", node->num, node->id, node->o->x, node->o->y);
446 for (uns i=0; i<GARY_SIZE(node->edges); i++)
448 struct graph_edge *e = node->edges[i];
449 printf("\t edge (%d) #%ju to ", e->num, e->id);
450 if (node->edges[i]->n1->id == node->id)
451 printf("(%d) #%ju [%.2f; %.2f]\n", e->n2->num, e->n2->id, e->n2->o->x, e->n2->o->y);
452 else if (node->edges[i]->n2->id == node->id)
453 printf("(%d) #%ju [%.2f; %.2f]\n", e->n1->num, e->n1->id, e->n1->o->x, e->n1->o->y);
455 printf("BEWARE! BEWARE! BEWARE!\n");
458 if ((node->edges[i]->label)) printf("Labelled\n");
459 if ((node->edges[i]->label) && (node->edges[i]->label->type == SYMBOLIZER_TEXT)) printf(" labelled %s;", osm_val_decode(((struct sym_text *) node->edges[i]->label)->text));
460 printf(" colored %d;", node->edges[i]->color);
461 printf(" length %.2f", node->edges[i]->length);
468 void label_graph(void)
470 printf("There are %u line labels requested\n", GARY_SIZE(buffer_linelabel));
471 for (uns i=0; i<GARY_SIZE(buffer_linelabel); i++)
473 if (buffer_linelabel[i].label->type == SYMBOLIZER_TEXT)
474 printf("Labelling nodes of way %s\n", osm_val_decode(((struct sym_text *) buffer_linelabel[i].label)->text));
475 CLIST_FOR_EACH(struct osm_ref *, ref, buffer_linelabel[i].way->nodes)
477 printf("Looking for node %ju\n", ref->o->id);
478 struct graph_node *n = hash_find(ref->o->id);
481 // FIXME: What shall be done?
485 printf("Searching among %u edges\n", GARY_SIZE(n->edges));
486 for (uns j=0; j<GARY_SIZE(n->edges); j++)
488 if (n->edges[j]->id == buffer_linelabel[i].way->o.id)
490 printf("Labelling node %ju\n", n->id);
491 n->edges[j]->label = buffer_linelabel[i].label;
492 n->edges[j]->zindex = buffer_linelabel[i].zindex;
500 void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir)
502 printf("BFS edge called for edge %d (going %d) in direction %d\n", e->num, e->dir, dir);
503 struct graph_edge *candidate = NULL;
505 for (uns i=0; i<GARY_SIZE(node->edges); i++)
507 struct graph_edge *other = node->edges[i];
508 if (e->num == 987) printf("Got label %d\n", e->num);
509 if ((other->longline != (uns) -1) && (other->longline != e->longline)) continue;
510 if (e->num == 987) printf("Continuing with edge %d\n", e->num);
512 printf("Testing %d ?= %d\n", other->visited, e->longline);
513 if ((uns) other->visited != e->longline) {
514 printf("Pushing new edge %d / %ju\n", other->num, other->id);
515 struct graph_edge **e_ptr = GARY_PUSH(bfs_queue);
517 other->visited = e->longline;
520 if (((other->n1->id == node->id) && (other->n2->id == anode->id)) ||
521 ((other->n2->id == node->id) && (other->n1->id == anode->id)))
524 if (((other->n1->id == node->id) || (other->n2->id == node->id)) &&
525 (e->label) && (other->label) &&
526 (e->label->type == SYMBOLIZER_TEXT) && (other->label->type == SYMBOLIZER_TEXT) &&
527 (((struct sym_text *) e->label)->text == ((struct sym_text *) other->label)->text))
529 if (! candidate || (other->length > candidate->length))
536 printf("New line in longline %u\n", e->longline);
537 struct graph_edge *other = candidate;
538 other->longline = e->longline;
540 if (((dir == DIR_BWD) && (other->n1->id == node->id)) ||
541 ((dir == DIR_FWD) && (other->n2->id == node->id)))
543 struct graph_node *swp = other->n2;
544 other->n2 = other->n1;
553 longlines[other->longline].first = other;
566 void bfs(uns longline)
568 printf("BFS called for longline %u\n", longline);
569 printf("%d longlines are believed to exist, %d exist\n", num_longlines, GARY_SIZE(longlines));
570 for (uns i=0; i<GARY_SIZE(bfs_queue); i++)
572 struct graph_edge *cur = bfs_queue[i];
573 printf("Exploring new edge %d; %d remaining\n", cur->num, GARY_SIZE(bfs_queue));
574 //ASSERT(! cur->visited);
576 cur->visited = longline;
578 if (cur->longline == (uns) -1)
581 if (cur->dir == DIR_UNSET)
583 cur->dir = DIR_CENTER;
584 bfs_edge(cur, cur->n1, cur->n2, DIR_BWD);
585 bfs_edge(cur, cur->n2, cur->n1, DIR_FWD);
592 bfs_edge(cur, cur->n1, cur->n2, cur->dir);
595 bfs_edge(cur, cur->n2, cur->n1, cur->dir);
605 void bfs_wrapper(void)
607 GARY_INIT(bfs_queue, 0);
608 GARY_INIT(longlines, 0);
610 HASH_FOR_ALL(hash, node)
612 for (uns i=0; i<GARY_SIZE(node->edges); i++)
614 if ((node->edges[i]->label) && (node->edges[i]->longline == (uns) -1))
616 GARY_PUSH(longlines);
617 longlines[num_longlines].first = node->edges[i];
618 printf("Running new BFS\n");
619 printf("Creating longline %u\n", num_longlines);
620 GARY_RESIZE(bfs_queue, 0);
621 struct graph_edge **e = GARY_PUSH(bfs_queue);
623 node->edges[i]->longline = num_longlines;
624 bfs(node->edges[i]->longline);
626 printf("Joined %d edges\n", dbg_num_hits); dbg_num_hits = 0;
627 printf("Planned %u edges\n", GARY_SIZE(bfs_queue));
634 GARY_FREE(bfs_queue);
637 void dump_longlines(void)
639 printf("*** Longlines dump\n");
640 for (uns i=0; i<GARY_SIZE(longlines); i++)
642 printf("Longline %u:", i);
643 struct graph_edge *e = longlines[i].first;
644 if ((e->label) && (e->label->type == SYMBOLIZER_TEXT))
645 printf(" labelled %s", osm_val_decode(((struct sym_text *) e->label)->text));
650 printf("\t#%ju (%d): [%.2f; %.2f] -- [%.2f; %.2f] (dir %d)\n",
651 e->id, e->num, e->n1->o->x, e->n1->o->y, e->n2->o->x, e->n2->o->y, e->dir);
658 struct request_line *make_new_line(void)
660 struct request_line *rl = GARY_PUSH(requests_line);
661 rl->request.ind = num_requests++;
662 rl->request.type = REQUEST_LINE;
663 GARY_INIT(rl->sections, 0);
668 struct request_section *make_new_section(struct request_line *rl)
670 struct request_section *rls = GARY_PUSH(rl->sections);
671 rls->request.ind = num_requests++;
672 rls->request.type = REQUEST_SECTION;
673 rls->num_segments = 0;
674 GARY_INIT(rls->segments, 0);
679 struct request_segment *make_new_segment(struct request_section *rls, struct symbol *sym)
681 struct request_segment *rs = GARY_PUSH(rls->segments);
684 rs->request.ind = num_requests++;
685 rs->request.type = REQUEST_SEGMENT;
687 struct point_variant *v = malloc(sizeof(struct point_variant));
694 void cut_edge(struct graph_edge *e, double dist)
697 printf("Cutting [%.2f; %.2f] -- [%.2f; %.2f] to dist %.2f\n", e->n1->o->x, e->n1->o->y, e->n2->o->x, e->n2->o->y, dist);
699 struct graph_edge *new = malloc(sizeof(struct graph_edge));
703 struct osm_node *n1 = e->n1->o;
704 struct osm_node *n2 = e->n2->o;
707 if ((n1->x == n2->x) && (n1->y == n2->y))
709 printf("[%.2f; %.2f] -- [%.2f; %.2f]\n", n1->x, n1->y, n2->x, n2->y);
710 printf("Won't cut point\n");
714 struct osm_node *n11 = malloc(sizeof(struct osm_node));
715 struct graph_node *gn = malloc(sizeof(struct graph_node));
717 double vsize = sqrt(pow(n1->x - n2->x, 2) + pow(n1->y - n2->y, 2));
718 n11->x = n1->x + (n2->x - n1->x) / vsize * dist;
719 n11->y = n1->y + (n2->y - n1->y) / vsize * dist;
721 e->n2 = new->n1 = gn;
723 e->length = hypot(abs(n1->x - n11->x), abs(n1->y - n11->y));
724 new->length = hypot(abs(n11->x - n2->x), abs(n11->y - n2->y));
727 void make_segments(void)
729 for (uns i=0; i<GARY_SIZE(longlines); i++)
731 // Skip lines which are not labelled
732 if (! (longlines[i].first && longlines[i].first->label))
735 struct request_line *request = make_new_line();
736 struct request_section *rls = make_new_section(request);
737 struct request_segment *rs = NULL;
739 struct graph_edge *e = longlines[i].first;
740 double cur_length = 0;
742 struct sym_text *st = NULL;
743 if (e->label->type == SYMBOLIZER_TEXT)
745 st = (struct sym_text *) e->label;
749 printf("Warning: Skipping line\n");
754 printf("New longline\n");
757 if (cur_length + e->length > conf_max_section_length + conf_max_section_overlay)
760 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);
761 cut_edge(e, conf_max_section_length - cur_length);
764 if (cur_length + e->length > conf_max_section_length)
767 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);
769 struct osm_node *n1 = e->n1->o;
770 struct osm_node *n2 = e->n2->o;
771 rs = make_new_segment(rls, e->label);
776 rs->zindex = e->zindex;
778 rs->label = malloc(sizeof(struct sym_text));
779 *((struct sym_text *) rs->label) = *((struct sym_text *) e->label);
780 rls = make_new_section(request);
784 if (st && (e->length < st->tw))
787 printf("Warning: Skipping segment\n");
791 rs = make_new_segment(rls, e->label);
792 rs->label = malloc(sizeof(struct sym_text));
793 *((struct sym_text *) rs->label) = *((struct sym_text *) e->label);
795 rs->x1 = e->n1->o->x;
796 rs->y1 = e->n1->o->y;
797 rs->x2 = e->n2->o->x;
798 rs->y2 = e->n2->o->y;
800 rs->angle = atan2(rs->x2 - rs->x1, rs->y2 - rs->y1);
801 rs->zindex = e->zindex;
803 cur_length += e->length;
807 if (request->sections[0].num_segments == 0)
810 printf("WARNING: 0 segment section\n");
811 GARY_POP(requests_line);
817 void dump_linelabel_requests(void)
819 for (uns i=0; i<GARY_SIZE(requests_line); i++)
821 if (requests_line[i].sections[0].num_segments == 0)
826 printf("Request for linelabel, %d sections\n", GARY_SIZE(requests_line[i].sections));
827 print_label(requests_line[i].sections[0].segments[0].label);
828 for (uns j=0; j<GARY_SIZE(requests_line[i].sections); j++)
830 printf("%d section, %d segments\n", j, GARY_SIZE(requests_line[i].sections[j].segments));
831 for (uns k=0; k<GARY_SIZE(requests_line[i].sections[j].segments); k++)
833 struct request_segment *rs = &requests_line[i].sections[j].segments[k];
834 printf("[%.2f; %.2f] -- [%.2f; %.2f]\n", rs->x1, rs->y1, rs->x2, rs->y2);
841 void dump_bitmaps(struct individual *individual)
843 bool *bitmap = malloc(page_width_int * page_height_int * sizeof(bool));
844 printf("Bitmap size is %d\n", page_width_int * page_height_int);
845 for (int i=0; i<page_height_int; i++)
846 for (int j=0; j<page_width_int; j++)
847 bitmap[i*page_width_int + j] = 0;
849 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
851 fprintf(stderr, "%d-th placement\n", i);
852 struct placement *p = &(individual->placements[i]);
853 struct point_variant *v = NULL;
855 switch (p->request->type)
857 case REQUEST_SEGMENT: ;
858 struct request_segment *rs = (struct request_segment *) p->request;
861 case REQUEST_POINT: ;
862 struct request_point *rp = (struct request_point *) p->request;
863 v = &(rp->variants[p->variant_used]);
866 struct request_area *ra = (struct request_area *) p->request;
867 printf("Using %d-th of %d variants\n", p->variant_used, GARY_SIZE(ra->variants));
868 v = &(ra->variants[p->variant_used]);
871 printf("Testing request type (dump_bitmaps): %d\n", p->request->type);
872 ASSERT(p->request->type != REQUEST_INVALID);
876 printf("Got after with %d-th placement of request type %d\n", i, p->request->type);
878 printf("Rendering %d-th label %d x %d (w x h)\n", i, v->width, v->height);
879 for (int row = max2(p->y, 0); row < min2(p->y + v->height, page_height_int); row++)
881 for (int col = max2(p->x, 0); col < min2(p->x + v->width, page_width_int); col++)
883 printf("Writing to %d\n", row*page_width_int + col);
884 bitmap[row * page_width_int + col] = 1;
890 FILE *fd_dump = fopen("dump.pbm", "w");
891 fprintf(fd_dump, "P1\n");
892 fprintf(fd_dump, "%d %d\n", page_width_int, page_height_int);
893 for (int i=0; i<page_height_int; i++)
895 for (int j=0; j<page_width_int; j++)
897 fprintf(fd_dump, "%d", bitmap[(int) (i*page_width_int + j)] ? 1 : 0);
899 fprintf(fd_dump, "\n");
904 void dump_individual(struct individual *individual)
906 printf("*** Dumping INDIVIDUAL ***\n");
907 printf("(There are %d requests)\n", num_requests);
908 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
910 struct placement *p = &(individual->placements[i]);
912 switch (p->request->type)
915 printf("Point at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_point *) p->request)->zindex);
918 struct request_line *rl = (struct request_line *) p->request;
920 print_label(rl->sections[0].segments[0].label);
922 case REQUEST_SECTION: ;
925 case REQUEST_SEGMENT: ;
926 if (p->variant_used >= 0)
927 printf("Segment placed at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_segment *) p->request)->zindex);
929 printf("Segment not placed\n");
932 struct request_area *ra = (struct request_area *) p->request;
933 printf("Area label ");
934 print_label(ra->label);
935 printf(" at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_area *) p->request)->zindex);
938 printf("Testing request type (dump_individual)\n");
939 ASSERT(p->request->type != 0);
942 printf("\nTotal penalty: %d\n", individual->penalty);
945 void plan_individual(struct individual *individual)
947 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
949 struct symbol *s = NULL;
950 z_index_t zindex = 0;
951 switch (individual->placements[i].request->type)
953 case REQUEST_POINT: ;
954 struct request_point *rp = (struct request_point *) individual->placements[i].request;
958 case REQUEST_SEGMENT: ;
959 struct request_segment *rs = (struct request_segment *) individual->placements[i].request;
966 struct request_area *ra = (struct request_area *) individual->placements[i].request;
971 ASSERT(individual->placements[i].request != REQUEST_INVALID);
976 printf("Will plan symbol at [%.2f; %.2f] on %u\n", individual->placements[i].x, individual->placements[i].y, zindex);
978 if (s) switch (s->type)
980 case SYMBOLIZER_POINT: ;
981 struct sym_point *sp = (struct sym_point *) s;
982 sp->x = individual->placements[i].x;
983 sp->y = individual->placements[i].y;
984 sym_plan((struct symbol *) sp, zindex);
986 case SYMBOLIZER_ICON: ;
987 struct sym_icon *si = (struct sym_icon *) s;
988 si->sir.x = individual->placements[i].x;
989 si->sir.y = individual->placements[i].y;
990 sym_plan((struct symbol *) si, zindex);
992 case SYMBOLIZER_TEXT: ;
993 struct sym_text *st = (struct sym_text *) s;
994 st->x = individual->placements[i].x;
995 st->y = individual->placements[i].y;
996 st->next_duplicate = NULL;
997 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);
998 sym_plan((struct symbol *) st, zindex);
1001 ASSERT(s->type != SYMBOLIZER_INVALID);
1007 void labeller_label(void)
1015 dump_linelabel_requests();
1017 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));
1019 GARY_INIT(population1, conf_pop_size);
1020 GARY_INIT(population2, conf_pop_size);
1023 printf("Dealing with %d requests\n", num_requests);
1026 while (! shall_terminate())
1030 struct individual **swp = population1;
1031 population1 = population2;
1037 dump_individual(population1[0]);
1038 //dump_bitmaps(population1[0]);
1040 plan_individual(population1[0]);
1047 void labeller_cleanup(void)
1051 void make_population(void)
1053 for (int i=0; i<conf_pop_size; i++)
1055 printf("Making individual %d\n", i);
1056 struct individual *individual = ep_alloc(ep_individuals); init_individual(individual);
1057 population1[i] = individual;
1060 for (uns j=0; j<GARY_SIZE(requests_point); j++)
1062 init_placement(&(individual->placements[p++]), (struct request *) &requests_point[j]);
1065 for (uns j=0; j<GARY_SIZE(requests_line); j++)
1067 init_placement(&(individual->placements[p++]), (struct request *) &requests_line[j]);
1069 for (uns k=0; k<GARY_SIZE(requests_line[j].sections); k++)
1071 init_placement(&(individual->placements[p++]), (struct request *) &requests_line[j].sections[k]);
1073 for (uns l=0; l<GARY_SIZE(requests_line[j].sections[k].segments); l++)
1075 init_placement(&(individual->placements[p++]), (struct request *) &requests_line[j].sections[k].segments[l]);
1080 for (uns j=0; j<GARY_SIZE(requests_area); j++)
1082 init_placement(&(individual->placements[p++]), (struct request *) &requests_area[j]);
1085 if (p != num_requests)
1087 printf("Say bye\n");
1091 printf("Testing p\n");
1092 ASSERT(p == num_requests);
1096 bool shall_terminate(void)
1098 switch (conf_term_cond)
1100 case TERM_COND_PENALTY:
1101 return (population1[0]->penalty < conf_penalty_bound);
1102 case TERM_COND_STAGNATION:
1103 return (abs(old_best - population1[0]->penalty) < conf_stagnation_bound);
1104 case TERM_COND_ITERATIONS:
1105 return (iteration >= conf_iteration_limit);
1107 // FIXME: Warn the user that no condition is set
1116 printf("%.2f\n", ((double) conf_breed_pop_size_perc/100));
1117 int conf_breed_pop_size = ((double) conf_breed_pop_size_perc/100) * conf_pop_size;
1118 struct individual **breed_buffer;
1119 while (i < conf_breed_pop_size)
1121 printf("%d < %d, breeding\n", i, conf_breed_pop_size);
1122 int parent1 = randint(1, conf_breed_pop_size);
1123 int parent2 = randint(1, conf_breed_pop_size);
1124 printf("Will breed %d and %d, chosen of %d best of %d population (intended to be %d)\n", parent1, parent2, conf_breed_pop_size, GARY_SIZE(population1), conf_pop_size);
1125 breed_buffer = perform_crossover(population1[parent1], population1[parent2]);
1126 population2[pop2_ind++] = breed_buffer[0];
1127 population2[pop2_ind++] = breed_buffer[1];
1132 acc += conf_breed_rbest_perc;
1134 return; // FIXME: DEBUG HACK
1136 int remaining = (1 - acc) * (conf_pop_size * conf_breed_perc);
1137 int step = remaining / conf_pop_size;
1138 for (; i<conf_pop_size; i += 2)
1140 printf("Asking for %d and %d of %d\n", i*step, i*(step+1), conf_pop_size);
1141 breed_buffer = perform_crossover(population1[i*step], population1[i*step+1]);
1142 population2[pop2_ind++] = breed_buffer[0];
1143 population2[pop2_ind++] = breed_buffer[1];
1146 // FIXME: Could there be one missing individual?
1149 struct individual **perform_crossover(struct individual *parent1, struct individual *parent2)
1151 struct individual **buffer = malloc(2*sizeof(struct individual));
1152 struct individual *child1 = ep_alloc(ep_individuals); init_individual(child1);
1153 struct individual *child2 = ep_alloc(ep_individuals); init_individual(child2);
1155 printf("Performing crossover\n");
1157 for (uns i=0; i<GARY_SIZE(parent1->placements); i++)
1159 printf("%dth placement out of %d\n", i, num_requests);
1160 if (! parent1->placements[i].processed)
1162 struct placement **clos_symbols = get_closure(&(parent1->placements[i]), parent1, parent2);
1163 int x = randint(1, 2);
1167 copy_symbols(clos_symbols, parent1, child1);
1168 copy_symbols(clos_symbols, parent2, child2);
1172 copy_symbols(clos_symbols, parent2, child1);
1173 copy_symbols(clos_symbols, parent1, child2);
1175 printf("Symbols copied; %lld\n", GARY_SIZE(clos_symbols));
1176 GARY_FREE(clos_symbols);
1179 if (conf_mutate_children)
1181 if (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child1);
1182 if (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child2);
1194 int conf_mutate_pop_size = conf_mutate_pop_size_perc * conf_pop_size;
1195 while (i < conf_mutate_rbest_perc * conf_pop_size)
1197 int ind = randint(1, conf_mutate_pop_size);
1198 copy_individual(population2[pop2_ind], population1[ind]);
1199 perform_mutation(population2[pop2_ind]);
1204 void perform_mutation(struct individual *individual)
1206 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
1208 int x = randint(1, 1000);
1211 if (x <= acc + conf_mutate_move_bound)
1213 move_symbol(&(individual->placements[i]));
1216 acc += conf_mutate_move_bound;
1218 if (x <= acc + conf_mutate_regen_bound)
1220 gen_coords(&(individual->placements[i]));
1223 acc += conf_mutate_regen_bound;
1225 if (x <= acc + conf_mutate_chvar_bound)
1227 if (0) // if num_variants > 1
1229 // FIXME: assign new variant
1237 for (int i=0; i<conf_elite_perc * conf_pop_size; i++)
1239 population2[pop2_ind++] = population1[0];
1243 void rank_population(void)
1248 void gen_coords(struct placement *p)
1250 switch(p->request->type)
1253 gen_coords_point(p);
1258 case REQUEST_SEGMENT:
1259 gen_coords_segment(p);
1262 printf("Not yet implemented\n");
1265 printf("Testing request type\n");
1266 ASSERT(p->request->type != REQUEST_INVALID);
1270 double gen_movement(void)
1272 double m = (random() % 1000000) / 10000;
1273 m = pow(m, 1.0/3) * flip(1, -1);
1274 printf("Movement %.2f\n", m);
1278 void gen_coords_point(struct placement *p)
1280 p->x = p->x + gen_movement();
1283 void gen_coords_segment(struct placement *p)
1285 struct request_segment *rs = (struct request_segment *) p->request;
1287 p->x = (a == 1 ? rs->x1 : rs->x2);
1288 p->y = (a == 1 ? rs->y1 : rs->y2);
1291 void gen_coords_area(struct placement *p)
1293 struct request_area *ra = (struct request_area *) p->request;
1295 p->x = p->x + gen_movement();
1296 p->y = p->y + gen_movement();
1298 printf("Moved label to [%.2f; %.2f] from [%.2f; %.2f]\n", p->x, p->y, ra->cx, ra->cy);
1301 struct map_part **get_parts(struct placement *symbol, struct individual *individual)
1303 struct map_part **buffer;
1304 GARY_INIT(buffer, 0);
1305 int x_min = symbol->x / conf_part_size;
1306 int x_max = (symbol->x /*+ symbol->bitmap->width*/ + conf_part_size - 1) / conf_part_size;
1307 int y_min = symbol->y / conf_part_size;
1308 int y_max = (symbol->y /*+ symbol->bitmap->height*/ + conf_part_size - 1) / conf_part_size;
1310 for (int x=x_min; x < x_max; x++)
1311 for (int y=y_min; y < y_max; y++)
1313 struct map_part *m = GARY_PUSH(buffer);
1314 *m = individual->map[x][y];
1320 int randint(int min, int max)
1322 if (min == max) return min;
1324 //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)));
1325 return min + (r % (max - min));
1326 return (r * (max - min));
1329 struct placement **get_closure(struct placement *placement, struct individual *parent1, struct individual *parent2 UNUSED)
1331 printf("Getting closure\n");
1332 struct placement **closure;
1333 GARY_INIT(closure, 0);
1334 bool *chosen = malloc(GARY_SIZE(parent1->placements) * sizeof(bool));
1335 chosen[placement->request->ind] = 1;
1337 struct placement **p = GARY_PUSH(closure); *p = placement;
1340 while (first < GARY_SIZE(closure))
1342 printf("Iterating, first is %d\n", first);
1343 struct placement **overlapping = get_overlapping(placement);
1344 filter(overlapping, chosen);
1345 for (uns j=0; j<GARY_SIZE(overlapping); j++)
1347 p = GARY_PUSH(closure); *p = overlapping[j];
1348 chosen[overlapping[j]->request->ind] = 1;
1350 GARY_FREE(overlapping);
1357 void copy_symbols(struct placement **closure, struct individual *parent, struct individual *child)
1359 //printf("%d\n", child->penalty);
1360 //printf("Closure size: %lld\n", GARY_SIZE(closure));
1361 for (uns i=0; i<GARY_SIZE(closure); i++)
1363 int ind = closure[i]->request->ind;
1364 child->placements[ind] = parent->placements[ind];
1365 child->placements[ind].processed = 0;
1369 void move_symbol(struct placement *p)
1371 switch (p->request->type)
1374 move_symbol_point(p);
1376 case REQUEST_SEGMENT:
1378 printf("Not yet implemented\n");
1380 ASSERT(p->request->type != REQUEST_INVALID);
1384 void move_symbol_point(struct placement *p)
1386 p->x += (double) (move_min + randdouble()) * flip(1, -1);
1387 p->y += (double) (move_min + randdouble()) * flip(1, -1);
1390 void init_placement(struct placement *p, struct request *r)
1395 p->x = p->y = 0; // To prevent valgrind from complaining
1396 p->variant_used = 0;
1399 case REQUEST_POINT: ;
1400 struct request_point *rp = (struct request_point *) r;
1404 case REQUEST_LINE: ;
1406 case REQUEST_SECTION: ;
1407 struct request_section *rls = (struct request_section *) r;
1408 p->variant_used = randint(0, rls->num_segments);
1410 case REQUEST_SEGMENT: ;
1411 struct request_segment *rs = (struct request_segment *) r;
1415 case REQUEST_AREA: ;
1416 struct request_area *ra = (struct request_area *) r;
1419 p->variant_used = 0;
1422 ASSERT(p->request->type != REQUEST_INVALID);
1423 printf("Valid request: %d\n", p->request->type);
1427 // printf("Inited placement to [%.2f; %.2f]\n", p->x, p->y);
1430 void init_individual(struct individual *i)
1432 //printf("Initing individual\n");
1433 GARY_INIT(i->placements, num_requests);
1434 GARY_INIT(i->map, 0);
1435 i->penalty = 0; // FIXME
1438 struct placement **get_overlapping(struct placement *p UNUSED)
1440 struct placement **buffer;
1441 GARY_INIT(buffer, 0);
1445 void filter(struct placement **list UNUSED, bool *pred UNUSED)
1450 int flip(int a, int b)
1452 return (random() % 2 ? a : b);
1455 double randdouble(void)
1457 // FIXME: How the hell shall double in range <0, 1> be generated? O:)
1464 GARY_FREE(requests_point);
1465 GARY_FREE(requests_line);
1466 GARY_FREE(requests_area);
1469 void copy_individual(struct individual *src, struct individual *dest)
1471 src->penalty = dest->penalty;
1472 GARY_INIT(dest->placements, GARY_SIZE(src->placements));
1473 for (uns i=0; i<GARY_SIZE(src->placements); i++)
1475 dest->placements[i] = src->placements[i];