/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/ |
H A D | SelectMgr_Frustum.hxx | 67 Standard_Boolean hasOverlap (const SelectMgr_Vec3& theBoxMin, 72 Standard_Boolean hasOverlap (const gp_Pnt& thePnt) const; 75 Standard_Boolean hasOverlap (const gp_Pnt& thePnt1, 79 Standard_Boolean hasOverlap (const TColgp_Array1OfPnt& theArrayOfPnts, 83 Standard_Boolean hasOverlap (const gp_Pnt& thePnt1,
|
H A D | BOPTools_BoxSelector.hxx | 65 Standard_Boolean hasOverlap; in RejectNode() local 66 theIsInside = myBox.Contains (theCMin, theCMax, hasOverlap); in RejectNode() 67 return !hasOverlap; in RejectNode()
|
H A D | BVH_Box.hxx | 150 Standard_Boolean& hasOverlap) const in Contains() 152 hasOverlap = Standard_False; in Contains() 156 return Contains (theOther.myMinPoint, theOther.myMaxPoint, hasOverlap); in Contains() 162 Standard_Boolean& hasOverlap) const in Contains() 164 hasOverlap = Standard_False; in Contains() 173 hasOverlap = (myMinPoint[i] <= theMaxPoint[i] && in Contains() 175 if (!hasOverlap) in Contains()
|
H A D | SelectMgr_Frustum.lxx | 124 // function : hasOverlap 130 Standard_Boolean SelectMgr_Frustum<N>::hasOverlap (const SelectMgr_Vec3& theMinPnt, 202 // function : hasOverlap 206 Standard_Boolean SelectMgr_Frustum<N>::hasOverlap (const gp_Pnt& thePnt) const 225 // function : hasOverlap 229 Standard_Boolean SelectMgr_Frustum<N>::hasOverlap (const gp_Pnt& theStartPnt, 306 // function : hasOverlap 311 Standard_Boolean SelectMgr_Frustum<N>::hasOverlap (const TColgp_Array1OfPnt& theArrayOfPnts, 402 // function : hasOverlap 406 Standard_Boolean SelectMgr_Frustum<N>::hasOverlap (const gp_Pnt& thePnt1,
|
/dports/devel/kdevelop/kdevelop-21.12.3/plugins/qmljs/3rdparty/qtcreator-libs/utils/ |
H A D | changeset.cpp | 56 bool ChangeSet::hasOverlap(int pos, int length) in hasOverlap() function in Utils::ChangeSet 127 if (hasOverlap(pos, length)) in replace_helper() 141 if (hasOverlap(pos, length) in move_helper() 142 || hasOverlap(to, 0) in move_helper() 160 if (hasOverlap(pos, 0)) in insert() 203 if (hasOverlap(pos, length)) in remove_helper() 216 if (hasOverlap(pos1, length1) in flip_helper() 217 || hasOverlap(pos2, length2) in flip_helper() 234 if (hasOverlap(pos, length) in copy_helper() 235 || hasOverlap(to, 0) in copy_helper()
|
/dports/devel/qtcreator/qt-creator-opensource-src-5.0.3/src/libs/utils/ |
H A D | changeset.cpp | 56 bool ChangeSet::hasOverlap(int pos, int length) const in hasOverlap() function in Utils::ChangeSet 125 if (hasOverlap(pos, length)) in replace_helper() 139 if (hasOverlap(pos, length) in move_helper() 140 || hasOverlap(to, 0) in move_helper() 158 if (hasOverlap(pos, 0)) in insert() 201 if (hasOverlap(pos, length)) in remove_helper() 214 if (hasOverlap(pos1, length1) in flip_helper() 215 || hasOverlap(pos2, length2) in flip_helper() 232 if (hasOverlap(pos, length) in copy_helper() 233 || hasOverlap(to, 0) in copy_helper()
|
/dports/devel/qbs/qbs-src-1.21.0/src/lib/corelib/api/ |
H A D | changeset.cpp | 68 bool ChangeSet::hasOverlap(int pos, int length) in hasOverlap() function in QbsQmlJS::ChangeSet 138 if (hasOverlap(pos, length)) in replace_helper() 152 if (hasOverlap(pos, length) in move_helper() 153 || hasOverlap(to, 0) in move_helper() 170 if (hasOverlap(pos, 0)) in insert() 213 if (hasOverlap(pos, length)) in remove_helper() 226 if (hasOverlap(pos1, length1) in flip_helper() 227 || hasOverlap(pos2, length2) in flip_helper() 243 if (hasOverlap(pos, length) in copy_helper() 244 || hasOverlap(to, 0) in copy_helper()
|
/dports/cad/opencascade/opencascade-7.6.0/inc/ |
H A D | BOPTools_BoxSelector.hxx | 65 Standard_Boolean hasOverlap; in RejectNode() local 66 theIsInside = myBox.Contains (theCMin, theCMax, hasOverlap); in RejectNode() 67 return !hasOverlap; in RejectNode()
|
H A D | BVH_Box.hxx | 281 Standard_Boolean& hasOverlap) const in Contains() 283 hasOverlap = Standard_False; in Contains() 287 return Contains (theOther.myMinPoint, theOther.myMaxPoint, hasOverlap); in Contains() 293 Standard_Boolean& hasOverlap) const in Contains() 295 hasOverlap = Standard_False; in Contains() 304 hasOverlap = (myMinPoint[i] <= theMaxPoint[i] && in Contains() 306 if (!hasOverlap) in Contains()
|
/dports/cad/opencascade/opencascade-7.6.0/src/BOPTools/ |
H A D | BOPTools_BoxSelector.hxx | 65 Standard_Boolean hasOverlap; in RejectNode() local 66 theIsInside = myBox.Contains (theCMin, theCMax, hasOverlap); in RejectNode() 67 return !hasOverlap; in RejectNode()
|
/dports/x11/wallutils/wallutils-5.10.0/ |
H A D | xrandr.go | 15 hasOverlap bool member 100 x.hasOverlap = Overlaps(rects) 112 if x.hasOverlap {
|
/dports/cad/opencascade/opencascade-7.6.0/src/BVH/ |
H A D | BVH_Box.hxx | 281 Standard_Boolean& hasOverlap) const in Contains() 283 hasOverlap = Standard_False; in Contains() 287 return Contains (theOther.myMinPoint, theOther.myMaxPoint, hasOverlap); in Contains() 293 Standard_Boolean& hasOverlap) const in Contains() 295 hasOverlap = Standard_False; in Contains() 304 hasOverlap = (myMinPoint[i] <= theMaxPoint[i] && in Contains() 306 if (!hasOverlap) in Contains()
|
/dports/misc/openvdb/openvdb-9.0.0/openvdb/openvdb/tools/ |
H A D | FindActiveValues.h | 284 if (tile.bbox.hasOverlap(bbox)) return true; in anyActiveValues() 287 if (!node.bbox.hasOverlap(bbox)) {// no overlap in anyActiveValues() 302 if (!node.bbox.hasOverlap(bbox)) {// no overlap in anyActiveVoxels() 317 if (tile.bbox.hasOverlap(bbox)) return true; in anyActiveTiles() 320 if (!node.bbox.hasOverlap(bbox)) {// no overlap in anyActiveTiles() 336 if (!tile.bbox.hasOverlap(bbox)) { in count() 349 if ( !node.bbox.hasOverlap(bbox) ) { in count() 366 if (!tile.bbox.hasOverlap(bbox)) { in activeTiles() 380 if ( !node.bbox.hasOverlap(bbox) ) { in activeTiles() 398 assert( bbox.hasOverlap(b) ); in getBBoxMask() [all …]
|
H A D | Count.h | 122 if (!mBBox.hasOverlap(node.getNodeBoundingBox())) return false; in operator() 128 if (!bbox.hasOverlap(mBBox)) { in operator() 146 if (mBBox.hasOverlap(iter->getNodeBoundingBox())) return true; in operator() 163 } else if (!bbox.hasOverlap(mBBox)) { in operator()
|
H A D | Clip.h | 472 } else if (frustumIndexBBox.hasOverlap(tileFrustumBBox)) { 476 if (!frustumIndexBBox.hasOverlap(tileFrustumBBox)) { 506 if (!frustumIndexBBox.hasOverlap(toFrustumIndexSpace(subBBox))) continue; 534 if (frustumIndexBBox.hasOverlap(leafFrustumBBox)) { 538 if (!frustumIndexBBox.hasOverlap(leafFrustumBBox)
|
/dports/converters/wkhtmltopdf/qt-5db36ec/src/declarative/qml/rewriter/ |
H A D | textwriter.cpp | 58 bool TextWriter::hasOverlap(int pos, int length) in hasOverlap() function in TextWriter 92 Q_ASSERT(!hasOverlap(pos, length)); in replace() 104 Q_ASSERT(!hasOverlap(pos, length)); in move()
|
H A D | textwriter_p.h | 77 bool hasOverlap(int pos, int length);
|
/dports/cad/opencascade/opencascade-7.6.0/src/QABugs/ |
H A D | QABugs_BVH.cxx | 77 Standard_Boolean hasOverlap; in RejectNode() local 78 theIsInside = myBox.Contains (theCornerMin, theCornerMax, hasOverlap); in RejectNode() 79 return !hasOverlap; in RejectNode() 141 Standard_Boolean hasOverlap; in RejectNode() local 142 theIsInside = myBox.Contains (theCornerMin, theCornerMax, hasOverlap); in RejectNode() 143 return !hasOverlap; in RejectNode()
|
/dports/multimedia/libbluray/libbluray-1.3.0/src/libbluray/bdj/java/org/dvb/event/ |
H A D | EventManager.java | 215 if (hasOverlap(userEvents, item.userEvents)) { in cleanupReservedEvents() 232 if (hasOverlap(userEvents, item.userEvents)) { in cleanupReservedEvents() 248 private boolean hasOverlap(UserEventRepository userEvents1, UserEventRepository userEvents2) { in hasOverlap() method in EventManager
|
/dports/multimedia/handbrake/libbluray-1.3.0/src/libbluray/bdj/java/org/dvb/event/ |
H A D | EventManager.java | 215 if (hasOverlap(userEvents, item.userEvents)) { in cleanupReservedEvents() 232 if (hasOverlap(userEvents, item.userEvents)) { in cleanupReservedEvents() 248 private boolean hasOverlap(UserEventRepository userEvents1, UserEventRepository userEvents2) { in hasOverlap() method in EventManager
|
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/src/ |
H A D | particleToInsert.cpp | 263 if(neighList.hasOverlap(x_ins[0], radius_ins[0])) { in check_near_set_x_v_omega() 297 if(neighList.hasOverlap(xins_j_try, radius_ins[j])) { in check_near_set_x_v_omega_ms()
|
/dports/misc/adios2/ADIOS2-2.7.1/source/adios2/engine/ssc/ |
H A D | SscWriter.cpp | 329 bool hasOverlap = false; in CalculatePosition() local 334 hasOverlap = true; in CalculatePosition() 338 if (hasOverlap) in CalculatePosition()
|
/dports/devel/bullet/bullet3-3.21/src/BulletCollision/BroadphaseCollision/ |
H A D | btSimpleBroadphase.cpp | 270 bool hasOverlap = testAabbOverlap(pair.m_pProxy0, pair.m_pProxy1); in calculateOverlappingPairs() local 272 if (hasOverlap) in calculateOverlappingPairs()
|
/dports/graphics/blender/blender-2.91.0/extern/bullet2/src/BulletCollision/BroadphaseCollision/ |
H A D | btSimpleBroadphase.cpp | 270 bool hasOverlap = testAabbOverlap(pair.m_pProxy0, pair.m_pProxy1); in calculateOverlappingPairs() local 272 if (hasOverlap) in calculateOverlappingPairs()
|
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/BulletCollision/BroadphaseCollision/ |
H A D | btSimpleBroadphase.cpp | 292 bool hasOverlap = testAabbOverlap(pair.m_pProxy0,pair.m_pProxy1); in calculateOverlappingPairs() local 294 if (hasOverlap) in calculateOverlappingPairs()
|