Searched refs:swap (Results 1 - 25 of 48) sorted by relevance

12

/inkscape/src/2geom/
H A D	intersection.h	76 friend inline void swap(Intersection &a, Intersection &b) { function in class:Geom::Intersection 77 using std::swap; 78 swap(a.first, b.first); 79 swap(a.second, b.second); 80 swap(a._point, b._point); 128 std::swap(xs[i].first, xs[i].second);
H A D	interval.h	146 using std::swap; 149 if(s < 0) swap(_b[0], _b[1]); 154 using std::swap; 157 if(s < 0) swap(_b[0], _b[1]);
H A D	convex-hull.cpp	58 using std::swap; 135 std::swap(_boundary[k++], _boundary[i]); 145 std::swap(_boundary[k++], _boundary[i]); 274 void ConvexHull::swap(ConvexHull &other) function in class:Geom::ConvexHull 276 _boundary.swap(other._boundary); 277 std::swap(_lower, other._lower); 280 void ConvexHull::swap(std::vector<Point> &pts) function in class:Geom::ConvexHull 282 _boundary.swap(pts); 601 // In other words, either of the two polygons vertices are added in order until the vertex coincides with a bridge point, at which point we swap. 631 swap( [all...]
H A D	line.cpp	333 using std::swap; 344 swap(crossing->ta, crossing->tb); 361 using std::swap; 376 swap((*crossing).ta, (*crossing).tb); 393 using std::swap; 410 swap(crossing->ta, crossing->tb);
H A D	nearest-time.cpp	108 if ( from > to ) std::swap(from, to); 148 std::swap(from, to); 196 if (from > to) std::swap(from, to); 247 std::swap(from, to);
H A D	toposweep.h	72 //swap from and to, since tp is left or above fp 73 using std::swap; 74 swap(f, t); 75 swap(fp, tp);
H A D	convex-hull.h	274 void swap(ConvexHull &other); 275 void swap(std::vector<Point> &pts);
H A D	path.h	394 void swap(Path &other) throw() { function in class:Geom::Path 395 using std::swap; 396 swap(other._data, _data); 397 swap(other._closing_seg, _closing_seg); 398 swap(other._closed, _closed); 399 swap(other._exception_on_stitch, _exception_on_stitch); 403 friend inline void swap(Path &a, Path &b) throw() { a.swap(b); } function in class:Geom::Path
H A D	elliptical-arc.cpp	330 using std::swap; 333 swap(rarc->_initial_point, rarc->_final_point); 342 if ( from > to ) std::swap(from, to); 826 using std::swap; 837 swap(ymin, ymax); 838 swap(ymin_a, ymax_a); 857 swap(ia, fa); 858 swap(ip, fp);
H A D	conic_section_clipper_impl.cpp	219 using std::swap; 263 swap(extrema[0], extrema[1]); 375 using std::swap; 460 if (rts[0] > rts[1]) swap (rts[0], rts[1]); 467 if (rts[0] > rts[1]) swap (rts[0], rts[1]);
H A D	angle.h	276 using std::swap; 277 swap(_start_angle, _end_angle);
H A D	geom.cpp	13 using std::swap; 317 swap(results[0], results[1]);
H A D	recursive-bezier-intersection.cpp	35 std::swap(minax, maxax); 46 std::swap(minay, maxay);
H A D	bezier-clipping.cpp	52 using std::swap; 403 p.swap(D); 638 p.swap(D); 865 swap(C1, C2); 866 swap(dom1, dom2); 1048 swap(C1, C2); 1049 swap(dom1, dom2);
H A D	line.h	207 std::swap(_initial, _final); 262 std::swap(_final, _initial); 352 std::swap(v[X], v[Y]);
H A D	bezier-curve.cpp	283 using std::swap; 285 if ( from > to ) swap(from, to);
/inkscape/src/2geom/numeric/
H A D	vector.h	42 #include <algorithm> // for std::swap 340 void swap(Vector & v1, Vector & v2); 349 void swap(Vector & v1, Vector & v2) function in namespace:Geom::NL 352 using std::swap; 353 swap(v1.m_vector, v2.m_vector); 359 using std::swap; 360 swap(v1.m_vector, v2.m_vector); 361 swap(v1.m_size, v2.m_size); 557 using std::swap; 558 swap(v [all...]
H A D	matrix.h	46 #include <algorithm> // for std::swap 424 void swap(Matrix & m1, Matrix & m2); 433 void swap(Matrix & m1, Matrix & m2) function in namespace:Geom::NL 436 using std::swap; 437 swap(m1.m_matrix, m2.m_matrix); 442 using std::swap; 443 swap(m1.m_matrix, m2.m_matrix); 444 swap(m1.m_rows, m2.m_rows); 445 swap(m1.m_columns, m2.m_columns); 574 using std::swap; [all...]
/inkscape/src/livarot/
H A D	sweep-tree.cpp	502 Shape *swap = tL->src; local 504 tR->src = swap; 507 int swap = tL->bord; local 509 tR->bord = swap; 512 int swap = tL->startPoint; local 514 tR->startPoint = swap; 516 //{double swap=tL->invDirLength;tL->invDirLength=tR->invDirLength;tR->invDirLength=swap;} 518 bool swap = tL->sens; local 520 tR->sens = swap; [all...]
H A D	Shape.cpp	507 dg_point swap = getPoint(a); local 509 _pts[b] = swap; 1432 dg_arete swap = getEdge(a); local 1434 _aretes[b] = swap; 1705 edge_list swap = list[s]; local 1707 list[e] = swap; 1730 edge_list swap = list[le]; local 1733 list[ppos] = swap; 1766 edge_list swap = list[ri]; local 1769 list[plast] = swap; 1797 edge_list swap = list[le]; local 1805 edge_list swap = list[ppos - 1]; local 1814 edge_list swap = list[plast]; local 1829 edge_list swap = list[plast + 1]; local 1838 edge_list swap = list[ppos]; local 1985 int swap; local 2010 int swap = swdData[b].leW; local [all...]
/inkscape/src/util/
H A D	list-container.h	40 void swap(ListContainer<T> &other) { function in class:Inkscape::Util::ListContainer 41 std::swap(other._head, _head); 42 std::swap(other._tail, _tail);
/inkscape/src/libvpsc/
H A D	blocks.cpp	94 std::swap(l, r); 125 std::swap(l, r);
/inkscape/src/
H A D	splivarot.cpp	197 Path* swap=originaux[0];originaux[0]=originaux[1];originaux[1]=swap; local 224 Path* swap=originaux[0];originaux[0]=originaux[1];originaux[1]=swap; local 292 // pour compenser le swap juste avant 450 using std::swap; 451 swap(originaux[0], originaux[1]); 452 swap(origWind[0], origWind[1]); 503 // We might need to do a swap. Apply the above rules depending on operation type. 509 Shape *swap local 517 Shape *swap = theShape; local 525 Shape *swap = theShape; local 548 Path* swap=originaux[0];originaux[0]=originaux[1];originaux[1]=swap; local 578 Path* swap=originaux[0];originaux[0]=originaux[1];originaux[1]=swap; local [all...]
/inkscape/src/display/
H A D	nr-filter-morphology.cpp	57 if (axis == Geom::Y) std::swap(w,h);
/inkscape/src/extension/internal/
H A D	cdr-input.cpp	218 std::swap(_previewArea, tmpPreviewArea);

Completed in 1436 milliseconds

12

Indexes created Tue Jul 24 14:28:13 CEST 2018