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;
54 int conf_pop_size = 50;
56 int conf_penalty_bound = 0;
57 int conf_stagnation_bound = 0;
58 int conf_iteration_limit = 4;
60 int conf_term_cond = TERM_COND_ITERATIONS;
62 int conf_breed_rbest_perc = 80;
63 int conf_breed_pop_size_perc = 20;
64 int conf_breed_perc = 50; // Percentage of new pop created by breeding
66 bool conf_mutate_children = 1;
67 int conf_mutate_children_prob = 0.3;
69 int conf_mutate_rbest_perc = 60;
70 int conf_mutate_pop_size_perc = 20;
72 int conf_mutate_move_bound = 0.2;
73 int conf_mutate_regen_bound = 0.1;
74 int conf_mutate_chvar_bound = 0.1;
76 int conf_elite_perc = 5;
78 double conf_max_section_length = 100;
79 double conf_max_section_overlay = 10;
81 int old_best = 0; // FIXME: Shall be int max
85 int conf_part_size = 50;
92 void make_graph(void);
93 void label_graph(void);
94 void join_edge(struct graph_edge *e, int dir);
95 void bfs(uns longline);
96 void make_segments(void);
98 void make_population(void);
99 bool shall_terminate(void);
103 void rank_population(void);
105 void make_bitmap(struct point_variant *v, struct symbol *sym);
106 void make_bitmap_icon(struct point_variant *v, struct sym_icon *si);
107 void make_bitmap_point(struct point_variant *v, struct sym_point *sp);
108 void make_bitmap_label(struct point_variant *v, struct sym_text *text);
110 void cut_edge(struct graph_edge *e, double dist);
111 struct request_line *make_new_line(void);
112 struct request_section *make_new_section(struct request_line *rl);
113 struct request_segment *make_new_segment(struct request_section *rls, struct symbol *sym);
115 void dump_bitmaps(struct individual *individual);
116 void dump_graph(void);
118 void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir);
119 void bfs_wrapper(void);
121 void dump_longlines(void);
122 void dump_linelabel_requests(void);
123 void dump_individual(struct individual *individual);
124 void print_label(struct symbol *sym);
126 double gen_movement(void);
127 void gen_coords(struct placement *p);
128 void gen_coords_point(struct placement *p);
129 void gen_coords_segment(struct placement *p);
130 void gen_coords_area(struct placement *p);
132 void make_segments_old(void);
134 void labeller_cleanup(void);
136 struct individual **perform_crossover(struct individual *parent1, struct individual *parent2);
137 void perform_mutation(struct individual *individual);
139 void init_placement(struct placement *p, struct request *r);
140 void init_individual(struct individual *i);
141 struct map_part **get_parts(struct placement *symbol, struct individual *individual);
143 int randint(int min, int max);
145 struct placement **get_closure(struct placement *placement, struct individual *parent1, struct individual *parent2);
146 void copy_symbols(struct placement **closure, struct individual *parent, struct individual *child);
147 void move_symbol(struct placement *p);
148 void move_symbol_point(struct placement *p);
150 struct placement **get_overlapping(struct placement *p);
151 void filter(struct placement **list, bool *pred);
153 int flip(int a, int b);
154 double randdouble(void);
158 void copy_individual(struct individual *src, struct individual *dest);
160 int max2(int a, int b);
161 int min2(int a, int b);
162 int max4(int a, int b, int c, int d);
163 int min4(int a, int b, int c, int d);
165 int max2(int a, int b)
167 return (a > b ? a : b);
170 int min2(int a, int b)
172 return (a < b ? a : b);
175 int max4(int a, int b, int c, int d)
177 return max2(max2(a, b), max2(c, d));
180 int min4(int a, int b, int c, int d)
182 return min2(min2(a, b), min2(c, d));
185 void print_label(struct symbol *sym)
189 case SYMBOLIZER_TEXT: ;
190 struct sym_text *st = (struct sym_text *) sym;
191 printf("%s\n", osm_val_decode(st->text));
198 void labeller_init(void)
200 GARY_INIT(requests_point, 0);
201 GARY_INIT(requests_line, 0);
202 GARY_INIT(requests_area, 0);
203 GARY_INIT(buffer_line, 0);
204 GARY_INIT(buffer_linelabel, 0);
205 ep_individuals = ep_new(sizeof(struct individual), 1);
207 page_width_int = floor(page_width);
208 page_height_int = floor(page_height);
211 void make_bitmap(struct point_variant *v, struct symbol *sym)
215 case SYMBOLIZER_POINT:
216 make_bitmap_point(v, (struct sym_point *) sym);
218 case SYMBOLIZER_ICON:
219 make_bitmap_icon(v, (struct sym_icon *) sym);
221 case SYMBOLIZER_TEXT:
222 make_bitmap_label(v, (struct sym_text *) sym);
225 ASSERT(sym->type != SYMBOLIZER_INVALID);
229 void make_bitmap_icon(struct point_variant *v, struct sym_icon *si)
231 v->width = si->sir.icon->width;
232 v->height = si->sir.icon->height;
233 v->bitmap = malloc((int) ceil(v->width * v->height * sizeof(bool)));
234 for (int i=0; i<v->width*v->height; i++) v->bitmap[i] = 1;
237 void make_bitmap_point(struct point_variant *v, struct sym_point *sp)
239 v->width = v->height = sp->size;
240 v->bitmap = malloc(sp->size*sp->size * sizeof(bool));
241 // FIXME: Okay, memset would be much nicer here
242 for (int i=0; i<sp->size*sp->size; i++) v->bitmap[i] = 1;
245 void make_bitmap_label(struct point_variant *v, struct sym_text *text)
256 v->width = max4(x_ld, x_lu, x_rd, x_ru) - min4(x_ld, x_lu, x_rd, x_ru);
257 v->height = max4(y_ld, y_lu, y_rd, y_ru) - min4(y_ld, y_lu, y_rd, y_ru);
258 //v->bitmap = malloc((int) (ceil(v->width) * ceil(v->height) * sizeof(bool)));
260 v->width = ceil(text->tw);
261 v->height = ceil(text->th);
262 v->bitmap = malloc(v->width * v->height * sizeof(bool));
263 // printf("Allocated bitmap of %d bools for %d x %d label\n", v->width * v->height, v->width, v->height);
264 for (int i=0; i<v->height; i++)
265 for (int j=0; j<v->width; j++)
267 v->bitmap[i*v->width + j] = 1;
268 // printf("Writing at %d\n", i*v->width + j);
272 void labeller_add_point(struct symbol *sym, struct osm_object *object, z_index_t zindex)
274 printf("Adding point\n");
275 if (object->type != OSM_TYPE_NODE)
277 printf("Warning: Point label requested on non-point object\n");
281 struct request_point *r = GARY_PUSH(requests_point);
283 r->request.type = REQUEST_POINT;
284 r->request.ind = num_requests++;
293 GARY_INIT(r->variants, 0);
295 struct point_variant *v = GARY_PUSH(r->variants);
297 struct osm_node *n = (struct osm_node *) object; // FIXME: Compiler warning
302 case SYMBOLIZER_ICON:
303 make_bitmap_icon(v, (struct sym_icon *) sym);
304 r->x = ((struct sym_icon *)sym)->sir.x;
305 r->y = ((struct sym_icon *)sym)->sir.y;
307 case SYMBOLIZER_POINT:
308 make_bitmap_point(v, (struct sym_point *) sym);
310 case SYMBOLIZER_TEXT: ;
311 struct sym_text *st = (struct sym_text *) sym;
312 struct osm_node *n = (struct osm_node *) object;
313 make_bitmap_label(v, st);
319 // printf("Inited point to [%.2f; %.2f] on %u\n", r->x, r->y, r->zindex);
322 void labeller_add_line(struct symbol *sym, z_index_t zindex)
324 printf("Adding line on %u\n", zindex);
325 struct buffer_line *b = GARY_PUSH(buffer_line);
326 b->line = (struct sym_line *) sym;
328 sym_plan(sym, zindex);
331 void labeller_add_linelabel(struct symbol *sym, struct osm_object *o, z_index_t zindex)
333 if (o->type != OSM_TYPE_WAY)
339 printf("[LAB] Labelling way %ju on %u\n", o->id, zindex);
340 struct buffer_linelabel *ll = GARY_PUSH(buffer_linelabel);
341 ll->way = (struct osm_way *) o;
346 void labeller_add_arealabel(struct symbol *sym, struct osm_object *o, z_index_t zindex)
348 printf("Adding area on %u\n", zindex);
349 struct request_area *r = GARY_PUSH(requests_area);
351 r->request.type = REQUEST_AREA;
352 r->request.ind = num_requests++;
354 r->o = (struct osm_multipolygon *) o;
358 osm_obj_center(o, &(r->cx), &(r->cy));
360 GARY_INIT(r->variants, 0);
361 struct point_variant *v = GARY_PUSH(r->variants);
364 case SYMBOLIZER_ICON:
365 printf("DEBUG: Icon label\n");
366 make_bitmap_icon(v, (struct sym_icon *) sym);
368 case SYMBOLIZER_TEXT:
369 printf("DEBUG: Text label\n");
370 make_bitmap_label(v, (struct sym_text *) sym);
377 void make_graph(void)
380 struct mempool *mp_edges = mp_new(BLOCK_SIZE);
382 printf("Extracting nodes, will iterate over %lld ways\n", GARY_SIZE(buffer_line));
383 for (uns i=0; i<GARY_SIZE(buffer_line); i++)
385 struct osm_way *way = (struct osm_way *) buffer_line[i].line->s.o;
386 struct graph_node *g_prev = NULL;
387 struct osm_node *o_prev = NULL;
389 CLIST_FOR_EACH(struct osm_ref *, ref, way->nodes)
391 // FIXME: Shall osm_object's type be checked here?
392 struct osm_node *o_node = (struct osm_node *) ref->o;
394 struct graph_node *g_node = hash_find(ref->o->id);
397 g_node = hash_new(ref->o->id);
398 GARY_INIT(g_node->edges, 0);
400 g_node->id = ref->o->id;
401 g_node->num = num_nodes++;
411 struct graph_edge *e = mp_alloc(mp_edges, sizeof(struct graph_edge)); num_edges_dbg++;
412 e->num = num_edges++;
413 e->id = buffer_line[i].line->s.o->id;
414 e->color = buffer_line[i].line->color;
415 e->length = hypot(abs(o_prev->x - o_node->x), abs(o_prev->y - o_node->y));
421 e->longline = (uns) -1;
422 e->line = buffer_line[i].line;
426 struct graph_edge **edge = GARY_PUSH(g_prev->edges);
428 edge = GARY_PUSH(g_node->edges);
436 printf("Made graph with %d edges\n", num_edges_dbg);
439 void dump_graph(void)
441 HASH_FOR_ALL(hash, node)
443 printf("* Node: (%d) #%ju [%.2f; %.2f]\n", node->num, node->id, node->o->x, node->o->y);
444 for (uns i=0; i<GARY_SIZE(node->edges); i++)
446 struct graph_edge *e = node->edges[i];
447 printf("\t edge (%d) #%ju to ", e->num, e->id);
448 if (node->edges[i]->n1->id == node->id)
449 printf("(%d) #%ju [%.2f; %.2f]\n", e->n2->num, e->n2->id, e->n2->o->x, e->n2->o->y);
450 else if (node->edges[i]->n2->id == node->id)
451 printf("(%d) #%ju [%.2f; %.2f]\n", e->n1->num, e->n1->id, e->n1->o->x, e->n1->o->y);
453 printf("BEWARE! BEWARE! BEWARE!\n");
456 if ((node->edges[i]->label)) printf("Labelled\n");
457 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));
458 printf(" colored %d;", node->edges[i]->color);
459 printf(" length %.2f", node->edges[i]->length);
466 void label_graph(void)
468 printf("There are %u line labels requested\n", GARY_SIZE(buffer_linelabel));
469 for (uns i=0; i<GARY_SIZE(buffer_linelabel); i++)
471 if (buffer_linelabel[i].label->type == SYMBOLIZER_TEXT)
472 printf("Labelling nodes of way %s\n", osm_val_decode(((struct sym_text *) buffer_linelabel[i].label)->text));
473 CLIST_FOR_EACH(struct osm_ref *, ref, buffer_linelabel[i].way->nodes)
475 printf("Looking for node %ju\n", ref->o->id);
476 struct graph_node *n = hash_find(ref->o->id);
479 // FIXME: What shall be done?
483 printf("Searching among %u edges\n", GARY_SIZE(n->edges));
484 for (uns j=0; j<GARY_SIZE(n->edges); j++)
486 if (n->edges[j]->id == buffer_linelabel[i].way->o.id)
488 printf("Labelling node %ju\n", n->id);
489 n->edges[j]->label = buffer_linelabel[i].label;
490 n->edges[j]->zindex = buffer_linelabel[i].zindex;
498 void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir)
500 printf("BFS edge called for edge %d (going %d) in direction %d\n", e->num, e->dir, dir);
501 struct graph_edge *candidate = NULL;
503 for (uns i=0; i<GARY_SIZE(node->edges); i++)
505 struct graph_edge *other = node->edges[i];
506 if (e->num == 987) printf("Got label %d\n", e->num);
507 if ((other->longline != (uns) -1) && (other->longline != e->longline)) continue;
508 if (e->num == 987) printf("Continuing with edge %d\n", e->num);
510 printf("Testing %d ?= %d\n", other->visited, e->longline);
511 if ((uns) other->visited != e->longline) {
512 printf("Pushing new edge %d / %ju\n", other->num, other->id);
513 struct graph_edge **e_ptr = GARY_PUSH(bfs_queue);
515 other->visited = e->longline;
518 if (((other->n1->id == node->id) && (other->n2->id == anode->id)) ||
519 ((other->n2->id == node->id) && (other->n1->id == anode->id)))
522 if (((other->n1->id == node->id) || (other->n2->id == node->id)) &&
523 (e->label) && (other->label) &&
524 (e->label->type == SYMBOLIZER_TEXT) && (other->label->type == SYMBOLIZER_TEXT) &&
525 (((struct sym_text *) e->label)->text == ((struct sym_text *) other->label)->text))
527 if (! candidate || (other->length > candidate->length))
534 printf("New line in longline %u\n", e->longline);
535 struct graph_edge *other = candidate;
536 other->longline = e->longline;
538 if (((dir == DIR_BWD) && (other->n1->id == node->id)) ||
539 ((dir == DIR_FWD) && (other->n2->id == node->id)))
541 struct graph_node *swp = other->n2;
542 other->n2 = other->n1;
551 longlines[other->longline].first = other;
564 void bfs(uns longline)
566 printf("BFS called for longline %u\n", longline);
567 printf("%d longlines are believed to exist, %d exist\n", num_longlines, GARY_SIZE(longlines));
568 for (uns i=0; i<GARY_SIZE(bfs_queue); i++)
570 struct graph_edge *cur = bfs_queue[i];
571 printf("Exploring new edge %d; %d remaining\n", cur->num, GARY_SIZE(bfs_queue));
572 //ASSERT(! cur->visited);
574 cur->visited = longline;
576 if (cur->longline == (uns) -1)
579 if (cur->dir == DIR_UNSET)
581 cur->dir = DIR_CENTER;
582 bfs_edge(cur, cur->n1, cur->n2, DIR_BWD);
583 bfs_edge(cur, cur->n2, cur->n1, DIR_FWD);
590 bfs_edge(cur, cur->n1, cur->n2, cur->dir);
593 bfs_edge(cur, cur->n2, cur->n1, cur->dir);
603 void bfs_wrapper(void)
605 GARY_INIT(bfs_queue, 0);
606 GARY_INIT(longlines, 0);
608 HASH_FOR_ALL(hash, node)
610 for (uns i=0; i<GARY_SIZE(node->edges); i++)
612 if ((node->edges[i]->label) && (node->edges[i]->longline == (uns) -1))
614 GARY_PUSH(longlines);
615 longlines[num_longlines].first = node->edges[i];
616 printf("Running new BFS\n");
617 printf("Creating longline %u\n", num_longlines);
618 GARY_RESIZE(bfs_queue, 0);
619 struct graph_edge **e = GARY_PUSH(bfs_queue);
621 node->edges[i]->longline = num_longlines;
622 bfs(node->edges[i]->longline);
624 printf("Joined %d edges\n", dbg_num_hits); dbg_num_hits = 0;
625 printf("Planned %u edges\n", GARY_SIZE(bfs_queue));
632 GARY_FREE(bfs_queue);
635 void dump_longlines(void)
637 printf("*** Longlines dump\n");
638 for (uns i=0; i<GARY_SIZE(longlines); i++)
640 printf("Longline %u:", i);
641 struct graph_edge *e = longlines[i].first;
642 if ((e->label) && (e->label->type == SYMBOLIZER_TEXT))
643 printf(" labelled %s", osm_val_decode(((struct sym_text *) e->label)->text));
648 printf("\t#%ju (%d): [%.2f; %.2f] -- [%.2f; %.2f] (dir %d)\n",
649 e->id, e->num, e->n1->o->x, e->n1->o->y, e->n2->o->x, e->n2->o->y, e->dir);
656 struct request_line *make_new_line(void)
658 struct request_line *rl = GARY_PUSH(requests_line);
659 rl->request.ind = num_requests++;
660 rl->request.type = REQUEST_LINE;
661 GARY_INIT(rl->sections, 0);
666 struct request_section *make_new_section(struct request_line *rl)
668 struct request_section *rls = GARY_PUSH(rl->sections);
669 rls->request.ind = num_requests++;
670 rls->request.type = REQUEST_SECTION;
671 rls->num_segments = 0;
672 GARY_INIT(rls->segments, 0);
677 struct request_segment *make_new_segment(struct request_section *rls, struct symbol *sym)
679 struct request_segment *rs = GARY_PUSH(rls->segments);
682 rs->request.ind = num_requests++;
683 rs->request.type = REQUEST_SEGMENT;
685 struct point_variant *v = malloc(sizeof(struct point_variant));
692 void cut_edge(struct graph_edge *e, double dist)
695 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);
697 struct graph_edge *new = malloc(sizeof(struct graph_edge));
701 struct osm_node *n1 = e->n1->o;
702 struct osm_node *n2 = e->n2->o;
705 if ((n1->x == n2->x) && (n1->y == n2->y))
707 printf("[%.2f; %.2f] -- [%.2f; %.2f]\n", n1->x, n1->y, n2->x, n2->y);
708 printf("Won't cut point\n");
712 struct osm_node *n11 = malloc(sizeof(struct osm_node));
713 struct graph_node *gn = malloc(sizeof(struct graph_node));
715 double vsize = sqrt(pow(n1->x - n2->x, 2) + pow(n1->y - n2->y, 2));
716 n11->x = n1->x + (n2->x - n1->x) / vsize * dist;
717 n11->y = n1->y + (n2->y - n1->y) / vsize * dist;
719 e->n2 = new->n1 = gn;
721 e->length = hypot(abs(n1->x - n11->x), abs(n1->y - n11->y));
722 new->length = hypot(abs(n11->x - n2->x), abs(n11->y - n2->y));
725 void make_segments(void)
727 for (uns i=0; i<GARY_SIZE(longlines); i++)
729 // Skip lines which are not labelled
730 if (! (longlines[i].first && longlines[i].first->label))
733 struct request_line *request = make_new_line();
734 struct request_section *rls = make_new_section(request);
735 struct request_segment *rs = NULL;
737 struct graph_edge *e = longlines[i].first;
738 double cur_length = 0;
740 struct sym_text *st = NULL;
741 if (e->label->type == SYMBOLIZER_TEXT)
743 st = (struct sym_text *) e->label;
747 printf("Warning: Skipping line\n");
752 printf("New longline\n");
755 if (cur_length + e->length > conf_max_section_length + conf_max_section_overlay)
758 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);
759 cut_edge(e, conf_max_section_length - cur_length);
762 if (cur_length + e->length > conf_max_section_length)
765 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);
767 struct osm_node *n1 = e->n1->o;
768 struct osm_node *n2 = e->n2->o;
769 rs = make_new_segment(rls, e->label);
774 rs->zindex = e->zindex;
776 rs->label = malloc(sizeof(struct sym_text));
777 *((struct sym_text *) rs->label) = *((struct sym_text *) e->label);
778 rls = make_new_section(request);
782 if (st && (e->length < st->tw))
785 printf("Warning: Skipping segment\n");
789 rs = make_new_segment(rls, e->label);
790 rs->label = malloc(sizeof(struct sym_text));
791 *((struct sym_text *) rs->label) = *((struct sym_text *) e->label);
793 rs->x1 = e->n1->o->x;
794 rs->y1 = e->n1->o->y;
795 rs->x2 = e->n2->o->x;
796 rs->y2 = e->n2->o->y;
798 rs->angle = atan2(rs->x2 - rs->x1, rs->y2 - rs->y1);
799 rs->zindex = e->zindex;
801 cur_length += e->length;
805 if (request->sections[0].num_segments == 0)
808 printf("WARNING: 0 segment section\n");
809 GARY_POP(requests_line);
815 void dump_linelabel_requests(void)
817 for (uns i=0; i<GARY_SIZE(requests_line); i++)
819 if (requests_line[i].sections[0].num_segments == 0)
824 printf("Request for linelabel, %d sections\n", GARY_SIZE(requests_line[i].sections));
825 print_label(requests_line[i].sections[0].segments[0].label);
826 for (uns j=0; j<GARY_SIZE(requests_line[i].sections); j++)
828 printf("%d section, %d segments\n", j, GARY_SIZE(requests_line[i].sections[j].segments));
829 for (uns k=0; k<GARY_SIZE(requests_line[i].sections[j].segments); k++)
831 struct request_segment *rs = &requests_line[i].sections[j].segments[k];
832 printf("[%.2f; %.2f] -- [%.2f; %.2f]\n", rs->x1, rs->y1, rs->x2, rs->y2);
839 void dump_bitmaps(struct individual *individual)
841 bool *bitmap = malloc(page_width_int * page_height_int * sizeof(bool));
842 printf("Bitmap size is %d\n", page_width_int * page_height_int);
843 for (int i=0; i<page_height_int; i++)
844 for (int j=0; j<page_width_int; j++)
845 bitmap[i*page_width_int + j] = 0;
847 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
849 fprintf(stderr, "%d-th placement\n", i);
850 struct placement *p = &(individual->placements[i]);
851 struct point_variant *v = NULL;
853 switch (p->request->type)
855 case REQUEST_SEGMENT: ;
856 struct request_segment *rs = (struct request_segment *) p->request;
859 case REQUEST_POINT: ;
860 struct request_point *rp = (struct request_point *) p->request;
861 v = &(rp->variants[p->variant_used]);
864 struct request_area *ra = (struct request_area *) p->request;
865 printf("Using %d-th of %d variants\n", p->variant_used, GARY_SIZE(ra->variants));
866 v = &(ra->variants[p->variant_used]);
869 printf("Testing request type (dump_bitmaps): %d\n", p->request->type);
870 ASSERT(p->request->type != REQUEST_INVALID);
874 printf("Got after with %d-th placement of request type %d\n", i, p->request->type);
876 printf("Rendering %d-th label %d x %d (w x h)\n", i, v->width, v->height);
877 for (int row = max2(p->y, 0); row < min2(p->y + v->height, page_height_int); row++)
879 for (int col = max2(p->x, 0); col < min2(p->x + v->width, page_width_int); col++)
881 printf("Writing to %d\n", row*page_width_int + col);
882 bitmap[row * page_width_int + col] = 1;
888 FILE *fd_dump = fopen("dump.pbm", "w");
889 fprintf(fd_dump, "P1\n");
890 fprintf(fd_dump, "%d %d\n", page_width_int, page_height_int);
891 for (int i=0; i<page_height_int; i++)
893 for (int j=0; j<page_width_int; j++)
895 fprintf(fd_dump, "%d", bitmap[(int) (i*page_width_int + j)] ? 1 : 0);
897 fprintf(fd_dump, "\n");
902 void dump_individual(struct individual *individual)
904 printf("*** Dumping INDIVIDUAL ***\n");
905 printf("(There are %d requests)\n", num_requests);
906 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
908 struct placement *p = &(individual->placements[i]);
910 switch (p->request->type)
913 printf("Point at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_point *) p->request)->zindex);
916 struct request_line *rl = (struct request_line *) p->request;
918 print_label(rl->sections[0].segments[0].label);
920 case REQUEST_SECTION: ;
923 case REQUEST_SEGMENT: ;
924 if (p->variant_used >= 0)
925 printf("Segment placed at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_segment *) p->request)->zindex);
927 printf("Segment not placed\n");
930 struct request_area *ra = (struct request_area *) p->request;
931 printf("Area label ");
932 print_label(ra->label);
933 printf(" at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_area *) p->request)->zindex);
936 printf("Testing request type (dump_individual)\n");
937 ASSERT(p->request->type != 0);
940 printf("\nTotal penalty: %d\n", individual->penalty);
943 void labeller_label(void)
951 dump_linelabel_requests();
953 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));
955 GARY_INIT(population1, conf_pop_size);
956 GARY_INIT(population2, conf_pop_size);
959 printf("Dealing with %d requests\n", num_requests);
962 while (! shall_terminate())
966 struct individual **swp = population1;
967 population1 = population2;
973 dump_individual(population1[0]);
974 //dump_bitmaps(population1[0]);
976 for (uns i=0; i<GARY_SIZE(population1[0]->placements); i++)
978 //printf("(%d) Coping with %d\n", i, population1[0]->placements[i].request->type);
980 struct symbol *s = NULL;
981 z_index_t zindex = 0;
982 switch (population1[0]->placements[i].request->type)
984 case REQUEST_POINT: ;
985 struct request_point *rp = (struct request_point *) population1[0]->placements[i].request;
988 // printf("%u\n", zindex);
990 case REQUEST_SEGMENT: ;
991 struct request_segment *rs = (struct request_segment *) population1[0]->placements[i].request;
993 // printf("Assigned label to s\n");
996 // printf("%u\n", zindex);
999 // printf("*** Line detected ***\n");
1001 case REQUEST_AREA: ;
1002 struct request_area *ra = (struct request_area *) population1[0]->placements[i].request;
1004 zindex = ra->zindex;
1005 // printf("%u\n", zindex);
1008 // printf("Testing request type (flushing final placements)\n");
1009 ASSERT(population1[0]->placements[i].request != REQUEST_INVALID);
1010 // printf("Yep, in default, continuing\n");
1014 printf("Will plan symbol at [%.2f; %.2f] on %u\n", population1[0]->placements[i].x, population1[0]->placements[i].y, zindex);
1016 if (s) switch (s->type)
1018 case SYMBOLIZER_POINT: ;
1019 struct sym_point *sp = (struct sym_point *) s;
1020 sp->x = population1[0]->placements[i].x;
1021 sp->y = population1[0]->placements[i].y;
1022 sym_plan((struct symbol *) sp, zindex);
1024 case SYMBOLIZER_ICON: ;
1025 struct sym_icon *si = (struct sym_icon *) s;
1026 si->sir.x = population1[0]->placements[i].x;
1027 si->sir.y = population1[0]->placements[i].y;
1028 sym_plan((struct symbol *) si, zindex);
1030 case SYMBOLIZER_TEXT: ;
1031 struct sym_text *st = (struct sym_text *) s;
1032 st->x = population1[0]->placements[i].x;
1033 st->y = population1[0]->placements[i].y;
1034 st->next_duplicate = NULL;
1035 printf("Planning text %s at [%.2f; %.2f] on %u\n", osm_val_decode(st->text), st->x, st->y, zindex);
1036 sym_plan((struct symbol *) st, zindex);
1039 // printf("Testing symbolizer type\n");
1040 ASSERT(s->type != SYMBOLIZER_INVALID);
1049 void labeller_cleanup(void)
1053 void make_population(void)
1055 for (int i=0; i<conf_pop_size; i++)
1057 printf("Making individual %d\n", i);
1058 struct individual *individual = ep_alloc(ep_individuals); init_individual(individual);
1059 population1[i] = individual;
1062 for (uns j=0; j<GARY_SIZE(requests_point); j++)
1064 init_placement(&(individual->placements[p++]), (struct request *) &requests_point[j]);
1067 for (uns j=0; j<GARY_SIZE(requests_line); j++)
1069 init_placement(&(individual->placements[p++]), (struct request *) &requests_line[j]);
1071 for (uns k=0; k<GARY_SIZE(requests_line[j].sections); k++)
1073 init_placement(&(individual->placements[p++]), (struct request *) &requests_line[j].sections[k]);
1075 for (uns l=0; l<GARY_SIZE(requests_line[j].sections[k].segments); l++)
1077 init_placement(&(individual->placements[p++]), (struct request *) &requests_line[j].sections[k].segments[l]);
1082 for (uns j=0; j<GARY_SIZE(requests_area); j++)
1084 init_placement(&(individual->placements[p++]), (struct request *) &requests_area[j]);
1087 if (p != num_requests)
1089 printf("Say bye\n");
1093 printf("Testing p\n");
1094 ASSERT(p == num_requests);
1098 bool shall_terminate(void)
1100 switch (conf_term_cond)
1102 case TERM_COND_PENALTY:
1103 return (population1[0]->penalty < conf_penalty_bound);
1104 case TERM_COND_STAGNATION:
1105 return (abs(old_best - population1[0]->penalty) < conf_stagnation_bound);
1106 case TERM_COND_ITERATIONS:
1107 return (iteration >= conf_iteration_limit);
1109 // FIXME: Warn the user that no condition is set
1118 printf("%.2f\n", ((double) conf_breed_pop_size_perc/100));
1119 int conf_breed_pop_size = ((double) conf_breed_pop_size_perc/100) * conf_pop_size;
1120 struct individual **breed_buffer;
1121 while (i < conf_breed_pop_size)
1123 printf("%d < %d, breeding\n", i, conf_breed_pop_size);
1124 int parent1 = randint(1, conf_breed_pop_size);
1125 int parent2 = randint(1, conf_breed_pop_size);
1126 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);
1127 breed_buffer = perform_crossover(population1[parent1], population1[parent2]);
1128 population2[pop2_ind++] = breed_buffer[0];
1129 population2[pop2_ind++] = breed_buffer[1];
1134 acc += conf_breed_rbest_perc;
1136 return; // FIXME: DEBUG HACK
1138 int remaining = (1 - acc) * (conf_pop_size * conf_breed_perc);
1139 int step = remaining / conf_pop_size;
1140 for (; i<conf_pop_size; i += 2)
1142 printf("Asking for %d and %d of %d\n", i*step, i*(step+1), conf_pop_size);
1143 breed_buffer = perform_crossover(population1[i*step], population1[i*step+1]);
1144 population2[pop2_ind++] = breed_buffer[0];
1145 population2[pop2_ind++] = breed_buffer[1];
1148 // FIXME: Could there be one missing individual?
1151 struct individual **perform_crossover(struct individual *parent1, struct individual *parent2)
1153 struct individual **buffer = malloc(2*sizeof(struct individual));
1154 struct individual *child1 = ep_alloc(ep_individuals); init_individual(child1);
1155 struct individual *child2 = ep_alloc(ep_individuals); init_individual(child2);
1157 printf("Performing crossover\n");
1159 for (uns i=0; i<GARY_SIZE(parent1->placements); i++)
1161 printf("%dth placement out of %d\n", i, num_requests);
1162 if (! parent1->placements[i].processed)
1164 struct placement **clos_symbols = get_closure(&(parent1->placements[i]), parent1, parent2);
1165 int x = randint(1, 2);
1169 copy_symbols(clos_symbols, parent1, child1);
1170 copy_symbols(clos_symbols, parent2, child2);
1174 copy_symbols(clos_symbols, parent2, child1);
1175 copy_symbols(clos_symbols, parent1, child2);
1177 printf("Symbols copied; %lld\n", GARY_SIZE(clos_symbols));
1178 GARY_FREE(clos_symbols);
1181 if (conf_mutate_children)
1183 if (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child1);
1184 if (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child2);
1196 int conf_mutate_pop_size = conf_mutate_pop_size_perc * conf_pop_size;
1197 while (i < conf_mutate_rbest_perc * conf_pop_size)
1199 int ind = randint(1, conf_mutate_pop_size);
1200 copy_individual(population2[pop2_ind], population1[ind]);
1201 perform_mutation(population2[pop2_ind]);
1206 void perform_mutation(struct individual *individual)
1208 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
1210 int x = randint(1, 1000);
1213 if (x <= acc + conf_mutate_move_bound)
1215 move_symbol(&(individual->placements[i]));
1218 acc += conf_mutate_move_bound;
1220 if (x <= acc + conf_mutate_regen_bound)
1222 gen_coords(&(individual->placements[i]));
1225 acc += conf_mutate_regen_bound;
1227 if (x <= acc + conf_mutate_chvar_bound)
1229 if (0) // if num_variants > 1
1231 // FIXME: assign new variant
1239 for (int i=0; i<conf_elite_perc * conf_pop_size; i++)
1241 population2[pop2_ind++] = population1[0];
1245 void rank_population(void)
1250 void gen_coords(struct placement *p)
1252 switch(p->request->type)
1255 gen_coords_point(p);
1260 case REQUEST_SEGMENT:
1261 gen_coords_segment(p);
1264 printf("Not yet implemented\n");
1267 printf("Testing request type\n");
1268 ASSERT(p->request->type != REQUEST_INVALID);
1272 double gen_movement(void)
1274 double m = (random() % 1000000) / 10000;
1275 m = pow(m, 1.0/3) * flip(1, -1);
1276 printf("Movement %.2f\n", m);
1280 void gen_coords_point(struct placement *p)
1282 p->x = p->x + gen_movement();
1285 void gen_coords_segment(struct placement *p)
1287 struct request_segment *rs = (struct request_segment *) p->request;
1289 p->x = (a == 1 ? rs->x1 : rs->x2);
1290 p->y = (a == 1 ? rs->y1 : rs->y2);
1293 void gen_coords_area(struct placement *p)
1295 struct request_area *ra = (struct request_area *) p->request;
1297 p->x = p->x + gen_movement();
1298 p->y = p->y + gen_movement();
1300 printf("Moved label to [%.2f; %.2f] from [%.2f; %.2f]\n", p->x, p->y, ra->cx, ra->cy);
1303 struct map_part **get_parts(struct placement *symbol, struct individual *individual)
1305 struct map_part **buffer;
1306 GARY_INIT(buffer, 0);
1307 int x_min = symbol->x / conf_part_size;
1308 int x_max = (symbol->x /*+ symbol->bitmap->width*/ + conf_part_size - 1) / conf_part_size;
1309 int y_min = symbol->y / conf_part_size;
1310 int y_max = (symbol->y /*+ symbol->bitmap->height*/ + conf_part_size - 1) / conf_part_size;
1312 for (int x=x_min; x < x_max; x++)
1313 for (int y=y_min; y < y_max; y++)
1315 struct map_part *m = GARY_PUSH(buffer);
1316 *m = individual->map[x][y];
1322 int randint(int min, int max)
1324 if (min == max) return min;
1326 //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)));
1327 return min + (r % (max - min));
1328 return (r * (max - min));
1331 struct placement **get_closure(struct placement *placement, struct individual *parent1, struct individual *parent2 UNUSED)
1333 printf("Getting closure\n");
1334 struct placement **closure;
1335 GARY_INIT(closure, 0);
1336 bool *chosen = malloc(GARY_SIZE(parent1->placements) * sizeof(bool));
1337 chosen[placement->request->ind] = 1;
1339 struct placement **p = GARY_PUSH(closure); *p = placement;
1342 while (first < GARY_SIZE(closure))
1344 printf("Iterating, first is %d\n", first);
1345 struct placement **overlapping = get_overlapping(placement);
1346 filter(overlapping, chosen);
1347 for (uns j=0; j<GARY_SIZE(overlapping); j++)
1349 p = GARY_PUSH(closure); *p = overlapping[j];
1350 chosen[overlapping[j]->request->ind] = 1;
1352 GARY_FREE(overlapping);
1359 void copy_symbols(struct placement **closure, struct individual *parent, struct individual *child)
1361 //printf("%d\n", child->penalty);
1362 //printf("Closure size: %lld\n", GARY_SIZE(closure));
1363 for (uns i=0; i<GARY_SIZE(closure); i++)
1365 int ind = closure[i]->request->ind;
1366 child->placements[ind] = parent->placements[ind];
1367 child->placements[ind].processed = 0;
1371 void move_symbol(struct placement *p)
1373 switch (p->request->type)
1376 move_symbol_point(p);
1378 case REQUEST_SEGMENT:
1380 printf("Not yet implemented\n");
1382 ASSERT(p->request->type != REQUEST_INVALID);
1386 void move_symbol_point(struct placement *p)
1388 p->x += (double) (move_min + randdouble()) * flip(1, -1);
1389 p->y += (double) (move_min + randdouble()) * flip(1, -1);
1392 void init_placement(struct placement *p, struct request *r)
1397 p->x = p->y = 0; // To prevent valgrind from complaining
1398 p->variant_used = 0;
1401 case REQUEST_POINT: ;
1402 struct request_point *rp = (struct request_point *) r;
1406 case REQUEST_LINE: ;
1408 case REQUEST_SECTION: ;
1409 struct request_section *rls = (struct request_section *) r;
1410 p->variant_used = randint(0, rls->num_segments);
1412 case REQUEST_SEGMENT: ;
1413 struct request_segment *rs = (struct request_segment *) r;
1417 case REQUEST_AREA: ;
1418 struct request_area *ra = (struct request_area *) r;
1421 p->variant_used = 0;
1424 ASSERT(p->request->type != REQUEST_INVALID);
1425 printf("Valid request: %d\n", p->request->type);
1429 // printf("Inited placement to [%.2f; %.2f]\n", p->x, p->y);
1432 void init_individual(struct individual *i)
1434 //printf("Initing individual\n");
1435 GARY_INIT(i->placements, num_requests);
1436 GARY_INIT(i->map, 0);
1437 i->penalty = 0; // FIXME
1440 struct placement **get_overlapping(struct placement *p UNUSED)
1442 struct placement **buffer;
1443 GARY_INIT(buffer, 0);
1447 void filter(struct placement **list UNUSED, bool *pred UNUSED)
1452 int flip(int a, int b)
1454 return (random() % 2 ? a : b);
1457 double randdouble(void)
1459 // FIXME: How the hell shall double in range <0, 1> be generated? O:)
1466 GARY_FREE(requests_point);
1467 GARY_FREE(requests_line);
1468 GARY_FREE(requests_area);
1471 void copy_individual(struct individual *src, struct individual *dest)
1473 src->penalty = dest->penalty;
1474 GARY_INIT(dest->placements, GARY_SIZE(src->placements));
1475 for (uns i=0; i<GARY_SIZE(src->placements); i++)
1477 dest->placements[i] = src->placements[i];