| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/mlir/unittests/Analysis/ |
| H A D | PresburgerSetTest.cpp | 29 bool inS = s.containsPoint(point); in testUnionAtPoints()
30 bool inT = t.containsPoint(point); in testUnionAtPoints()
42 bool inS = s.containsPoint(point); in testIntersectAtPoints()
43 bool inT = t.containsPoint(point); in testIntersectAtPoints()
55 bool inS = s.containsPoint(point); in testSubtractAtPoints()
56 bool inT = t.containsPoint(point); in testSubtractAtPoints()
57 bool inDiff = diff.containsPoint(point); in testSubtractAtPoints()
72 bool inS = s.containsPoint(point); in testComplementAtPoints()
107 TEST(SetTest, containsPoint) { in TEST() argument
117 EXPECT_TRUE(setA.containsPoint({x})); in TEST()
[all …]
|
| /dports/science/simbody/simbody-Simbody-3.7/Simbody/tests/ |
| H A D | TestOrientedBoundingBox.cpp | 46 ASSERT(box.containsPoint(Vec3(0))); in testContainsPoint()
47 ASSERT(box.containsPoint(Vec3(1, 2, 3))); in testContainsPoint()
48 ASSERT(box.containsPoint(Vec3(0.5, 1.0, 1.5))); in testContainsPoint()
49 ASSERT(!box.containsPoint(Vec3(-0.5, 1.0, 1.5))); in testContainsPoint()
56 ASSERT(box.containsPoint(Vec3(3, 2, 1))); in testContainsPoint()
57 ASSERT(box.containsPoint(Vec3(4, 4, 4))); in testContainsPoint()
58 ASSERT(box.containsPoint(Vec3(3.5, 3.0, 2.5))); in testContainsPoint()
59 ASSERT(!box.containsPoint(Vec3(2.5, 3.0, 2.5))); in testContainsPoint()
60 ASSERT(!box.containsPoint(Vec3(4.5, 1.0, 2.5))); in testContainsPoint()
66 ASSERT(box.containsPoint(Vec3(0))); in testContainsPoint()
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/mlir/unittests/Analysis/ |
| H A D | PresburgerSetTest.cpp | 30 bool inS = s.containsPoint(point); in testUnionAtPoints()
31 bool inT = t.containsPoint(point); in testUnionAtPoints()
43 bool inS = s.containsPoint(point); in testIntersectAtPoints()
44 bool inT = t.containsPoint(point); in testIntersectAtPoints()
56 bool inS = s.containsPoint(point); in testSubtractAtPoints()
57 bool inT = t.containsPoint(point); in testSubtractAtPoints()
58 bool inDiff = diff.containsPoint(point); in testSubtractAtPoints()
73 bool inS = s.containsPoint(point); in testComplementAtPoints()
108 TEST(SetTest, containsPoint) { in TEST() argument
118 EXPECT_TRUE(setA.containsPoint({x})); in TEST()
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/unittests/Analysis/ |
| H A D | PresburgerSetTest.cpp | 30 bool inS = s.containsPoint(point); in testUnionAtPoints()
31 bool inT = t.containsPoint(point); in testUnionAtPoints()
43 bool inS = s.containsPoint(point); in testIntersectAtPoints()
44 bool inT = t.containsPoint(point); in testIntersectAtPoints()
56 bool inS = s.containsPoint(point); in testSubtractAtPoints()
57 bool inT = t.containsPoint(point); in testSubtractAtPoints()
58 bool inDiff = diff.containsPoint(point); in testSubtractAtPoints()
73 bool inS = s.containsPoint(point); in testComplementAtPoints()
108 TEST(SetTest, containsPoint) { in TEST() argument
118 EXPECT_TRUE(setA.containsPoint({x})); in TEST()
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/unittests/Analysis/ |
| H A D | PresburgerSetTest.cpp | 30 bool inS = s.containsPoint(point); in testUnionAtPoints()
31 bool inT = t.containsPoint(point); in testUnionAtPoints()
43 bool inS = s.containsPoint(point); in testIntersectAtPoints()
44 bool inT = t.containsPoint(point); in testIntersectAtPoints()
56 bool inS = s.containsPoint(point); in testSubtractAtPoints()
57 bool inT = t.containsPoint(point); in testSubtractAtPoints()
58 bool inDiff = diff.containsPoint(point); in testSubtractAtPoints()
73 bool inS = s.containsPoint(point); in testComplementAtPoints()
108 TEST(SetTest, containsPoint) { in TEST() argument
118 EXPECT_TRUE(setA.containsPoint({x})); in TEST()
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/mlir/unittests/Analysis/ |
| H A D | PresburgerSetTest.cpp | 30 bool inS = s.containsPoint(point); in testUnionAtPoints()
31 bool inT = t.containsPoint(point); in testUnionAtPoints()
43 bool inS = s.containsPoint(point); in testIntersectAtPoints()
44 bool inT = t.containsPoint(point); in testIntersectAtPoints()
56 bool inS = s.containsPoint(point); in testSubtractAtPoints()
57 bool inT = t.containsPoint(point); in testSubtractAtPoints()
58 bool inDiff = diff.containsPoint(point); in testSubtractAtPoints()
73 bool inS = s.containsPoint(point); in testComplementAtPoints()
108 TEST(SetTest, containsPoint) { in TEST() argument
118 EXPECT_TRUE(setA.containsPoint({x})); in TEST()
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/mlir/unittests/Analysis/ |
| H A D | PresburgerSetTest.cpp | 30 bool inS = s.containsPoint(point);
31 bool inT = t.containsPoint(point);
43 bool inS = s.containsPoint(point);
44 bool inT = t.containsPoint(point);
56 bool inS = s.containsPoint(point);
57 bool inT = t.containsPoint(point);
58 bool inDiff = diff.containsPoint(point);
73 bool inS = s.containsPoint(point);
108 TEST(SetTest, containsPoint) {
118 EXPECT_TRUE(setA.containsPoint({x}));
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/mlir/unittests/Analysis/ |
| H A D | PresburgerSetTest.cpp | 30 bool inS = s.containsPoint(point); in testUnionAtPoints()
31 bool inT = t.containsPoint(point); in testUnionAtPoints()
43 bool inS = s.containsPoint(point); in testIntersectAtPoints()
44 bool inT = t.containsPoint(point); in testIntersectAtPoints()
56 bool inS = s.containsPoint(point); in testSubtractAtPoints()
57 bool inT = t.containsPoint(point); in testSubtractAtPoints()
58 bool inDiff = diff.containsPoint(point); in testSubtractAtPoints()
73 bool inS = s.containsPoint(point); in testComplementAtPoints()
122 TEST(SetTest, containsPoint) { in TEST() argument
132 EXPECT_TRUE(setA.containsPoint({x})); in TEST()
[all …]
|
| /dports/games/residualvm/residualvm-0.3.1/engines/stark/ui/ |
| H A D | topmenu.cpp | 88 if (_exitButton->containsPoint(pos)) { in onClick()
93 if (_inventoryButton->containsPoint(pos)) { in onClick()
97 if (_optionsButton->containsPoint(pos)) { in onClick()
103 if (_exitButton->containsPoint(point)) { in getButtonAtPosition()
105 } else if (_optionsButton->containsPoint(point)) { in getButtonAtPosition()
107 } else if (_inventoryButton->containsPoint(point)) { in getButtonAtPosition()
|
| /dports/games/scummvm/scummvm-2.5.1/engines/stark/ui/world/ |
| H A D | topmenu.cpp | 145 if (_exitButton->containsPoint(pos)) { in onClick()
150 if (_inventoryButton->containsPoint(pos)) { in onClick()
154 if (_optionsButton->containsPoint(pos)) { in onClick()
160 if (_exitButton->containsPoint(point)) { in getButtonAtPosition()
162 } else if (_optionsButton->containsPoint(point)) { in getButtonAtPosition()
164 } else if (_inventoryButton->containsPoint(point)) { in getButtonAtPosition()
|
| /dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/operation/predicate/ |
| H A D | RectangleIntersects.java | 103 if (ecpVisitor.containsPoint()) in intersects()
202 private boolean containsPoint = false; field in GeometryContainsPointVisitor
217 public boolean containsPoint() in containsPoint() method in GeometryContainsPointVisitor
219 return containsPoint; in containsPoint()
243 containsPoint = true; in visit()
251 return containsPoint == true; in isDone()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/comphelper/source/misc/ |
| H A D | accessiblecomponenthelper.cxx | 42 bool OCommonAccessibleComponent::containsPoint( const awt::Point& _rPoint ) in containsPoint() function in comphelper::OCommonAccessibleComponent
105 sal_Bool SAL_CALL OAccessibleComponentHelper::containsPoint( const awt::Point& _rPoint ) in IMPLEMENT_FORWARD_XINTERFACE2()
107 return OCommonAccessibleComponent::containsPoint( _rPoint ); in IMPLEMENT_FORWARD_XINTERFACE2()
144 sal_Bool SAL_CALL OAccessibleExtendedComponentHelper::containsPoint( const awt::Point& _rPoint ) in IMPLEMENT_FORWARD_XINTERFACE2()
146 return OCommonAccessibleComponent::containsPoint( _rPoint ); in IMPLEMENT_FORWARD_XINTERFACE2()
|
| /dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/platform/graphics/ |
| H A D | FloatQuad.cpp | 94 bool FloatQuad::containsPoint(const FloatPoint& p) const in containsPoint() function in WebCore::FloatQuad
102 …return containsPoint(other.p1()) && containsPoint(other.p2()) && containsPoint(other.p3()) && cont… in containsQuad()
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/comphelper/source/misc/ |
| H A D | accessiblecomponenthelper.cxx | 42 bool OCommonAccessibleComponent::containsPoint( const awt::Point& _rPoint ) in containsPoint() function in comphelper::OCommonAccessibleComponent
105 sal_Bool SAL_CALL OAccessibleComponentHelper::containsPoint( const awt::Point& _rPoint ) in IMPLEMENT_FORWARD_XINTERFACE2()
107 return OCommonAccessibleComponent::containsPoint( _rPoint ); in IMPLEMENT_FORWARD_XINTERFACE2()
144 sal_Bool SAL_CALL OAccessibleExtendedComponentHelper::containsPoint( const awt::Point& _rPoint ) in IMPLEMENT_FORWARD_XINTERFACE2()
146 return OCommonAccessibleComponent::containsPoint( _rPoint ); in IMPLEMENT_FORWARD_XINTERFACE2()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/toolkit/qa/complex/toolkit/accessibility/ |
| H A D | _XAccessibleComponent.java | 80 while (!oObj.containsPoint(new Point(curX, 0)) && curX < bounds.Width) { in _containsPoint()
93 while (!oObj.containsPoint(new Point(curX, bounds.Height - 1)) in _containsPoint()
109 while (!oObj.containsPoint(new Point(0, curY)) && curY < bounds.Height) { in _containsPoint()
122 while (!oObj.containsPoint(new Point(bounds.Width - 1, curY)) && curY < bounds.Height) { in _containsPoint()
136 locRes &= !oObj.containsPoint(new Point(x, -1)); in _containsPoint()
137 locRes &= !oObj.containsPoint(new Point(x, bounds.Height+bounds.Y)); in _containsPoint()
150 locRes &= !oObj.containsPoint(new Point(-1, y)); in _containsPoint()
151 locRes &= !oObj.containsPoint(new Point(bounds.X+bounds.Width, y)); in _containsPoint()
197 while (!children[i].containsPoint(new Point(curX, curY)) in _getAccessibleAtPoint()
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/toolkit/qa/complex/toolkit/accessibility/ |
| H A D | _XAccessibleComponent.java | 80 while (!oObj.containsPoint(new Point(curX, 0)) && curX < bounds.Width) { in _containsPoint()
93 while (!oObj.containsPoint(new Point(curX, bounds.Height - 1)) in _containsPoint()
109 while (!oObj.containsPoint(new Point(0, curY)) && curY < bounds.Height) { in _containsPoint()
122 while (!oObj.containsPoint(new Point(bounds.Width - 1, curY)) && curY < bounds.Height) { in _containsPoint()
136 locRes &= !oObj.containsPoint(new Point(x, -1)); in _containsPoint()
137 locRes &= !oObj.containsPoint(new Point(x, bounds.Height+bounds.Y)); in _containsPoint()
150 locRes &= !oObj.containsPoint(new Point(-1, y)); in _containsPoint()
151 locRes &= !oObj.containsPoint(new Point(bounds.X+bounds.Width, y)); in _containsPoint()
197 while (!children[i].containsPoint(new Point(curX, curY)) in _getAccessibleAtPoint()
|
| /dports/math/kig/kig-21.12.3/objects/ |
| H A D | intersection_types.cc | 96 if ( !lineimp->containsPoint( ret, doc ) ) return new InvalidImp; in calc()
144 if ( !line->containsPoint( p, doc ) || !conic->containsPoint( p, doc ) ) in calc()
159 if ( !line->containsPoint( ret, doc ) ) return new InvalidImp; in calc()
201 if ( !line->containsPoint( p, doc ) || !cubic->containsPoint( p, doc ) ) in calc()
205 if ( !line->containsPoint( q, doc ) || !cubic->containsPoint( q, doc ) ) in calc()
270 if ( !line->containsPoint( p, doc ) || !cubic->containsPoint( p, doc ) ) in calc()
348 if ( !circle1->containsPoint( p, doc ) || !circle2->containsPoint( p, doc ) ) in calc()
399 if ( static_cast<const AbstractLineImp*>( parents[0] )->containsPoint( p, d ) && in calc()
400 static_cast<const AbstractLineImp*>( parents[1] )->containsPoint( p, d ) ) in calc()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/qadevOOo/tests/java/ifc/accessibility/ |
| H A D | _XAccessibleComponent.java | 75 while (!oObj.containsPoint(new Point(curX, 0)) && in _containsPoint()
91 while (!oObj.containsPoint(new Point(curX, bounds.Height - 1)) && in _containsPoint()
109 while (!oObj.containsPoint(new Point(0, curY)) && in _containsPoint()
125 while (!oObj.containsPoint(new Point(bounds.Width - 1, curY)) && in _containsPoint()
142 if (oObj.containsPoint(new Point(x, -1))) { in _containsPoint()
149 if (oObj.containsPoint(new Point(x, bounds.Height + bounds.Y))) { in _containsPoint()
169 if (oObj.containsPoint(new Point(-1, y))) { in _containsPoint()
176 if (oObj.containsPoint(new Point(bounds.X + bounds.Width, y))) { in _containsPoint()
250 while (!children[i].containsPoint(new Point(curX, curY)) && in _getAccessibleAtPoint()
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/qadevOOo/tests/java/ifc/accessibility/ |
| H A D | _XAccessibleComponent.java | 75 while (!oObj.containsPoint(new Point(curX, 0)) && in _containsPoint()
91 while (!oObj.containsPoint(new Point(curX, bounds.Height - 1)) && in _containsPoint()
109 while (!oObj.containsPoint(new Point(0, curY)) && in _containsPoint()
125 while (!oObj.containsPoint(new Point(bounds.Width - 1, curY)) && in _containsPoint()
142 if (oObj.containsPoint(new Point(x, -1))) { in _containsPoint()
149 if (oObj.containsPoint(new Point(x, bounds.Height + bounds.Y))) { in _containsPoint()
169 if (oObj.containsPoint(new Point(-1, y))) { in _containsPoint()
176 if (oObj.containsPoint(new Point(bounds.X + bounds.Width, y))) { in _containsPoint()
250 while (!children[i].containsPoint(new Point(curX, curY)) && in _getAccessibleAtPoint()
|
| /dports/games/scummvm/scummvm-2.5.1/math/ |
| H A D | line2d.cpp | 83 bool Line2d::containsPoint(const Vector2d &point) const { in containsPoint() function in Math::Line2d
169 if (getLine().intersectsLine(line, &p) && containsPoint(p)) { in intersectsLine()
178 bool Segment2d::containsPoint(const Vector2d &point) const { in containsPoint() function in Math::Segment2d
179 if (getLine().containsPoint(point)) { in containsPoint()
180 return Rect2d(_begin, _end).containsPoint(point); in containsPoint()
|
| /dports/graphics/gnash/gnash-2b3bdede0305c4fc3ad21a0a4197330606c9b880/testsuite/actionscript.all/ |
| H A D | Rectangle.as | 47 check(Rectangle.prototype.hasOwnProperty('containsPoint'));
358 // Test containsPoint
362 check_equals(r0.containsPoint({x:4, y:6}), false);
363 check_equals(r0.containsPoint({x:11, y:11}), true);
364 check_equals(r0.containsPoint({x:10, y:10}), true);
365 check_equals(r0.containsPoint({x:10, y:26}), false);
366 check_equals(r0.containsPoint({x:10, y:25.9}), true);
367 check_equals(r0.containsPoint({x:24.9, y:25.9}), true);
368 check_equals(r0.containsPoint({x:25, y:10}), false);
369 check_equals(r0.containsPoint({x:-25, y:-10}), false);
[all …]
|
| /dports/games/trenchbroom/TrenchBroom-ed46601/common/src/View/ |
| H A D | Lasso.cpp | 49 if (containsPoint(point, plane, box)) in containedPoints()
55 bool Lasso::containsPoint(const Vec3& point) const { in containsPoint() function in TrenchBroom::View::Lasso
58 return containsPoint(point, plane, box); in containsPoint()
61 bool Lasso::containsPoint(const Vec3& point, const Plane3& plane, const BBox2& box) const { in containsPoint() function in TrenchBroom::View::Lasso
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/include/comphelper/ |
| H A D | accessiblecomponenthelper.hxx | 60 bool containsPoint( const css::awt::Point& aPoint );
98 virtual sal_Bool SAL_CALL containsPoint( const css::awt::Point& aPoint ) override;
128 virtual sal_Bool SAL_CALL containsPoint( const css::awt::Point& aPoint ) override;
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/include/comphelper/ |
| H A D | accessiblecomponenthelper.hxx | 60 bool containsPoint( const css::awt::Point& aPoint );
98 virtual sal_Bool SAL_CALL containsPoint( const css::awt::Point& aPoint ) override;
128 virtual sal_Bool SAL_CALL containsPoint( const css::awt::Point& aPoint ) override;
|
| /dports/graphics/aseprite/aseprite-1.2.9/src/doc/algorithm/ |
| H A D | flip_image.cpp | 70 if (mask->containsPoint(x, y)) { in flip_image_with_mask()
72 if (!mask->containsPoint(u, y)) in flip_image_with_mask()
89 if (mask->containsPoint(x, y)) { in flip_image_with_mask()
91 if (!mask->containsPoint(x, v)) in flip_image_with_mask()
|