| /haiku/src/tests/kits/interface/bpolygon/ |
| H A D | CreatePolygonTest.cpp | 57 void CreatePolygonTest::polygonMatches(BPolygon *srcPoly, const BPoint *pointArray, argument
66 assert(srcPointArray[i] == pointArray[i]);
96 BPoint pointArray[numPoints]; local
97 pointArray[0].x = 0.0; pointArray[0].y = 10.0;
98 pointArray[1].x = 10.0; pointArray[1].y = 0.0;
99 pointArray[2].x = 10.0; pointArray[2].y = 5.0;
100 pointArray[
[all...] |
| H A D | MapPolygonTest.cpp | 50 void MapPolygonTest::polygonMatches(BPolygon *srcPoly, const BPoint *pointArray, argument
59 assert(srcPointArray[i] == pointArray[i]);
75 BPoint pointArray[numPoints]; local
76 pointArray[0].x = 0.0; pointArray[0].y = 10.0;
77 pointArray[1].x = 10.0; pointArray[1].y = 0.0;
78 pointArray[2].x = 10.0; pointArray[2].y = 5.0;
79 pointArray[
[all...] |
| /haiku/src/tests/kits/interface/bregion/ |
| H A D | RegionIntersect.cpp | 89 BPoint *pointArray; local
90 int numPoints = GetPointsInRect(tempRect, &pointArray);
92 assert(testRegionB->Contains(pointArray[j]));
93 if (testRegionA->Contains(pointArray[j])) {
94 assert(resultRegion->Contains(pointArray[j]));
96 assert(!resultRegion->Contains(pointArray[j]));
115 BPoint *pointArray; local
116 int numPoints = GetPointsInRect(tempRect, &pointArray);
118 assert(testRegionA->Contains(pointArray[j]));
119 if (testRegionB->Contains(pointArray[
144 BPoint *pointArray; local
[all...] |
| H A D | RegionExclude.cpp | 90 BPoint *pointArray; local
91 int numPoints = GetPointsInRect(tempRect, &pointArray);
93 assert(testRegionB->Contains(pointArray[j]));
94 assert(!resultRegion->Contains(pointArray[j]));
110 BPoint *pointArray; local
111 int numPoints = GetPointsInRect(tempRect, &pointArray);
113 assert(testRegionA->Contains(pointArray[j]));
114 if (testRegionB->Contains(pointArray[j])) {
115 assert(!resultRegion->Contains(pointArray[j]));
117 assert(resultRegion->Contains(pointArray[
136 BPoint *pointArray; local
[all...] |
| H A D | RegionInclude.cpp | 84 BPoint *pointArray; local
85 int numPoints = GetPointsInRect(tempRect, &pointArray);
87 assert(testRegionB->Contains(pointArray[j]));
88 assert(resultRegion->Contains(pointArray[j]));
102 BPoint *pointArray; local
103 int numPoints = GetPointsInRect(tempRect, &pointArray);
105 assert(testRegionA->Contains(pointArray[j]));
106 assert(resultRegion->Contains(pointArray[j]));
122 BPoint *pointArray; local
123 int numPoints = GetPointsInRect(tempRect, &pointArray);
[all...] |
| H A D | RegionTestcase.h | 30 BPoint pointArray[numPointsPerSide * numPointsPerSide]; member in class:RegionTestcase
|
| H A D | RegionTestcase.cpp | 125 *pointArrayPtr = pointArray;
145 pointArray[numPoints].Set(floor(xCoord), floor(yCoord));
146 assert(theRect.Contains(pointArray[numPoints]));
|
| /haiku/src/tests/kits/interface/flatten_picture/ |
| H A D | PictureTestCases.cpp | 89 BPoint pointArray[] = { local
97 for (size_t i = 1; i < (sizeof(pointArray) / sizeof(pointArray[0])); i++)
98 pointArray[i] = pointArray[i - 1] + BPoint(10, 0);
100 view->DrawString("Haiku", pointArray, sizeof(pointArray) / sizeof(pointArray[0]));
|
| /haiku/headers/os/interface/ |
| H A D | View.h | 357 void StrokePolygon(const BPoint* pointArray,
360 void StrokePolygon(const BPoint* pointArray,
366 void FillPolygon(const BPoint* pointArray,
369 void FillPolygon(const BPoint* pointArray,
374 void FillPolygon(const BPoint* pointArray,
376 void FillPolygon(const BPoint* pointArray,
|
| /haiku/src/kits/interface/ |
| H A D | View.cpp | 3562 BView::StrokePolygon(const BPoint* pointArray, int32 numPoints, bool closed, argument
3565 BPolygon polygon(pointArray, numPoints);
3573 BView::StrokePolygon(const BPoint* pointArray, int32 numPoints, BRect bounds, argument
3576 if (pointArray == NULL
3584 BPolygon polygon(pointArray, numPoints);
3655 BView::FillPolygon(const BPoint* pointArray, int32 numPoints, ::pattern pattern) argument
3657 if (pointArray == NULL)
3660 BPolygon polygon(pointArray, numPoints);
3666 BView::FillPolygon(const BPoint* pointArray, int32 numPoints, argument
3669 if (pointArray
3678 FillPolygon(const BPoint* pointArray, int32 numPoints, BRect bounds, ::pattern pattern) argument
3692 FillPolygon(const BPoint* pointArray, int32 numPoints, BRect bounds, const BGradient& gradient) argument
[all...] |