From: Diederik van Lierop Date: Fri, 19 Feb 2010 22:33:27 +0000 (+0100) Subject: Noop: removing and updating comments, fixing indentation X-Git-Url: https://git.tokkee.org/?a=commitdiff_plain;h=23d5bdf2e630a705e128bd097bd68fa8ded55e9c;p=inkscape.git Noop: removing and updating comments, fixing indentation --- diff --git a/src/desktop-events.cpp b/src/desktop-events.cpp index 7cf075f26..f229c642a 100644 --- a/src/desktop-events.cpp +++ b/src/desktop-events.cpp @@ -87,9 +87,6 @@ static gint sp_dt_ruler_event(GtkWidget *widget, GdkEvent *event, SPDesktopWidge if (event->button.button == 1) { dragging = true; - // FIXME: The snap delay mechanism won't work here, because it has been implemented for the event context. Dragging - // guides off the ruler will send event to the ruler and not to the context, which bypasses sp_event_context_snap_delay_handler - Geom::Point const event_w(sp_canvas_window_to_world(dtw->canvas, event_win)); Geom::Point const event_dt(desktop->w2d(event_w)); diff --git a/src/livarot/Shape.h b/src/livarot/Shape.h index ca8ae1c6e..44dd43a4a 100644 --- a/src/livarot/Shape.h +++ b/src/livarot/Shape.h @@ -41,9 +41,9 @@ enum { // possible values for the "type" field in the Shape class: enum { - shape_graph = 0, // it's just a graph; a bunch of edges, maybe intersections - shape_polygon = 1, // a polygon: intersection-free, edges oriented so that the inside is on their left - shape_polypatch = 2 // a graph without intersection; each face is a polygon (not yet used) + shape_graph = 0, // it's just a graph; a bunch of edges, maybe intersections + shape_polygon = 1, // a polygon: intersection-free, edges oriented so that the inside is on their left + shape_polypatch = 2 // a graph without intersection; each face is a polygon (not yet used) }; class IntLigne; @@ -56,59 +56,59 @@ public: struct back_data { - int pathID, pieceID; - double tSt, tEn; + int pathID, pieceID; + double tSt, tEn; }; struct voronoi_point - { // info for points treated as points of a voronoi diagram (obtained by MakeShape()) - double value; // distance to source - int winding; // winding relatively to source + { // info for points treated as points of a voronoi diagram (obtained by MakeShape()) + double value; // distance to source + int winding; // winding relatively to source }; struct voronoi_edge - { // info for edges, treated as approximation of edges of the voronoi diagram - int leF, riF; // left and right site - double leStX, leStY, riStX, riStY; // on the left side: (leStX,leStY) is the smallest vector from the source to st - // etc... - double leEnX, leEnY, riEnX, riEnY; + { // info for edges, treated as approximation of edges of the voronoi diagram + int leF, riF; // left and right site + double leStX, leStY, riStX, riStY; // on the left side: (leStX,leStY) is the smallest vector from the source to st + // etc... + double leEnX, leEnY, riEnX, riEnY; }; struct quick_raster_data { - double x; // x-position on the sweepline - int bord; // index of the edge - int ind; // index of qrsData elem for edge (ie inverse of the bord) - int next,prev; // dbl linkage + double x; // x-position on the sweepline + int bord; // index of the edge + int ind; // index of qrsData elem for edge (ie inverse of the bord) + int next,prev; // dbl linkage }; enum sTreeChangeType { - EDGE_INSERTED = 0, - EDGE_REMOVED = 1, - INTERSECTION = 2 + EDGE_INSERTED = 0, + EDGE_REMOVED = 1, + INTERSECTION = 2 }; struct sTreeChange { - sTreeChangeType type; // type of modification to the sweepline: - int ptNo; // point at which the modification takes place - - Shape *src; // left edge (or unique edge if not an intersection) involved in the event - int bord; - Shape *osrc; // right edge (if intersection) - int obord; - Shape *lSrc; // edge directly on the left in the sweepline at the moment of the event - int lBrd; - Shape *rSrc; // edge directly on the right - int rBrd; + sTreeChangeType type; // type of modification to the sweepline: + int ptNo; // point at which the modification takes place + + Shape *src; // left edge (or unique edge if not an intersection) involved in the event + int bord; + Shape *osrc; // right edge (if intersection) + int obord; + Shape *lSrc; // edge directly on the left in the sweepline at the moment of the event + int lBrd; + Shape *rSrc; // edge directly on the right + int rBrd; }; struct incidenceData { - int nextInc; // next incidence in the linked list - int pt; // point incident to the edge (there is one list per edge) - double theta; // coordinate of the incidence on the edge + int nextInc; // next incidence in the linked list + int pt; // point incident to the edge (there is one list per edge) + double theta; // coordinate of the incidence on the edge }; Shape(); @@ -124,14 +124,14 @@ public: // -reset the graph, and ensure there's room for n points and m edges void Reset(int n = 0, int m = 0); // -points: - int AddPoint(const Geom::Point x); // as the function name says + int AddPoint(const Geom::Point x); // as the function name says // returns the index at which the point has been added in the array - void SubPoint(int p); // removes the point at index p + void SubPoint(int p); // removes the point at index p // nota: this function relocates the last point to the index p // so don't trust point indices if you use SubPoint - void SwapPoints(int a, int b); // swaps 2 points at indices a and b - void SwapPoints(int a, int b, int c); // swaps 3 points: c <- a <- b <- c - void SortPoints(); // sorts the points if needed (checks the need_points_sorting flag) + void SwapPoints(int a, int b); // swaps 2 points at indices a and b + void SwapPoints(int a, int b, int c); // swaps 3 points: c <- a <- b <- c + void SortPoints(); // sorts the points if needed (checks the need_points_sorting flag) // -edges: // add an edge between points of indices st and en @@ -143,98 +143,98 @@ public: // return the edge index in the array // version for the voronoi (with faces IDs) - void SubEdge(int e); // removes the edge at index e (same remarks as for SubPoint) - void SwapEdges(int a, int b); // swaps 2 edges - void SwapEdges(int a, int b, int c); // swaps 3 edges - void SortEdges(); // sort the edges if needed (checks the need_edges_sorting falg) + void SubEdge(int e); // removes the edge at index e (same remarks as for SubPoint) + void SwapEdges(int a, int b); // swaps 2 edges + void SwapEdges(int a, int b, int c); // swaps 3 edges + void SortEdges(); // sort the edges if needed (checks the need_edges_sorting falg) // primitives for topological manipulations // endpoint of edge at index b that is different from the point p inline int Other(int p, int b) const { - if (getEdge(b).st == p) { - return getEdge(b).en; - } - return getEdge(b).st; + if (getEdge(b).st == p) { + return getEdge(b).en; + } + return getEdge(b).st; } // next edge (after edge b) in the double-linked list at point p - inline int NextAt(int p, int b) const + inline int NextAt(int p, int b) const { - if (p == getEdge(b).st) { - return getEdge(b).nextS; - } - else if (p == getEdge(b).en) { - return getEdge(b).nextE; - } - - return -1; + if (p == getEdge(b).st) { + return getEdge(b).nextS; + } + else if (p == getEdge(b).en) { + return getEdge(b).nextE; + } + + return -1; } // previous edge inline int PrevAt(int p, int b) const { - if (p == getEdge(b).st) { - return getEdge(b).prevS; - } - else if (p == getEdge(b).en) { - return getEdge(b).prevE; - } - - return -1; + if (p == getEdge(b).st) { + return getEdge(b).prevS; + } + else if (p == getEdge(b).en) { + return getEdge(b).prevE; + } + + return -1; } // same as NextAt, but the list is considered circular - inline int CycleNextAt(int p, int b) const + inline int CycleNextAt(int p, int b) const { - if (p == getEdge(b).st) { - if (getEdge(b).nextS < 0) { - return getPoint(p).incidentEdge[FIRST]; - } - return getEdge(b).nextS; - } else if (p == getEdge(b).en) { - if (getEdge(b).nextE < 0) { - return getPoint(p).incidentEdge[FIRST]; - } - - return getEdge(b).nextE; - } - - return -1; + if (p == getEdge(b).st) { + if (getEdge(b).nextS < 0) { + return getPoint(p).incidentEdge[FIRST]; + } + return getEdge(b).nextS; + } else if (p == getEdge(b).en) { + if (getEdge(b).nextE < 0) { + return getPoint(p).incidentEdge[FIRST]; + } + + return getEdge(b).nextE; + } + + return -1; } // same as PrevAt, but the list is considered circular inline int CyclePrevAt(int p, int b) const { - if (p == getEdge(b).st) { - if (getEdge(b).prevS < 0) { - return getPoint(p).incidentEdge[LAST]; - } - return getEdge(b).prevS; - } else if (p == getEdge(b).en) { - if (getEdge(b).prevE < 0) { - return getPoint(p).incidentEdge[LAST]; - } - return getEdge(b).prevE; - } - - return -1; + if (p == getEdge(b).st) { + if (getEdge(b).prevS < 0) { + return getPoint(p).incidentEdge[LAST]; + } + return getEdge(b).prevS; + } else if (p == getEdge(b).en) { + if (getEdge(b).prevE < 0) { + return getPoint(p).incidentEdge[LAST]; + } + return getEdge(b).prevE; + } + + return -1; } - void ConnectStart(int p, int b); // set the point p as the start of edge b - void ConnectEnd(int p, int b); // set the point p as the end of edge b - void DisconnectStart(int b); // disconnect edge b from its start point - void DisconnectEnd(int b); // disconnect edge b from its end point + void ConnectStart(int p, int b); // set the point p as the start of edge b + void ConnectEnd(int p, int b); // set the point p as the end of edge b + void DisconnectStart(int b); // disconnect edge b from its start point + void DisconnectEnd(int b); // disconnect edge b from its end point // reverses edge b (start <-> end) - void Inverse(int b); + void Inverse(int b); // calc bounding box and sets leftX,rightX,topY and bottomY to their values void CalcBBox(bool strict_degree = false); // debug function: plots the graph (mac only) void Plot(double ix, double iy, double ir, double mx, double my, bool doPoint, - bool edgesNo, bool pointNo, bool doDir, char *fileName); + bool edgesNo, bool pointNo, bool doDir, char *fileName); // transforms a polygon in a "forme" structure, ie a set of contours, which can be holes (see ShapeUtils.h) // return NULL in case it's not possible @@ -246,7 +246,7 @@ public: void ConvertToForme(Path *dest, int nbP, Path **orig, bool splitWhenForced = false); // version trying to recover the nesting of subpaths (ie: holes) void ConvertToFormeNested(Path *dest, int nbP, Path **orig, int wildPath, int &nbNest, - int *&nesting, int *&contStart, bool splitWhenForced = false); + int *&nesting, int *&contStart, bool splitWhenForced = false); // sweeping a digraph to produce a intersection-free polygon // return 0 if everything is ok and a return code otherwise (see LivarotDefs.h) @@ -255,29 +255,29 @@ public: int ConvertToShape(Shape *a, FillRule directed = fill_nonZero, bool invert = false); // directed=false <=> even-odd fill rule // invert=true: make as if you inverted all edges in the source - int Reoriente(Shape *a); // subcase of ConvertToShape: the input a is already intersection-free + int Reoriente(Shape *a); // subcase of ConvertToShape: the input a is already intersection-free // all that's missing are the correct directions of the edges // Reoriented is equivalent to ConvertToShape(a,false,false) , but faster sicne // it doesn't computes interections nor adjacencies - void ForceToPolygon(); // force the Shape to believe it's a polygon (eulerian+intersection-free+no + void ForceToPolygon(); // force the Shape to believe it's a polygon (eulerian+intersection-free+no // duplicate edges+no duplicate points) // be careful when using this function // the coordinate rounding function inline static double Round(double x) { - return ldexp(rint(ldexp(x, 5)), -5); + return ldexp(rint(ldexp(x, 5)), -5); } // 2 miscannellous variations on it, to scale to and back the rounding grid inline static double HalfRound(double x) { - return ldexp(x, -5); + return ldexp(x, -5); } inline static double IHalfRound(double x) { - return ldexp(x, 5); + return ldexp(x, 5); } // boolean operations on polygons (requests intersection-free poylygons) @@ -341,20 +341,20 @@ public: // topological information: who links who? struct dg_point { - Geom::Point x; // position - int dI, dO; // indegree and outdegree + Geom::Point x; // position + int dI, dO; // indegree and outdegree int incidentEdge[2]; // first and last incident edge - int oldDegree; - - int totalDegree() const { return dI + dO; } + int oldDegree; + + int totalDegree() const { return dI + dO; } }; struct dg_arete { - Geom::Point dx; // edge vector - int st, en; // start and end points of the edge - int nextS, prevS; // next and previous edge in the double-linked list at the start point - int nextE, prevE; // next and previous edge in the double-linked list at the end point + Geom::Point dx; // edge vector + int st, en; // start and end points of the edge + int nextS, prevS; // next and previous edge in the double-linked list at the start point + int nextE, prevE; // next and previous edge in the double-linked list at the end point }; // lists of the nodes and edges @@ -386,68 +386,68 @@ private: // temporary data for the various algorithms struct edge_data { - int weight; // weight of the edge (to handle multiple edges) - Geom::Point rdx; // rounded edge vector - double length, sqlength, ilength, isqlength; // length^2, length, 1/length^2, 1/length - double siEd, coEd; // siEd=abs(rdy/length) and coEd=rdx/length - edge_data() : weight(0), length(0.0), sqlength(0.0), ilength(0.0), isqlength(0.0), siEd(0.0), coEd(0.0) {} - // used to determine the "most horizontal" edge between 2 edges + int weight; // weight of the edge (to handle multiple edges) + Geom::Point rdx; // rounded edge vector + double length, sqlength, ilength, isqlength; // length^2, length, 1/length^2, 1/length + double siEd, coEd; // siEd=abs(rdy/length) and coEd=rdx/length + edge_data() : weight(0), length(0.0), sqlength(0.0), ilength(0.0), isqlength(0.0), siEd(0.0), coEd(0.0) {} + // used to determine the "most horizontal" edge between 2 edges }; struct sweep_src_data { - void *misc; // pointer to the SweepTree* in the sweepline - int firstLinkedPoint; // not used - int stPt, enPt; // start- end end- points for this edge in the resulting polygon - int ind; // for the GetAdjacencies function: index in the sliceSegs array (for quick deletions) - int leftRnd, rightRnd; // leftmost and rightmost points (in the result polygon) that are incident to - // the edge, for the current sweep position - // not set if the edge doesn't start/end or intersect at the current sweep position - Shape *nextSh; // nextSh and nextBo identify the next edge in the list - int nextBo; // they are used to maintain a linked list of edge that start/end or intersect at - // the current sweep position - int curPoint, doneTo; - double curT; + void *misc; // pointer to the SweepTree* in the sweepline + int firstLinkedPoint; // not used + int stPt, enPt; // start- end end- points for this edge in the resulting polygon + int ind; // for the GetAdjacencies function: index in the sliceSegs array (for quick deletions) + int leftRnd, rightRnd; // leftmost and rightmost points (in the result polygon) that are incident to + // the edge, for the current sweep position + // not set if the edge doesn't start/end or intersect at the current sweep position + Shape *nextSh; // nextSh and nextBo identify the next edge in the list + int nextBo; // they are used to maintain a linked list of edge that start/end or intersect at + // the current sweep position + int curPoint, doneTo; + double curT; }; struct sweep_dest_data { - void *misc; // used to check if an edge has already been seen during the depth-first search - int suivParc, precParc; // previous and current next edge in the depth-first search - int leW, riW; // left and right winding numbers for this edge - int ind; // order of the edges during the depth-first search + void *misc; // used to check if an edge has already been seen during the depth-first search + int suivParc, precParc; // previous and current next edge in the depth-first search + int leW, riW; // left and right winding numbers for this edge + int ind; // order of the edges during the depth-first search }; struct raster_data { - SweepTree *misc; // pointer to the associated SweepTree* in the sweepline - double lastX, lastY, curX, curY; // curX;curY is the current intersection of the edge with the sweepline - // lastX;lastY is the intersection with the previous sweepline - bool sens; // true if the edge goes down, false otherwise - double calcX; // horizontal position of the intersection of the edge with the - // previous sweepline - double dxdy, dydx; // horizontal change per unit vertical move of the intersection with the sweepline - int guess; + SweepTree *misc; // pointer to the associated SweepTree* in the sweepline + double lastX, lastY, curX, curY; // curX;curY is the current intersection of the edge with the sweepline + // lastX;lastY is the intersection with the previous sweepline + bool sens; // true if the edge goes down, false otherwise + double calcX; // horizontal position of the intersection of the edge with the + // previous sweepline + double dxdy, dydx; // horizontal change per unit vertical move of the intersection with the sweepline + int guess; }; struct point_data { - int oldInd, newInd; // back and forth indices used when sorting the points, to know where they have - // been relocated in the array - int pending; // number of intersection attached to this edge, and also used when sorting arrays - int edgeOnLeft; // not used (should help speeding up winding calculations) - int nextLinkedPoint; // not used - Shape *askForWindingS; - int askForWindingB; - Geom::Point rx; // rounded coordinates of the point + int oldInd, newInd; // back and forth indices used when sorting the points, to know where they have + // been relocated in the array + int pending; // number of intersection attached to this edge, and also used when sorting arrays + int edgeOnLeft; // not used (should help speeding up winding calculations) + int nextLinkedPoint; // not used + Shape *askForWindingS; + int askForWindingB; + Geom::Point rx; // rounded coordinates of the point }; struct edge_list - { // temporary array of edges for easier sorting - int no; - bool starting; - Geom::Point x; + { // temporary array of edges for easier sorting + int no; + bool starting; + Geom::Point x; }; void initialisePointData(); @@ -470,27 +470,27 @@ private: void SortPointsByOldInd(int s, int e); // fonctions annexes pour ConvertToShape et Booleen - void ResetSweep(); // allocates sweep structures - void CleanupSweep(); // deallocates them + void ResetSweep(); // allocates sweep structures + void CleanupSweep(); // deallocates them // edge sorting function void SortEdgesList(edge_list *edges, int s, int e); - void TesteIntersection(SweepTree *t, Side s, bool onlyDiff); // test if there is an intersection + void TesteIntersection(SweepTree *t, Side s, bool onlyDiff); // test if there is an intersection bool TesteIntersection(SweepTree *iL, SweepTree *iR, Geom::Point &atx, double &atL, double &atR, bool onlyDiff); bool TesteIntersection(Shape *iL, Shape *iR, int ilb, int irb, - Geom::Point &atx, double &atL, double &atR, - bool onlyDiff); + Geom::Point &atx, double &atL, double &atR, + bool onlyDiff); bool TesteAdjacency(Shape *iL, int ilb, const Geom::Point atx, int nPt, - bool push); + bool push); int PushIncidence(Shape *a, int cb, int pt, double theta); int CreateIncidence(Shape *a, int cb, int pt); void AssemblePoints(Shape *a); int AssemblePoints(int st, int en); void AssembleAretes(FillRule directed = fill_nonZero); void AddChgt(int lastPointNo, int lastChgtPt, Shape *&shapeHead, - int &edgeHead, sTreeChangeType type, Shape *lS, int lB, Shape *rS, - int rB); + int &edgeHead, sTreeChangeType type, Shape *lS, int lB, Shape *rS, + int rB); void CheckAdjacencies(int lastPointNo, int lastChgtPt, Shape *shapeHead, int edgeHead); void CheckEdges(int lastPointNo, int lastChgtPt, Shape *a, Shape *b, BooleanOp mod); void Avance(int lastPointNo, int lastChgtPt, Shape *iS, int iB, Shape *a, Shape *b, BooleanOp mod); @@ -513,14 +513,14 @@ private: void AvanceEdge(int no, float to, AlphaLigne *line, bool exact, float step); void AddContour(Path * dest, int nbP, Path **orig, int startBord, - int curBord, bool splitWhenForced); + int curBord, bool splitWhenForced); int ReFormeLineTo(int bord, int curBord, Path *dest, Path *orig); int ReFormeArcTo(int bord, int curBord, Path *dest, Path *orig); int ReFormeCubicTo(int bord, int curBord, Path *dest, Path *orig); int ReFormeBezierTo(int bord, int curBord, Path *dest, Path *orig); void ReFormeBezierChunk(const Geom::Point px, const Geom::Point nx, - Path *dest, int inBezier, int nbInterm, - Path *from, int p, double ts, double te); + Path *dest, int inBezier, int nbInterm, + Path *from, int p, double ts, double te); int QuickRasterChgEdge(int oBord, int nbord, double x); int QuickRasterAddEdge(int bord, double x, int guess); @@ -554,11 +554,11 @@ private: std::vector pData; static int CmpQRs(const quick_raster_data &p1, const quick_raster_data &p2) { - if ( fabs(p1.x - p2.x) < 0.00001 ) { - return 0; - } - - return ( ( p1.x < p2.x ) ? -1 : 1 ); + if ( fabs(p1.x - p2.x) < 0.00001 ) { + return 0; + } + + return ( ( p1.x < p2.x ) ? -1 : 1 ); }; // edge direction comparison function diff --git a/src/widgets/icon.cpp b/src/widgets/icon.cpp index 743502d27..5d91d3532 100644 --- a/src/widgets/icon.cpp +++ b/src/widgets/icon.cpp @@ -1115,6 +1115,26 @@ static guchar *load_svg_pixels(gchar const *name, /* Create ArenaItem and set transform */ unsigned visionkey = sp_item_display_key_new(1); /* fixme: Memory manage root if needed (Lauris) */ + // This needs to be fixed indeed; this leads to a memory leak of a few megabytes these days + // because shapes are being rendered which are not being freed + // Valgrind output: + /*==7014== 1,548,344 bytes in 599 blocks are possibly lost in loss record 20,361 of 20,362 + ==7014== at 0x4A05974: operator new(unsigned long) (vg_replace_malloc.c:220) + ==7014== by 0x4F1015: __gnu_cxx::new_allocator::allocate(unsigned long, void const*) (new_allocator.h:89) + ==7014== by 0x4F02AC: std::_Vector_base >::_M_allocate(unsigned long) (stl_vector.h:140) + ==7014== by 0xCF62D7: std::vector >::_M_fill_insert(__gnu_cxx::__normal_iterator > >, unsigned long, Shape::point_data const&) (vector.tcc:414) + ==7014== by 0xCF4D45: std::vector >::insert(__gnu_cxx::__normal_iterator > >, unsigned long, Shape::point_data const&) (stl_vector.h:851) + ==7014== by 0xCF3DCD: std::vector >::resize(unsigned long, Shape::point_data) (stl_vector.h:557) + ==7014== by 0xCEA771: Shape::AddPoint(Geom::Point) (Shape.cpp:326) + ==7014== by 0xD0F413: Shape::ConvertToShape(Shape*, fill_typ, bool) (ShapeSweep.cpp:257) + ==7014== by 0x5ECD4F: nr_arena_shape_update_stroke(NRArenaShape*, NRGC*, NRRectL*) (nr-arena-shape.cpp:651) + ==7014== by 0x5EE0DA: nr_arena_shape_render(_cairo*, NRArenaItem*, NRRectL*, NRPixBlock*, unsigned int) (nr-arena-shape.cpp:862) + ==7014== by 0x5E72FB: nr_arena_item_invoke_render(_cairo*, NRArenaItem*, NRRectL const*, NRPixBlock*, unsigned int) (nr-arena-item.cpp:578) + ==7014== by 0x5E9DDE: nr_arena_group_render(_cairo*, NRArenaItem*, NRRectL*, NRPixBlock*, unsigned int) (nr-arena-group.cpp:228) + ==7014== by 0x5E72FB: nr_arena_item_invoke_render(_cairo*, NRArenaItem*, NRRectL const*, NRPixBlock*, unsigned int) (nr-arena-item.cpp:578) + ==7014== by 0x5E9DDE: nr_arena_group_render(_cairo*, NRArenaItem*, NRRectL*, NRPixBlock*, unsigned int) (nr-arena-group.cpp:228) + ==7014== by 0x5E72FB: nr_arena_item_invoke_render(_cairo*, NRArenaItem*, NRRectL const*, NRPixBlock*, unsigned int) (nr-arena-item.cpp:578) + */ root = sp_item_invoke_show( SP_ITEM(SP_DOCUMENT_ROOT(doc)), arena, visionkey, SP_ITEM_SHOW_DISPLAY );