icon/shape/VectorPath.cpp

55 		path.move_to(points[0].point.x, points[0].point.y);
60 				points[i].point.x, points[i].point.y);
63 			// curve from last to first control point
67 				points[0].point.x, points[0].point.y);
146 	if (archive->GetInfo("point", &typeFound, &countFound) >= B_OK
151 		BPoint point;
156 				&& archive->FindPoint("point", i, &point) >= B_OK
157 				&& archive->FindPoint("point in", i, &pointIn) >= B_OK
158 				&& archive->FindPoint("point out", i, &pointOut) >= B_OK
160 			fPath[i].point = point;
246 		ret = into->AddData("point", B_POINT_TYPE, &fPath[0].point,
249 			ret = into->AddData("point in", B_POINT_TYPE, &fPath[0].point_in,
253 			ret = into->AddData("point out", B_POINT_TYPE, &fPath[0].point_out,
263 			ret = into->AddData("point", B_POINT_TYPE, &fPath[i].point,
266 				ret = into->AddData("point in", B_POINT_TYPE, &fPath[i].point_in,
270 				ret = into->AddData("point out", B_POINT_TYPE,
337 		if (fPath[i].point != other.fPath[i].point
360 VectorPath::AddPoint(BPoint point)
365 		_SetPoint(index, point);
375 VectorPath::AddPoint(const BPoint& point, const BPoint& pointIn,
381 		_SetPoint(index, point, pointIn, pointOut, connected);
391 VectorPath::AddPoint(BPoint point, int32 index)
402 				fPath[i].point = fPath[i - 1].point;
408 		_SetPoint(index, point);
423 				fPath[i].point = fPath[i + 1].point;
441 VectorPath::SetPoint(int32 index, BPoint point)
446 		BPoint offset = point - fPath[index].point;
447 		fPath[index].point = point;
461 VectorPath::SetPoint(int32 index, BPoint point, BPoint pointIn, BPoint pointOut,
467 		fPath[index].point = point;
482 VectorPath::SetPointIn(int32 i, BPoint point)
487 		// first, set the "in" point
488 		fPath[i].point_in = point;
489 		// now see what to do about the "out" point
492 			BPoint v = fPath[i].point - fPath[i].point_in;
496 					fPath[i].point.x, fPath[i].point.y,
515 VectorPath::SetPointOut(int32 i, BPoint point, bool mirrorDist)
520 		// first, set the "out" point
521 		fPath[i].point_out = point;
522 		// now see what to do about the "out" point
524 			// mirror "in" point around main control point
525 			BPoint v = fPath[i].point - fPath[i].point_out;
526 			fPath[i].point_in = fPath[i].point + v;
529 			BPoint v = fPath[i].point - fPath[i].point_out;
533 					fPath[i].point.x, fPath[i].point.y,
567 VectorPath::GetPointAt(int32 index, BPoint& point) const
572 		point = fPath[index].point;
580 VectorPath::GetPointInAt(int32 index, BPoint& point) const
585 		point = fPath[index].point_in;
593 VectorPath::GetPointOutAt(int32 index, BPoint& point) const
598 		point = fPath[index].point_out;
606 VectorPath::GetPointsAt(int32 index, BPoint& point, BPoint& pointIn,
610 		point = fPath[index].point;
646 		// first figure out if point is between segment start and end points
683 			float segDist = distance_to_curve(p, fPath[i].point,
684 				fPath[i].point_out, fPath[i + 1].point_in, fPath[i + 1].point);
691 			float segDist = distance_to_curve(p, fPath[fPointCount - 1].point,
693 				fPath[0].point);
706 VectorPath::FindBezierScale(int32 index, BPoint point, double* scale) const
723 				point.x, point.y);
737 VectorPath::GetPoint(int32 index, double t, BPoint& point) const
746 			point.x = fPath[index].point.x * t1 + fPath[index].point_out.x * t2
748 				+ fPath[index + 1].point.x * t4;
750 			point.y = fPath[index].point.y * t1 + fPath[index].point_out.y * t2
752 				+ fPath[index + 1].point.y * t4;
754 			point.x = fPath[fPointCount - 1].point.x * t1
756 				+ fPath[0].point_in.x * t3 + fPath[0].point.x * t4;
758 			point.y = fPath[fPointCount - 1].point.y * t1
760 				+ fPath[0].point_in.y * t3 + fPath[0].point.y * t4;
809 		b.Set(fPath[0].point.x, fPath[0].point.y, fPath[0].point.x,
810 			fPath[0].point.y);
822 		BRect r(fPath[0].point, fPath[0].point);
824 			// include point
825 			r.left = min_c(r.left, fPath[i].point.x);
826 			r.top = min_c(r.top, fPath[i].point.y);
827 			r.right = max_c(r.right, fPath[i].point.x);
828 			r.bottom = max_c(r.bottom, fPath[i].point.y);
829 			// include "in" point
834 			// include "out" point
856 			iterator->MoveTo(fPath[i].point);
857 			curve.init(fPath[i].point.x, fPath[i].point.y,
860 				fPath[i + 1].point.x, fPath[i + 1].point.y);
871 			iterator->MoveTo(fPath[fPointCount - 1].point);
872 			curve.init(fPath[fPointCount - 1].point.x,
873 				fPath[fPointCount - 1].point.y,
877 				fPath[0].point.x, fPath[0].point.y);
899 	// remove last point if it is coincident with the first
901 		if (fPath[0].point == fPath[fPointCount - 1].point) {
911 			if (fPath[i - 1].point == fPath[i].point
912 				&& fPath[i - 1].point == fPath[i - 1].point_out
913 				&& fPath[i].point == fPath[i].point_in) {
914 				// the previous point can be removed
924 		// they line up with the main control point
926 			|| fPath[i].point == fPath[i].point_out
927 			|| fPath[i].point == fPath[i].point_in
929 					fPath[i].point_in.y, fPath[i].point.x, fPath[i].point.y,
932 					fPath[i].point_out.y, fPath[i].point.x, fPath[i].point.y,
950 		temp.SetPoint(index, fPath[i].point, fPath[i].point_out,
967 		transform.Transform(&(fPath[i].point));
980 		printf("point %" B_PRId32 ": (%f, %f) -> (%f, %f) -> (%f, %f) (%d)\n", i,
982 			fPath[i].point.x, fPath[i].point.y,
1036 VectorPath::_SetPoint(int32 index, BPoint point)
1038 	fPath[index].point = point;
1039 	fPath[index].point_in = point;
1040 	fPath[index].point_out = point;
1049 VectorPath::_SetPoint(int32 index, const BPoint& point, const BPoint& pointIn,
1052 	fPath[index].point = point;
1082 	// update point count