Searched refs:cpts (Results 1 - 9 of 9) sorted by relevance

/inkscape/src/2geom/
H A Dconic_section_clipper_impl.cpp50 std::vector<Point> cpts; local
76 cpts.push_back (P);
78 if (cpts.size() == 2 && are_near (cpts[0], cpts[1]))
80 cpts[0] = middle_point (cpts[0], cpts[1]);
81 cpts.pop_back();
105 cpts
[all...]
/inkscape/src/libuemf/
H A Duemf.c2870 CORE6(uint32_t iType, U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points){ (16bit form of CORE1)
2874 CORE10(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points){ (16bit form of CORE2)
2970 char *U_EMR_CORE6_set(uint32_t iType, U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points){ argument
2975 cbPoints = sizeof(U_POINT16)*cpts;
2984 ((PU_EMRPOLYBEZIER16) record)->cpts = cpts;
3076 char *U_EMR_CORE10_set(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points){ argument
3082 cbPoints = sizeof(U_POINT16)*cpts;
3090 ((PU_EMRPOLYPOLYLINE16) record)->cpts = cpts;
4998 U_EMRPOLYBEZIER16_set( const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points ) argument
5014 U_EMRPOLYGON16_set( const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points ) argument
5030 U_EMRPOLYLINE16_set( const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points ) argument
5046 U_EMRPOLYBEZIERTO16_set( const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points ) argument
5062 U_EMRPOLYLINETO16_set( const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points ) argument
5080 U_EMRPOLYPOLYLINE16_set( const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts, const uint32_t cpts, const U_POINT16 *points ) argument
5100 U_EMRPOLYPOLYGON16_set( const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts, const uint32_t cpts, const U_POINT16 *points ) argument
5120 U_EMRPOLYDRAW16_set( const U_RECTL rclBounds, const U_NUM_POINT16 cpts, const U_POINT16 *aptl, const uint8_t *abTypes ) argument
[all...]
H A Duemf_print.c752 printf(" cpts: %d\n",pEmr->cpts );
755 IF_MEM_UNSAFE_PRINT_AND_RETURN(papts, pEmr->cpts*sizeof(U_POINT16), blimit);
756 for(i=0; i<pEmr->cpts; i++){
822 printf(" cpts: %d\n",pEmr->cpts );
831 IF_MEM_UNSAFE_PRINT_AND_RETURN(papts, pEmr->cpts*sizeof(U_POINT16), blimit);
832 for(i=0; i<pEmr->cpts; i++){
2233 printf(" cpts: %d\n",pEmr->cpts );
[all...]
H A Duemf.h2942 U_NUM_POINT16 cpts; //!< Number of POINT16 in array member in struct:__anon202
2969 U_NUM_POINT16 cpts; //!< Total number of points (over all poly) member in struct:__anon203
2988 U_NUM_POINT16 cpts; //!< Total number of points (over all poly) member in struct:__anon204
3582 char *U_EMRPOLYBEZIER16_set(const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points);
3583 char *U_EMRPOLYGON16_set(const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points);
3584 char *U_EMRPOLYLINE16_set(const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points);
3585 char *U_EMRPOLYBEZIERTO16_set(const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points);
3586 char *U_EMRPOLYLINETO16_set(const U_RECTL rclBounds, const uint32_t cpts, const U_POINT16 *points);
3587 char *U_EMRPOLYPOLYLINE16_set(const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points);
3588 char *U_EMRPOLYPOLYGON16_set(const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, cons
[all...]
H A Duemf_endian.c599 count = pEmr->cpts;
604 U_swap4(&(pEmr->cpts),1); // cpts
606 count = pEmr->cpts;
657 count = pEmr->cpts;
663 U_swap4(&(pEmr->nPolys),2); // nPolys cpts
665 count = pEmr->cpts;
1710 count = pEmr->cpts;
1715 U_swap4(&(pEmr->cpts),1); // cpts
[all...]
H A Duemf_safe.c236 int count=pEmr->cpts;
268 int count = pEmr->cpts;
905 int count = pEmr->cpts;
/inkscape/src/live_effects/
H A Dlpe-knot.cpp290 idx_of_nearest(CrossingPoints const &cpts, Geom::Point const &p) argument
293 unsigned result = cpts.size();
294 for (unsigned k=0; k<cpts.size(); k++){
295 double dist_k = Geom::L2(p-cpts[k].pt);
/inkscape/src/extension/internal/
H A Demf-inout.cpp3231 if (pEmr->cpts<4)
3238 for (i=1; i<pEmr->cpts; ) {
3240 for (j=0; j<3 && i<pEmr->cpts; j++,i++) {
3264 for (i=first+1; i<pEmr->cpts; i++) {
3282 if (pEmr->cpts<2)
3289 for (i=1; i<pEmr->cpts; i++) {
3307 for (i=0; i<pEmr->cpts;) {
3309 for (j=0; j<3 && i<pEmr->cpts; j++,i++) {
3326 for (i=0; i<pEmr->cpts;i++) {
3348 for (n=0; n<pEmr->nPolys && i<pEmr->cpts;
[all...]
H A Dwmf-inout.cpp2667 int cpts; /* total number of points in Points*/ local
2674 for (n=cpts=0; n < nPolys; n++) { cpts += aPolyCounts[n]; }
2676 cpts *= U_SIZE_POINT16; // limit for offset i, in BYTES
2678 for (n=0; n < nPolys && i<cpts; n++) {
2686 for (j=1; j < aPolyCounts[n] && i < cpts; j++) {

Completed in 524 milliseconds