Searched refs:db_printf (Results 1 - 8 of 8) sorted by relevance

/inkscape/src/libavoid/
H A Ddebug.h40 inline void db_printf(const char *fmt, ...) function in namespace:Avoid
48 inline void db_printf(const char *, ...)
H A Dgraph.cpp338 db_printf("Edge(");
340 db_printf(",");
342 db_printf(")\n");
350 db_printf("\tChecking visibility for existing invisibility edge..."
356 db_printf("\tChecking visibility for existing visibility edge..."
388 db_printf("1: Edge of bounding shape\n");
412 db_printf("2: Edge of bounding shape\n");
424 db_printf("\tSetting visibility edge... \n\t\t");
435 db_printf("%d, %d, %d\n", cone1, cone2, blocker);
436 db_printf("\
[all...]
H A Dconnector.cpp277 //db_printf("common_updateEndPoint(%d,(pid=%d,vn=%d,(%f,%f)))\n",
476 db_printf("Error:\tTrying to update libavoid route with itself.\n");
644 db_printf("a=(%g, %g)\n", a.x, a.y);
645 db_printf("b=(%g, %g)\n", b.x, b.y);
646 db_printf("c=(%g, %g)\n", c.x, c.y);
647 db_printf("d=(%g, %g)\n", d.x, d.y);
648 db_printf("e=(%g, %g)\n", e.x, e.y);
653 db_printf("(abc == %d) ", abc);
671 db_printf("&& (abe == %d) && (abd == %d) &&\n(bce == %d) && (bcd == %d)",
692 db_printf("\
[all...]
H A Dmakepath.cpp193 //db_printf("deg from straight: %g\tpenalty: %g\n",
431 db_printf("/// %d %d %d\n", pnt.id, (int) isShape, pnt.vn);
517 db_printf("Considering... ");
518 db_printf(" %g %g ", BestNode.inf->point.x, BestNode.inf->point.y);
520 db_printf(" - g: %3.1f h: %3.1f back: ", BestNode.g, BestNode.h);
523 db_printf(" %g %g", prevInf->point.x, prevInf->point.y);
526 db_printf("\n");
579 db_printf("Cost: %g\n", BestNode.f);
665 db_printf("-- Adding: %g %g ", Node.inf->point.x,
668 db_printf("
[all...]
H A Dvisibility.cpp73 db_printf("-- CONSIDERING --\n");
76 db_printf("\tFirst Half:\n");
87 db_printf("\tSecond Half:\n");
510 db_printf("Center is inside shape %u so ignore shape edges.\n",
598 db_printf("SWEEP: "); centerID.db_print(); db_printf("\n");
654 db_printf("\tSetting invisibility edge... \n\t\t");
671 db_printf("\tSetting visibility edge... \n\t\t");
677 db_printf("\tSetting invisibility edge... \n\t\t");
H A Drouter.cpp162 db_printf("Deleting connector %u in ~Router()\n", (*conn)->id());
172 db_printf("Deleting shape %u in ~Router()\n", shapePtr->id());
339 db_printf("warning: multiple moves requested for shape %d "
666 db_printf("Warning:\tlibavoid object ID %d not unique.\n", id);
894 db_printf("\tRemoving newly blocked edge (by shape %3d)"
1139 //db_printf("n_p2: (%.1f, %.1f)\n", n_p2.x, n_p2.y);
1140 //db_printf("n_start: (%.1f, %.1f)\n", n_start.x, n_start.y);
1141 //db_printf("n_end: (%.1f, %.1f)\n", n_end.x, n_end.y);
1144 //db_printf("theta = %.2f\n", theta * (180 / PI));
1160 //db_printf("r_p
[all...]
H A Dshape.cpp274 db_printf("WARNING: two moves queued for same shape prior to rerouting."
H A Dvertices.cpp136 db_printf("[%u,%d]", objID, vn);

Completed in 97 milliseconds