gdiplus: Implemented GdipAddPathBeziersI.
This commit is contained in:
parent
a41bf52bb8
commit
c282f248fa
|
@ -3,7 +3,7 @@
|
|||
@ stdcall GdipAddPathBezier(ptr long long long long long long long long)
|
||||
@ stdcall GdipAddPathBezierI(ptr long long long long long long long long)
|
||||
@ stdcall GdipAddPathBeziers(ptr ptr long)
|
||||
@ stub GdipAddPathBeziersI
|
||||
@ stdcall GdipAddPathBeziersI(ptr ptr long)
|
||||
@ stub GdipAddPathClosedCurve2
|
||||
@ stub GdipAddPathClosedCurve2I
|
||||
@ stub GdipAddPathClosedCurve
|
||||
|
|
|
@ -171,6 +171,31 @@ GpStatus WINGDIPAPI GdipAddPathBeziers(GpPath *path, GDIPCONST GpPointF *points,
|
|||
return Ok;
|
||||
}
|
||||
|
||||
GpStatus WINGDIPAPI GdipAddPathBeziersI(GpPath *path, GDIPCONST GpPoint *points,
|
||||
INT count)
|
||||
{
|
||||
GpPointF *ptsF;
|
||||
GpStatus ret;
|
||||
INT i;
|
||||
|
||||
if(!points || ((count - 1) % 3))
|
||||
return InvalidParameter;
|
||||
|
||||
ptsF = GdipAlloc(sizeof(GpPointF) * count);
|
||||
if(!ptsF)
|
||||
return OutOfMemory;
|
||||
|
||||
for(i = 0; i < count; i++){
|
||||
ptsF[i].X = (REAL)points[i].X;
|
||||
ptsF[i].Y = (REAL)points[i].Y;
|
||||
}
|
||||
|
||||
ret = GdipAddPathBeziers(path, ptsF, count);
|
||||
GdipFree(ptsF);
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
GpStatus WINGDIPAPI GdipAddPathEllipse(GpPath *path, REAL x, REAL y, REAL width,
|
||||
REAL height)
|
||||
{
|
||||
|
|
|
@ -194,6 +194,7 @@ GpStatus WINGDIPAPI GdipAddPathArcI(GpPath*,INT,INT,INT,INT,REAL,REAL);
|
|||
GpStatus WINGDIPAPI GdipAddPathBezier(GpPath*,REAL,REAL,REAL,REAL,REAL,REAL,REAL,REAL);
|
||||
GpStatus WINGDIPAPI GdipAddPathBezierI(GpPath*,INT,INT,INT,INT,INT,INT,INT,INT);
|
||||
GpStatus WINGDIPAPI GdipAddPathBeziers(GpPath*,GDIPCONST GpPointF*,INT);
|
||||
GpStatus WINGDIPAPI GdipAddPathBeziersI(GpPath*,GDIPCONST GpPoint*,INT);
|
||||
GpStatus WINGDIPAPI GdipAddPathEllipse(GpPath*,REAL,REAL,REAL,REAL);
|
||||
GpStatus WINGDIPAPI GdipAddPathEllipseI(GpPath*,INT,INT,INT,INT);
|
||||
GpStatus WINGDIPAPI GdipAddPathLine(GpPath*,REAL,REAL,REAL,REAL);
|
||||
|
|
Loading…
Reference in New Issue