equal
deleted
inserted
replaced
492 d->activeStroker->lineTo(path.points()[0], path.points()[1]); |
492 d->activeStroker->lineTo(path.points()[0], path.points()[1]); |
493 |
493 |
494 } else { |
494 } else { |
495 d->activeStroker->moveTo(points[0], points[1]); |
495 d->activeStroker->moveTo(points[0], points[1]); |
496 points += 2; |
496 points += 2; |
497 ++types; |
|
498 while (points < lastPoint) { |
497 while (points < lastPoint) { |
499 d->activeStroker->lineTo(points[0], points[1]); |
498 d->activeStroker->lineTo(points[0], points[1]); |
500 points += 2; |
499 points += 2; |
501 ++types; |
|
502 } |
500 } |
503 if (path.hasImplicitClose()) |
501 if (path.hasImplicitClose()) |
504 d->activeStroker->lineTo(path.points()[0], path.points()[1]); |
502 d->activeStroker->lineTo(path.points()[0], path.points()[1]); |
505 } |
503 } |
506 d->activeStroker->end(); |
504 d->activeStroker->end(); |
559 |
557 |
560 } else { |
558 } else { |
561 QPointF p = ((QPointF *)points)[0] * state()->matrix; |
559 QPointF p = ((QPointF *)points)[0] * state()->matrix; |
562 d->activeStroker->moveTo(p.x(), p.y()); |
560 d->activeStroker->moveTo(p.x(), p.y()); |
563 points += 2; |
561 points += 2; |
564 ++types; |
|
565 while (points < lastPoint) { |
562 while (points < lastPoint) { |
566 QPointF p = ((QPointF *)points)[0] * state()->matrix; |
563 QPointF p = ((QPointF *)points)[0] * state()->matrix; |
567 d->activeStroker->lineTo(p.x(), p.y()); |
564 d->activeStroker->lineTo(p.x(), p.y()); |
568 points += 2; |
565 points += 2; |
569 ++types; |
|
570 } |
566 } |
571 if (path.hasImplicitClose()) |
567 if (path.hasImplicitClose()) |
572 d->activeStroker->lineTo(p.x(), p.y()); |
568 d->activeStroker->lineTo(p.x(), p.y()); |
573 } |
569 } |
574 d->activeStroker->end(); |
570 d->activeStroker->end(); |