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;
49 int dbg_map_parts = 0;
61 int conf_pop_size = 50;
63 int conf_penalty_bound = 0;
64 int conf_stagnation_bound = 0;
65 int conf_iteration_limit = 4;
67 int conf_term_cond = TERM_COND_ITERATIONS;
69 int conf_breed_rbest_perc = 80;
70 int conf_breed_pop_size_perc = 20;
71 int conf_breed_perc = 50; // Percentage of new pop created by breeding
73 bool conf_mutate_children = 1;
74 int conf_mutate_children_prob = 0.3;
76 int conf_mutate_rbest_perc = 60;
77 int conf_mutate_pop_size_perc = 20;
79 int conf_mutate_move_bound = 0.2;
80 int conf_mutate_regen_bound = 0.1;
81 int conf_mutate_chvar_bound = 0.1;
83 int conf_elite_perc = 5;
85 double conf_max_section_length = 100;
86 double conf_max_section_overlay = 10;
88 int old_best = 0; // FIXME: Shall be int max
92 int conf_part_size = 50;
99 int conf_map_part_width = 5;
100 int conf_map_part_height = 5;
101 int num_map_parts_row;
102 int num_map_parts_col;
105 void make_graph(void);
106 void label_graph(void);
107 void join_edge(struct graph_edge *e, int dir);
108 void bfs(uns longline);
109 void make_segments(void);
111 void make_population(void);
112 bool shall_terminate(void);
116 void rank_population(void);
117 void plan_individual(struct individual *individual);
119 void make_bitmap(struct variant *v, struct symbol *sym);
120 void make_bitmap_icon(struct variant *v, struct sym_icon *si);
121 void make_bitmap_point(struct variant *v, struct sym_point *sp);
122 void make_bitmap_label(struct variant *v, struct sym_text *text);
124 void cut_edge(struct graph_edge *e, double dist);
125 struct request_line *make_new_line(void);
126 struct request_section *make_new_section(struct request_line *rl);
127 struct request_segment *make_new_segment(struct request_section *rls, struct symbol *sym);
129 void dump_bitmaps(struct individual *individual);
130 void dump_graph(void);
132 void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir);
133 void bfs_wrapper(void);
135 void dump_longlines(void);
136 void dump_linelabel_requests(void);
137 void dump_individual(struct individual *individual);
138 void print_label(struct symbol *sym);
140 double gen_movement(void);
141 void gen_coords(struct placement *p);
142 void gen_coords_point(struct placement *p);
143 void gen_coords_segment(struct placement *p);
144 void gen_coords_area(struct placement *p);
146 struct map_part **get_map_parts(struct placement *p);
147 void update_map_parts(struct placement *p);
149 void make_segments_old(void);
151 void labeller_cleanup(void);
153 struct individual **perform_crossover(struct individual *parent1, struct individual *parent2);
154 void perform_mutation(struct individual *individual);
156 void hide_segment_labels(struct individual *individual);
157 void init_placement(struct placement *p, struct individual *individual, struct request *r);
158 void init_individual(struct individual *i);
159 struct map_part **get_parts(struct placement *symbol, struct individual *individual);
161 int randint(int min, int max);
163 struct placement **get_closure(struct placement *placement, struct individual *parent1, struct individual *parent2);
164 void copy_symbols(struct placement **closure, struct individual *parent, struct individual *child);
165 void move_symbol(struct placement *p);
166 void move_symbol_point(struct placement *p);
168 struct placement **get_overlapping(struct placement *p);
169 void filter(struct placement **list, bool *pred);
171 int flip(int a, int b);
172 double randdouble(void);
176 void copy_individual(struct individual *src, struct individual *dest);
178 int max2(int a, int b);
179 int min2(int a, int b);
180 int max4(int a, int b, int c, int d);
181 int min4(int a, int b, int c, int d);
183 struct placement dummy_placement;
185 int max2(int a, int b)
187 return (a > b ? a : b);
190 int min2(int a, int b)
192 return (a < b ? a : b);
195 int max4(int a, int b, int c, int d)
197 return max2(max2(a, b), max2(c, d));
200 int min4(int a, int b, int c, int d)
202 return min2(min2(a, b), min2(c, d));
205 void print_label(struct symbol *sym)
209 case SYMBOLIZER_TEXT: ;
210 struct sym_text *st = (struct sym_text *) sym;
211 printf("%s\n", osm_val_decode(st->text));
218 void labeller_init(void)
220 GARY_INIT(requests_point, 0);
221 GARY_INIT(requests_line, 0);
222 GARY_INIT(requests_area, 0);
223 GARY_INIT(buffer_line, 0);
224 GARY_INIT(buffer_linelabel, 0);
225 ep_individuals = ep_new(sizeof(struct individual), 1);
227 page_width_int = floor(page_width);
228 page_height_int = floor(page_height);
230 num_map_parts_row = (page_width_int + conf_map_part_width) / conf_map_part_width;
231 num_map_parts_col = (page_height_int + conf_map_part_height) / conf_map_part_height;
232 num_map_parts = num_map_parts_row * num_map_parts_col;
235 void make_bitmap(struct variant *v, struct symbol *sym)
239 case SYMBOLIZER_POINT:
240 make_bitmap_point(v, (struct sym_point *) sym);
242 case SYMBOLIZER_ICON:
243 make_bitmap_icon(v, (struct sym_icon *) sym);
245 case SYMBOLIZER_TEXT:
246 make_bitmap_label(v, (struct sym_text *) sym);
249 ASSERT(sym->type != SYMBOLIZER_INVALID);
253 void make_bitmap_icon(struct variant *v, struct sym_icon *si)
255 v->width = si->sir.width + 1;
256 v->height = si->sir.height + 1;
257 v->bitmap = malloc(v->width * v->height * sizeof(bool));
258 for (int i=0; i<v->width*v->height; i++) v->bitmap[i] = 1;
261 void make_bitmap_point(struct variant *v, struct sym_point *sp)
263 v->width = v->height = sp->size + 1;
264 v->bitmap = malloc(v->width * v->height * sizeof(bool));
265 // FIXME: Okay, memset would be much nicer here
266 for (int i=0; i<sp->size*sp->size; i++) v->bitmap[i] = 1;
269 void make_bitmap_label(struct variant *v, struct sym_text *text)
271 v->width = ceil(text->tw);
272 v->height = ceil(text->th);
273 v->bitmap = malloc(v->width * v->height * sizeof(bool));
274 for (int i=0; i<v->height; i++)
275 for (int j=0; j<v->width; j++)
277 v->bitmap[i*v->width + j] = 1;
281 void labeller_add_point(struct symbol *sym, struct osm_object *object, z_index_t zindex)
284 printf("Adding point\n");
285 if (object->type != OSM_TYPE_NODE)
287 printf("Warning: Point label requested on non-point object\n");
291 struct request_point *r = GARY_PUSH(requests_point);
293 r->request.type = REQUEST_POINT;
294 r->request.ind = num_requests++;
303 GARY_INIT(r->request.variants, 0);
305 struct variant *v = GARY_PUSH(r->request.variants);
307 struct osm_node *n = (struct osm_node *) object; // FIXME: Compiler warning
312 case SYMBOLIZER_ICON:
313 make_bitmap_icon(v, (struct sym_icon *) sym);
314 r->x = ((struct sym_icon *)sym)->sir.x;
315 r->y = ((struct sym_icon *)sym)->sir.y;
317 case SYMBOLIZER_POINT:
318 make_bitmap_point(v, (struct sym_point *) sym);
320 case SYMBOLIZER_TEXT: ;
321 struct sym_text *st = (struct sym_text *) sym;
322 struct osm_node *n = (struct osm_node *) object;
323 make_bitmap_label(v, st);
329 // printf("Inited point to [%.2f; %.2f] on %u\n", r->x, r->y, r->zindex);
332 void labeller_add_line(struct symbol *sym, z_index_t zindex)
335 printf("Adding line on %u\n", zindex);
336 struct buffer_line *b = GARY_PUSH(buffer_line);
337 b->line = (struct sym_line *) sym;
339 sym_plan(sym, zindex);
342 void labeller_add_linelabel(struct symbol *sym, struct osm_object *o, z_index_t zindex)
344 if (o->type != OSM_TYPE_WAY)
351 printf("[LAB] Labelling way %ju on %u\n", o->id, zindex);
352 struct buffer_linelabel *ll = GARY_PUSH(buffer_linelabel);
353 ll->way = (struct osm_way *) o;
358 void labeller_add_arealabel(struct symbol *sym, struct osm_object *o, z_index_t zindex)
361 printf("Adding area on %u\n", zindex);
362 struct request_area *r = GARY_PUSH(requests_area);
364 r->request.type = REQUEST_AREA;
365 r->request.ind = num_requests++;
367 r->o = (struct osm_multipolygon *) o;
371 osm_obj_center(o, &(r->cx), &(r->cy));
373 GARY_INIT(r->request.variants, 0);
374 struct variant *v = GARY_PUSH(r->request.variants);
377 case SYMBOLIZER_ICON:
379 printf("DEBUG: Icon label\n");
380 make_bitmap_icon(v, (struct sym_icon *) sym);
382 case SYMBOLIZER_TEXT:
384 printf("DEBUG: Text label\n");
385 make_bitmap_label(v, (struct sym_text *) sym);
392 void make_graph(void)
395 struct mempool *mp_edges = mp_new(BLOCK_SIZE);
397 printf("Extracting nodes, will iterate over %lld ways\n", GARY_SIZE(buffer_line));
398 for (uns i=0; i<GARY_SIZE(buffer_line); i++)
400 struct osm_way *way = (struct osm_way *) buffer_line[i].line->s.o;
401 struct graph_node *g_prev = NULL;
402 struct osm_node *o_prev = NULL;
404 CLIST_FOR_EACH(struct osm_ref *, ref, way->nodes)
406 // FIXME: Shall osm_object's type be checked here?
407 struct osm_node *o_node = (struct osm_node *) ref->o;
409 struct graph_node *g_node = hash_find(ref->o->id);
412 g_node = hash_new(ref->o->id);
413 GARY_INIT(g_node->edges, 0);
415 g_node->id = ref->o->id;
416 g_node->num = num_nodes++;
426 struct graph_edge *e = mp_alloc(mp_edges, sizeof(struct graph_edge)); num_edges_dbg++;
427 e->num = num_edges++;
428 e->id = buffer_line[i].line->s.o->id;
429 e->color = buffer_line[i].line->color;
430 e->length = hypot(abs(o_prev->x - o_node->x), abs(o_prev->y - o_node->y));
436 e->longline = (uns) -1;
437 e->line = buffer_line[i].line;
441 struct graph_edge **edge = GARY_PUSH(g_prev->edges);
443 edge = GARY_PUSH(g_node->edges);
451 printf("Made graph with %d edges\n", num_edges_dbg);
454 void dump_graph(void)
456 HASH_FOR_ALL(hash, node)
458 printf("* Node: (%d) #%ju [%.2f; %.2f]\n", node->num, node->id, node->o->x, node->o->y);
459 for (uns i=0; i<GARY_SIZE(node->edges); i++)
461 struct graph_edge *e = node->edges[i];
462 printf("\t edge (%d) #%ju to ", e->num, e->id);
463 if (node->edges[i]->n1->id == node->id)
464 printf("(%d) #%ju [%.2f; %.2f]\n", e->n2->num, e->n2->id, e->n2->o->x, e->n2->o->y);
465 else if (node->edges[i]->n2->id == node->id)
466 printf("(%d) #%ju [%.2f; %.2f]\n", e->n1->num, e->n1->id, e->n1->o->x, e->n1->o->y);
468 printf("BEWARE! BEWARE! BEWARE!\n");
471 if ((node->edges[i]->label)) printf("Labelled\n");
472 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));
473 printf(" colored %d;", node->edges[i]->color);
474 printf(" length %.2f", node->edges[i]->length);
481 void label_graph(void)
484 printf("There are %u line labels requested\n", GARY_SIZE(buffer_linelabel));
485 for (uns i=0; i<GARY_SIZE(buffer_linelabel); i++)
487 if (buffer_linelabel[i].label->type == SYMBOLIZER_TEXT)
489 printf("Labelling nodes of way %s\n", osm_val_decode(((struct sym_text *) buffer_linelabel[i].label)->text));
490 CLIST_FOR_EACH(struct osm_ref *, ref, buffer_linelabel[i].way->nodes)
493 printf("Looking for node %ju\n", ref->o->id);
494 struct graph_node *n = hash_find(ref->o->id);
497 // FIXME: What shall be done?
502 printf("Searching among %u edges\n", GARY_SIZE(n->edges));
503 for (uns j=0; j<GARY_SIZE(n->edges); j++)
505 if (n->edges[j]->id == buffer_linelabel[i].way->o.id)
508 printf("Labelling node %ju\n", n->id);
509 n->edges[j]->label = buffer_linelabel[i].label;
510 n->edges[j]->zindex = buffer_linelabel[i].zindex;
518 void bfs_edge(struct graph_edge *e, struct graph_node *node, struct graph_node *anode, enum edge_dir dir)
521 printf("BFS edge called for edge %d (going %d) in direction %d\n", e->num, e->dir, dir);
522 struct graph_edge *candidate = NULL;
524 for (uns i=0; i<GARY_SIZE(node->edges); i++)
526 struct graph_edge *other = node->edges[i];
527 if ((other->longline != (uns) -1) && (other->longline != e->longline)) continue;
529 if ((uns) other->visited != e->longline) {
531 printf("Pushing new edge %d / %ju\n", other->num, other->id);
532 struct graph_edge **e_ptr = GARY_PUSH(bfs_queue);
534 other->visited = e->longline;
537 if (((other->n1->id == node->id) && (other->n2->id == anode->id)) ||
538 ((other->n2->id == node->id) && (other->n1->id == anode->id)))
541 if (((other->n1->id == node->id) || (other->n2->id == node->id)) &&
542 (e->label) && (other->label) &&
543 (e->label->type == SYMBOLIZER_TEXT) && (other->label->type == SYMBOLIZER_TEXT) &&
544 (((struct sym_text *) e->label)->text == ((struct sym_text *) other->label)->text))
546 if (! candidate || (other->length > candidate->length))
554 printf("New line in longline %u\n", e->longline);
555 struct graph_edge *other = candidate;
556 other->longline = e->longline;
558 if (((dir == DIR_BWD) && (other->n1->id == node->id)) ||
559 ((dir == DIR_FWD) && (other->n2->id == node->id)))
561 struct graph_node *swp = other->n2;
562 other->n2 = other->n1;
571 longlines[other->longline].first = other;
584 void bfs(uns longline)
587 printf("BFS called for longline %u\n", longline);
589 printf("%d longlines are believed to exist, %d exist\n", num_longlines, GARY_SIZE(longlines));
590 for (uns i=0; i<GARY_SIZE(bfs_queue); i++)
592 struct graph_edge *cur = bfs_queue[i];
594 printf("Exploring new edge %d; %d remaining\n", cur->num, GARY_SIZE(bfs_queue));
595 //ASSERT(! cur->visited);
597 cur->visited = longline;
599 if (cur->longline == (uns) -1)
602 if (cur->dir == DIR_UNSET)
604 cur->dir = DIR_CENTER;
605 bfs_edge(cur, cur->n1, cur->n2, DIR_BWD);
606 bfs_edge(cur, cur->n2, cur->n1, DIR_FWD);
613 bfs_edge(cur, cur->n1, cur->n2, cur->dir);
616 bfs_edge(cur, cur->n2, cur->n1, cur->dir);
626 void bfs_wrapper(void)
628 GARY_INIT(bfs_queue, 0);
629 GARY_INIT(longlines, 0);
631 HASH_FOR_ALL(hash, node)
633 for (uns i=0; i<GARY_SIZE(node->edges); i++)
635 if ((node->edges[i]->label) && (node->edges[i]->longline == (uns) -1))
637 GARY_PUSH(longlines);
638 longlines[num_longlines].first = node->edges[i];
640 printf("Running new BFS\n");
642 printf("Creating longline %u\n", num_longlines);
643 GARY_RESIZE(bfs_queue, 0);
644 struct graph_edge **e = GARY_PUSH(bfs_queue);
646 node->edges[i]->longline = num_longlines;
647 bfs(node->edges[i]->longline);
650 printf("Joined %d edges\n", dbg_num_hits); dbg_num_hits = 0;
652 printf("Planned %u edges\n", GARY_SIZE(bfs_queue));
659 GARY_FREE(bfs_queue);
662 void dump_longlines(void)
664 printf("*** Longlines dump\n");
665 for (uns i=0; i<GARY_SIZE(longlines); i++)
667 printf("Longline %u:", i);
668 struct graph_edge *e = longlines[i].first;
669 if ((e->label) && (e->label->type == SYMBOLIZER_TEXT))
670 printf(" labelled %s", osm_val_decode(((struct sym_text *) e->label)->text));
675 printf("\t#%ju (%d): [%.2f; %.2f] -- [%.2f; %.2f] (dir %d)\n",
676 e->id, e->num, e->n1->o->x, e->n1->o->y, e->n2->o->x, e->n2->o->y, e->dir);
683 struct request_line *make_new_line(void)
685 struct request_line *rl = GARY_PUSH(requests_line);
686 rl->request.ind = num_requests++;
687 rl->request.type = REQUEST_LINE;
688 GARY_INIT(rl->sections, 0);
693 struct request_section *make_new_section(struct request_line *rl)
695 struct request_section *rls = GARY_PUSH(rl->sections);
696 rls->request.ind = num_requests++;
697 rls->request.type = REQUEST_SECTION;
698 rls->num_segments = 0;
699 GARY_INIT(rls->segments, 0);
704 struct request_segment *make_new_segment(struct request_section *rls, struct symbol *sym)
706 struct request_segment *rs = GARY_PUSH(rls->segments);
709 rs->request.ind = num_requests++;
710 rs->request.type = REQUEST_SEGMENT;
712 struct variant *v = malloc(sizeof(struct variant));
714 rs->request.variants = v;
719 void cut_edge(struct graph_edge *e, double dist)
722 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);
724 struct graph_edge *new = malloc(sizeof(struct graph_edge));
728 // FIXME? Create new label for new edge, don't only copy pointer?
730 struct osm_node *n1 = e->n1->o;
731 struct osm_node *n2 = e->n2->o;
734 if ((n1->x == n2->x) && (n1->y == n2->y))
736 printf("[%.2f; %.2f] -- [%.2f; %.2f]\n", n1->x, n1->y, n2->x, n2->y);
737 printf("Won't cut point\n");
741 struct osm_node *n11 = malloc(sizeof(struct osm_node));
742 struct graph_node *gn = malloc(sizeof(struct graph_node));
744 double vsize = sqrt(pow(n1->x - n2->x, 2) + pow(n1->y - n2->y, 2));
745 n11->x = n1->x + (n2->x - n1->x) / vsize * dist;
746 n11->y = n1->y + (n2->y - n1->y) / vsize * dist;
748 e->n2 = new->n1 = gn;
750 e->length = hypot(abs(n1->x - n11->x), abs(n1->y - n11->y));
751 new->length = hypot(abs(n11->x - n2->x), abs(n11->y - n2->y));
755 void make_segments(void)
757 for (uns i=0; i<GARY_SIZE(longlines); i++)
759 // Skip lines which are not labelled
760 if (! (longlines[i].first && longlines[i].first->label))
763 struct request_line *request = make_new_line();
764 struct request_section *rls = make_new_section(request);
765 struct request_segment *rs = NULL;
767 struct graph_edge *e = longlines[i].first;
768 double cur_length = 0;
770 struct sym_text *st = NULL;
771 if (e->label->type == SYMBOLIZER_TEXT)
773 st = (struct sym_text *) e->label;
778 printf("Warning: Skipping line\n");
784 printf("New longline\n");
789 printf("BEWARE: Edge cycle\n");
792 e->visited = -1; // FIXME
795 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);
797 if (st && (e->length < st->tw))
800 //printf("Warning: Skipping segment\n");
804 if (cur_length + e->length > conf_max_section_length + conf_max_section_overlay)
807 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);
808 // HACK to prevent cutting to 0 lenght
809 cut_edge(e, max2(conf_max_section_length - cur_length, 2));
812 rs = make_new_segment(rls, e->label);
813 rs->label = malloc(sizeof(struct sym_text));
814 *((struct sym_text *) rs->label) = *((struct sym_text *) e->label);
816 rs->x1 = e->n1->o->x;
817 rs->y1 = e->n1->o->y;
818 rs->x2 = e->n2->o->x;
819 rs->y2 = e->n2->o->y;
821 // FIXME: Set text rotation
822 rs->angle = atan2(rs->x2 - rs->x1, rs->y2 - rs->y1);
823 rs->zindex = e->zindex;
825 cur_length += e->length;
826 if (cur_length > conf_max_section_length)
829 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);
831 rls = make_new_section(request);
838 if (request->sections[0].num_segments == 0)
841 printf("WARNING: 0 segment section\n");
842 GARY_POP(requests_line);
848 void dump_linelabel_requests(void)
850 for (uns i=0; i<GARY_SIZE(requests_line); i++)
852 if (requests_line[i].sections[0].num_segments == 0)
857 printf("Request for linelabel, %d sections\n", GARY_SIZE(requests_line[i].sections));
858 print_label(requests_line[i].sections[0].segments[0].label);
859 for (uns j=0; j<GARY_SIZE(requests_line[i].sections); j++)
861 printf("%d section, %d segments\n", j, GARY_SIZE(requests_line[i].sections[j].segments));
862 for (uns k=0; k<GARY_SIZE(requests_line[i].sections[j].segments); k++)
864 struct request_segment *rs = &requests_line[i].sections[j].segments[k];
865 printf("[%.2f; %.2f] -- [%.2f; %.2f]\n", rs->x1, rs->y1, rs->x2, rs->y2);
872 void dump_bitmaps(struct individual *individual)
874 bool *bitmap = malloc(page_width_int * page_height_int * sizeof(bool));
875 printf("Bitmap size is %d\n", page_width_int * page_height_int);
876 for (int i=0; i<page_height_int; i++)
877 for (int j=0; j<page_width_int; j++)
878 bitmap[i*page_width_int + j] = 0;
880 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
882 if (individual->placements[i].variant_used == -1) continue;
884 struct placement *p = &(individual->placements[i]);
885 struct variant *v = NULL;
887 switch (p->request->type)
889 case REQUEST_SEGMENT: ;
890 case REQUEST_POINT: ;
892 v = &(p->request->variants[p->variant_used]);
895 ASSERT(p->request->type != REQUEST_INVALID);
899 for (int row = max2(p->y, 0); row < min2(p->y + v->height, page_height_int); row++)
901 for (int col = max2(p->x, 0); col < min2(p->x + v->width, page_width_int); col++)
903 bitmap[row * page_width_int + col] = 1;
909 FILE *fd_dump = fopen("dump.pbm", "w");
910 fprintf(fd_dump, "P1\n");
911 fprintf(fd_dump, "%d %d\n", page_width_int, page_height_int);
912 for (int i=0; i<page_height_int; i++)
914 for (int j=0; j<page_width_int; j++)
916 fprintf(fd_dump, "%d", bitmap[(int) (i*page_width_int + j)] ? 1 : 0);
918 fprintf(fd_dump, "\n");
923 void dump_individual(struct individual *individual)
925 printf("*** Dumping INDIVIDUAL ***\n");
926 printf("(There are %d requests)\n", num_requests);
927 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
929 struct placement *p = &(individual->placements[i]);
931 switch (p->request->type)
934 printf("Point at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_point *) p->request)->zindex);
937 struct request_line *rl = (struct request_line *) p->request;
939 print_label(rl->sections[0].segments[0].label);
941 case REQUEST_SECTION: ;
944 case REQUEST_SEGMENT: ;
945 if (p->variant_used >= 0)
946 printf("Segment placed at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_segment *) p->request)->zindex);
948 printf("Segment not placed\n");
951 struct request_area *ra = (struct request_area *) p->request;
952 printf("Area label ");
953 print_label(ra->label);
954 printf(" at [%.2f; %.2f] on %u\n", p->x, p->y, ((struct request_area *) p->request)->zindex);
957 printf("Testing request type (dump_individual)\n");
958 ASSERT(p->request->type != 0);
961 printf("\nTotal penalty: %d\n", individual->penalty);
964 void plan_individual(struct individual *individual)
966 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
968 struct symbol *s = NULL;
969 z_index_t zindex = 0;
970 if (individual->placements[i].variant_used < 0) continue;
971 switch (individual->placements[i].request->type)
973 case REQUEST_POINT: ;
974 struct request_point *rp = (struct request_point *) individual->placements[i].request;
978 case REQUEST_SEGMENT: ;
979 struct request_segment *rs = (struct request_segment *) individual->placements[i].request;
986 struct request_area *ra = (struct request_area *) individual->placements[i].request;
991 ASSERT(individual->placements[i].request != REQUEST_INVALID);
996 printf("Will plan symbol at [%.2f; %.2f] on %u\n", individual->placements[i].x, individual->placements[i].y, zindex);
998 if (s) switch (s->type)
1000 case SYMBOLIZER_POINT: ;
1001 struct sym_point *sp = (struct sym_point *) s;
1002 sp->x = individual->placements[i].x;
1003 sp->y = individual->placements[i].y;
1004 sym_plan((struct symbol *) sp, zindex);
1006 case SYMBOLIZER_ICON: ;
1007 struct sym_icon *si = (struct sym_icon *) s;
1008 si->sir.x = individual->placements[i].x;
1009 si->sir.y = individual->placements[i].y;
1010 sym_plan((struct symbol *) si, zindex);
1012 case SYMBOLIZER_TEXT: ;
1013 struct sym_text *st = (struct sym_text *) s;
1014 st->x = individual->placements[i].x;
1015 st->y = individual->placements[i].y;
1016 st->next_duplicate = NULL;
1017 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);
1018 sym_plan((struct symbol *) st, zindex);
1021 ASSERT(s->type != SYMBOLIZER_INVALID);
1027 void labeller_label(void)
1034 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));
1036 GARY_INIT(population1, conf_pop_size);
1037 GARY_INIT(population2, conf_pop_size);
1040 printf("Dealing with %d requests\n", num_requests);
1043 while (! shall_terminate())
1047 struct individual **swp = population1;
1048 population1 = population2;
1054 plan_individual(population1[0]);
1061 void labeller_cleanup(void)
1065 void make_population(void)
1067 for (int i=0; i<conf_pop_size; i++)
1070 printf("Making individual %d\n", i);
1071 struct individual *individual = ep_alloc(ep_individuals); init_individual(individual);
1072 population1[i] = individual;
1075 for (uns j=0; j<GARY_SIZE(requests_point); j++)
1077 init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_point[j]);
1080 for (uns j=0; j<GARY_SIZE(requests_line); j++)
1082 init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_line[j]);
1084 for (uns k=0; k<GARY_SIZE(requests_line[j].sections); k++)
1086 init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_line[j].sections[k]);
1088 for (uns l=0; l<GARY_SIZE(requests_line[j].sections[k].segments); l++)
1090 init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_line[j].sections[k].segments[l]);
1095 for (uns j=0; j<GARY_SIZE(requests_area); j++)
1097 init_placement(&(individual->placements[p++]), individual, (struct request *) &requests_area[j]);
1100 hide_segment_labels(individual);
1102 ASSERT(p == num_requests);
1106 bool shall_terminate(void)
1108 switch (conf_term_cond)
1110 case TERM_COND_PENALTY:
1111 return (population1[0]->penalty < conf_penalty_bound);
1112 case TERM_COND_STAGNATION:
1113 return (abs(old_best - population1[0]->penalty) < conf_stagnation_bound);
1114 case TERM_COND_ITERATIONS:
1115 return (iteration >= conf_iteration_limit);
1117 // FIXME: Warn the user that no condition is set
1126 printf("%.2f\n", ((double) conf_breed_pop_size_perc/100));
1127 int conf_breed_pop_size = ((double) conf_breed_pop_size_perc/100) * conf_pop_size;
1128 struct individual **breed_buffer;
1129 while (i < conf_breed_pop_size)
1131 printf("%d < %d, breeding\n", i, conf_breed_pop_size);
1132 int parent1 = randint(1, conf_breed_pop_size);
1133 int parent2 = randint(1, conf_breed_pop_size);
1134 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);
1135 breed_buffer = perform_crossover(population1[parent1], population1[parent2]);
1136 population2[pop2_ind++] = breed_buffer[0];
1137 population2[pop2_ind++] = breed_buffer[1];
1142 acc += conf_breed_rbest_perc;
1144 return; // FIXME: DEBUG HACK
1146 int remaining = (1 - acc) * (conf_pop_size * conf_breed_perc);
1147 int step = remaining / conf_pop_size;
1148 for (; i<conf_pop_size; i += 2)
1150 printf("Asking for %d and %d of %d\n", i*step, i*(step+1), conf_pop_size);
1151 breed_buffer = perform_crossover(population1[i*step], population1[i*step+1]);
1152 population2[pop2_ind++] = breed_buffer[0];
1153 population2[pop2_ind++] = breed_buffer[1];
1156 // FIXME: Could there be one missing individual?
1159 struct individual **perform_crossover(struct individual *parent1, struct individual *parent2)
1161 struct individual **buffer = malloc(2*sizeof(struct individual));
1162 struct individual *child1 = ep_alloc(ep_individuals); init_individual(child1);
1163 struct individual *child2 = ep_alloc(ep_individuals); init_individual(child2);
1165 printf("Performing crossover\n");
1167 for (uns i=0; i<GARY_SIZE(parent1->placements); i++)
1169 printf("%dth placement out of %d\n", i, num_requests);
1170 if (! parent1->placements[i].processed)
1172 struct placement **clos_symbols = get_closure(&(parent1->placements[i]), parent1, parent2);
1173 int x = randint(1, 2);
1177 copy_symbols(clos_symbols, parent1, child1);
1178 copy_symbols(clos_symbols, parent2, child2);
1182 copy_symbols(clos_symbols, parent2, child1);
1183 copy_symbols(clos_symbols, parent1, child2);
1185 printf("Symbols copied; %lld\n", GARY_SIZE(clos_symbols));
1186 GARY_FREE(clos_symbols);
1189 if (conf_mutate_children)
1191 if (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child1);
1192 if (randint(1, 1000) < conf_mutate_children_prob * 1000) perform_mutation(child2);
1204 int conf_mutate_pop_size = conf_mutate_pop_size_perc * conf_pop_size;
1205 while (i < conf_mutate_rbest_perc * conf_pop_size)
1207 int ind = randint(1, conf_mutate_pop_size);
1208 copy_individual(population2[pop2_ind], population1[ind]);
1209 perform_mutation(population2[pop2_ind]);
1214 void perform_mutation(struct individual *individual)
1216 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
1218 int x = randint(1, 1000);
1221 if (x <= acc + conf_mutate_move_bound)
1223 move_symbol(&(individual->placements[i]));
1226 acc += conf_mutate_move_bound;
1228 if (x <= acc + conf_mutate_regen_bound)
1230 gen_coords(&(individual->placements[i]));
1233 acc += conf_mutate_regen_bound;
1235 if (x <= acc + conf_mutate_chvar_bound)
1237 if (0) // if num_variants > 1
1239 // FIXME: assign new variant
1247 for (int i=0; i<conf_elite_perc * conf_pop_size; i++)
1249 population2[pop2_ind++] = population1[0];
1253 void rank_population(void)
1258 struct map_part **get_map_parts(struct placement *p)
1260 if (p->variant_used < 0) return NULL;
1262 struct map_part **buffer;
1263 GARY_INIT(buffer, 0);
1266 printf("Looking for map parts containing placement of request %d, placed at [%.2f; %.2f]\n", p->request->ind, p->x, p->y);
1269 switch (p->request->type)
1272 case REQUEST_SEGMENT:
1274 v = p->request->variants[p->variant_used];
1280 int x_min = max2(0, p->x) / conf_map_part_width;
1281 int x_max = min2(page_width_int, (p->x + v.width + conf_map_part_width - 1)) / conf_map_part_width;
1282 int y_min = max2(0, p->y) / conf_map_part_height;
1283 int y_max = min2(page_height_int, (p->y + v.height + conf_map_part_height - 1)) / conf_map_part_height;
1286 printf("Cells between [%d; %d] and [%d; %d] generated\n", x_min, y_min, x_max, y_max);
1288 for (int y=y_min; y<=y_max; y++)
1289 for (int x=x_min; x<=x_max; x++)
1291 struct map_part **m = GARY_PUSH(buffer);
1293 printf("Asking for %d of %u\n", y * num_map_parts_row + x, GARY_SIZE(p->individual->map));
1294 *m = p->individual->map[y * num_map_parts_row + x];
1300 void update_map_parts(struct placement *p)
1302 struct placement_link *ml = p->map_links;
1305 struct map_placement *mp = ml->mp;
1306 mp->prev = mp->next;
1308 mp->next->prev = mp->prev;
1311 struct placement_link *tmp = ml;
1316 struct map_part **parts = get_map_parts(p);
1317 if (parts == NULL) return;
1319 for (uns i=0; i<GARY_SIZE(parts); i++)
1321 struct map_placement *mp = malloc(sizeof(struct map_placement));
1324 mp->next = parts[i]->placement->next;
1325 parts[i]->placement->next = mp;
1326 if (mp->next) mp->next->prev = mp;
1328 struct placement_link *ml = malloc(sizeof(struct placement_link));
1330 ml->next = p->map_links;
1337 void gen_coords(struct placement *p)
1339 switch(p->request->type)
1342 gen_coords_point(p);
1347 case REQUEST_SEGMENT:
1348 gen_coords_segment(p);
1352 printf("Not yet implemented\n");
1356 printf("Testing request type\n");
1357 ASSERT(p->request->type != REQUEST_INVALID);
1360 update_map_parts(p);
1363 double gen_movement(void)
1365 double m = (random() % 1000000) / 10000;
1366 m = pow(m, 1.0/3) * flip(1, -1);
1368 printf("Movement %.2f\n", m);
1372 void gen_coords_point(struct placement *p)
1374 p->x = p->x + gen_movement();
1377 void gen_coords_segment(struct placement *p)
1379 struct request_segment *rs = (struct request_segment *) p->request;
1381 p->x = (a == 1 ? rs->x1 : rs->x2);
1382 p->y = (a == 1 ? rs->y1 : rs->y2);
1385 void gen_coords_area(struct placement *p)
1387 struct request_area *ra = (struct request_area *) p->request;
1389 p->x = p->x + gen_movement();
1390 p->y = p->y + gen_movement();
1393 printf("Moved label to [%.2f; %.2f] from [%.2f; %.2f]\n", p->x, p->y, ra->cx, ra->cy);
1396 struct map_part **get_parts(struct placement *symbol, struct individual *individual)
1398 struct map_part **buffer;
1399 GARY_INIT(buffer, 0);
1400 int x_min = symbol->x / conf_part_size;
1401 int x_max = (symbol->x /*+ symbol->bitmap->width*/ + conf_part_size - 1) / conf_part_size;
1402 int y_min = symbol->y / conf_part_size;
1403 int y_max = (symbol->y /*+ symbol->bitmap->height*/ + conf_part_size - 1) / conf_part_size;
1405 for (int x=x_min; x < x_max; x++)
1406 for (int y=y_min; y < y_max; y++)
1408 struct map_part *m = GARY_PUSH(buffer);
1409 *m = individual->map[x][y];
1415 int randint(int min, int max)
1417 if (min == max) return min;
1419 //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)));
1420 return min + (r % (max - min));
1421 return (r * (max - min));
1424 struct placement **get_closure(struct placement *placement, struct individual *parent1, struct individual *parent2 UNUSED)
1426 printf("Getting closure\n");
1427 struct placement **closure;
1428 GARY_INIT(closure, 0);
1429 bool *chosen = malloc(GARY_SIZE(parent1->placements) * sizeof(bool));
1430 chosen[placement->request->ind] = 1;
1432 struct placement **p = GARY_PUSH(closure); *p = placement;
1435 while (first < GARY_SIZE(closure))
1437 printf("Iterating, first is %d\n", first);
1438 struct placement **overlapping = get_overlapping(placement);
1439 filter(overlapping, chosen);
1440 for (uns j=0; j<GARY_SIZE(overlapping); j++)
1442 p = GARY_PUSH(closure); *p = overlapping[j];
1443 chosen[overlapping[j]->request->ind] = 1;
1445 GARY_FREE(overlapping);
1452 void copy_symbols(struct placement **closure, struct individual *parent, struct individual *child)
1454 //printf("%d\n", child->penalty);
1455 //printf("Closure size: %lld\n", GARY_SIZE(closure));
1456 for (uns i=0; i<GARY_SIZE(closure); i++)
1458 int ind = closure[i]->request->ind;
1459 child->placements[ind] = parent->placements[ind];
1460 child->placements[ind].processed = 0;
1464 void move_symbol(struct placement *p)
1466 switch (p->request->type)
1469 move_symbol_point(p);
1471 case REQUEST_SEGMENT:
1474 printf("Not yet implemented\n");
1476 ASSERT(p->request->type != REQUEST_INVALID);
1480 void move_symbol_point(struct placement *p)
1482 p->x += (double) (move_min + randdouble()) * flip(1, -1);
1483 p->y += (double) (move_min + randdouble()) * flip(1, -1);
1486 void hide_segment_labels(struct individual *individual)
1488 // BEWARE: This fully depends on current genetic encoding
1490 int used = -1, num = -1;
1491 for (uns i=0; i<GARY_SIZE(individual->placements); i++)
1493 switch (individual->placements[i].request->type)
1495 case REQUEST_SECTION:
1496 used = individual->placements[i].variant_used;
1499 case REQUEST_SEGMENT:
1501 individual->placements[i].variant_used = 0;
1503 individual->placements[i].variant_used = -1;
1512 void init_placement(struct placement *p, struct individual *individual, struct request *r)
1517 p->x = p->y = 0; // To prevent valgrind from complaining
1518 p->variant_used = 0;
1519 p->map_links = NULL;
1520 p->individual = individual;
1523 case REQUEST_POINT: ;
1524 struct request_point *rp = (struct request_point *) r;
1528 case REQUEST_LINE: ;
1530 case REQUEST_SECTION: ;
1531 struct request_section *rls = (struct request_section *) r;
1532 p->variant_used = randint(0, rls->num_segments);
1534 case REQUEST_SEGMENT: ;
1535 struct request_segment *rs = (struct request_segment *) r;
1539 case REQUEST_AREA: ;
1540 struct request_area *ra = (struct request_area *) r;
1543 p->variant_used = 0;
1546 ASSERT(p->request->type != REQUEST_INVALID);
1547 printf("Valid request: %d\n", p->request->type);
1552 printf("Inited placement to [%.2f; %.2f]\n", p->x, p->y);
1555 void init_individual(struct individual *i)
1557 //printf("Initing individual\n");
1558 GARY_INIT(i->placements, num_requests);
1559 GARY_INIT(i->map, 0);
1560 for (uns j=0; j<num_map_parts; j++)
1562 struct map_part *part = GARY_PUSH(i->map);
1563 GARY_INIT(part->placement, 0);
1564 struct map_placement *mp = GARY_PUSH(part->placement);
1565 mp->placement = &dummy_placement;
1566 mp->next = mp->prev = NULL;
1568 i->penalty = 0; // FIXME
1571 printf("Individual inited, has %u map parts\n", GARY_SIZE(i->map));
1574 struct placement **get_overlapping(struct placement *p UNUSED)
1576 struct placement **buffer;
1577 GARY_INIT(buffer, 0);
1581 void filter(struct placement **list UNUSED, bool *pred UNUSED)
1586 int flip(int a, int b)
1588 return (random() % 2 ? a : b);
1591 double randdouble(void)
1593 // FIXME: How the hell shall double in range <0, 1> be generated? O:)
1600 GARY_FREE(requests_point);
1601 GARY_FREE(requests_line);
1602 GARY_FREE(requests_area);
1605 void copy_individual(struct individual *src, struct individual *dest)
1607 src->penalty = dest->penalty;
1608 GARY_INIT(dest->placements, GARY_SIZE(src->placements));
1609 for (uns i=0; i<GARY_SIZE(src->placements); i++)
1611 dest->placements[i] = src->placements[i];