/dports/graphics/libpano13/libpano13-2.9.20/ |
H A D | pan.c | 28 aPrefs aP; in pan() local 48 if( *aP.sBuf.destName == 0 || LoadBufImage( &aP.pano, aP.sBuf.destName, 0) != 0 ) in pan() 56 TrPtr->dest = &aP.pano; in pan() 69 MakePano( TrPtr, &aP ); in pan() 106 if( *aP.sBuf.destName == 0 || LoadBufImage( TrPtr->dest, aP.sBuf.destName, 1) != 0 ) in pan() 124 NORM_ANGLE( aP.im.yaw ); in pan() 128 NORM_ANGLE( aP.im.yaw ); in pan() 141 aP.im.hfov = hfov; in pan() 146 aP.im.hfov = hfov; in pan() 166 if( LoadBufImage( &aP.pano, aP.sBuf.destName, 1) != 0 ) in pan() [all …]
|
/dports/x11/eaglemode/eaglemode-0.95.0/src/emCore/ |
H A D | emPainter_ScTlPSInt_AVX2.cpp | 389 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 402 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 412 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 632 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 645 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 655 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 857 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 867 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 1111 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() 1124 aP=_mm256_add_epi16(aP,_mm256_srli_epi16(aP,8)); in CONCAT() [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/Draw/ |
H A D | Draw_Box.cxx | 99 gp_Pnt aP; in DrawOn() local 101 theDIS.MoveTo(aP); in DrawOn() 105 MoveX(2.0*aHx, aP); in DrawOn() 106 theDIS.DrawTo(aP); in DrawOn() 107 MoveY(2.0*aHy, aP); in DrawOn() 108 theDIS.DrawTo(aP); in DrawOn() 110 theDIS.DrawTo(aP); in DrawOn() 112 theDIS.DrawTo(aP); in DrawOn() 115 theDIS.MoveTo(aP); in DrawOn() 129 theDIS.MoveTo(aP); in DrawOn() [all …]
|
/dports/games/spring/spring_98.0/rts/Game/GUI/ |
H A D | PlayerRoster.cpp | 153 if ( aP->active && !bP->active) { return -1; } in CompareBasics() 175 const int basic = CompareBasics(aP, bP); in CompareAllies() 190 const int aTeam = aP->team; in CompareAllies() 228 const int basic = CompareBasics(aP, bP); in CompareTeamIDs() 234 if (aP->team < bP->team) { return -1; } in CompareTeamIDs() 235 if (aP->team > bP->team) { return +1; } in CompareTeamIDs() 254 const int basic = CompareBasics(aP, bP); in ComparePlayerNames() 275 const int basic = CompareBasics(aP, bP); in ComparePlayerCPUs() 297 const int basic = CompareBasics(aP, bP); in ComparePlayerPings() 303 if (aP->ping < bP->ping) { return -1; } in ComparePlayerPings() [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/BinMDataXtd/ |
H A D | BinMDataXtd_PatternStdDriver.cxx | 57 Handle(TDataXtd_PatternStd) aP = in Paste() 66 aP->Signature(signature); in Paste() 89 aP->Mirror(TNS); in Paste() 106 aP->Axis1(TNS); in Paste() 118 aP->Value1(TReal); in Paste() 130 aP->NbInstances1(TInt); in Paste() 144 aP->Axis2(TNS); in Paste() 156 aP->Value2(TReal); in Paste() 168 aP->NbInstances2(TInt); in Paste() 228 Axis = aP->Axis2(); in Paste() [all …]
|
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/pcbnew/router/ |
H A D | pns_dragger.cpp | 218 m_lastValidPoint = aP; in Start() 221 m_mouseTrailTracer.AddTrailPoint( aP ); in Start() 353 nvia->SetPos( aP ); in dragViaMarkObstacles() 385 draggedVia->SetPos( aP ); in dragViaWalkaround() 461 VECTOR2I anchor( aP ); in optimizeAndUpdateDraggedLine() 463 if( aDragged.CLine().Find( aP ) < 0 ) in optimizeAndUpdateDraggedLine() 591 bool DRAGGER::dragShove( const VECTOR2I& aP ) in dragShove() argument 706 bool DRAGGER::Drag( const VECTOR2I& aP ) in Drag() argument 708 m_mouseTrailTracer.AddTrailPoint( aP ); in Drag() 714 ret = dragMarkObstacles( aP ); in Drag() [all …]
|
H A D | pns_dragger.h | 59 virtual bool Start( const VECTOR2I& aP, ITEM_SET& aPrimitives ) override; 67 bool Drag( const VECTOR2I& aP ) override; 118 bool dragMarkObstacles( const VECTOR2I& aP ); 119 bool dragShove(const VECTOR2I& aP ); 120 bool dragWalkaround(const VECTOR2I& aP ); 121 bool startDragSegment( const VECTOR2D& aP, SEGMENT* aSeg ); 122 bool startDragArc( const VECTOR2D& aP, ARC* aArc ); 124 bool dragViaMarkObstacles( const VIA_HANDLE& aHandle, NODE* aNode, const VECTOR2I& aP ); 125 bool dragViaWalkaround( const VIA_HANDLE& aHandle, NODE* aNode, const VECTOR2I& aP ); 126 void optimizeAndUpdateDraggedLine( LINE& aDragged, const LINE& aOrig, const VECTOR2I& aP ); [all …]
|
H A D | pns_diff_pair_placer.h | 58 static bool FindDpPrimitivePair( NODE* aWorld, const VECTOR2I& aP, ITEM* aItem, 64 bool Start( const VECTOR2I& aP, ITEM* aStartItem ) override; 70 bool Move( const VECTOR2I& aP, ITEM* aEndItem ) override; 80 bool FixRoute( const VECTOR2I& aP, ITEM* aEndItem, bool aForceFinish ) override; 165 bool route( const VECTOR2I& aP ); 191 bool routeHead( const VECTOR2I& aP ); 195 bool rhWalkOnly( const VECTOR2I& aP ); 198 bool rhShoveOnly ( const VECTOR2I& aP ); 201 bool rhMarkObstacles( const VECTOR2I& aP ); 203 const VIA makeVia ( const VECTOR2I& aP, int aNet ); [all …]
|
H A D | pns_line_placer.h | 93 bool Start( const VECTOR2I& aP, ITEM* aStartItem ) override; 99 bool Move( const VECTOR2I& aP, ITEM* aEndItem ) override; 109 bool FixRoute( const VECTOR2I& aP, ITEM* aEndItem, bool aForceFinish ) override; 204 bool SplitAdjacentSegments( NODE* aNode, ITEM* aSeg, const VECTOR2I& aP ); 215 bool route( const VECTOR2I& aP ); 300 bool routeHead( const VECTOR2I& aP, LINE& aNewHead ); 308 void routeStep( const VECTOR2I& aP ); 311 bool rhWalkOnly( const VECTOR2I& aP, LINE& aNewHead ); 314 bool rhShoveOnly( const VECTOR2I& aP, LINE& aNewHead ); 317 bool rhMarkObstacles( const VECTOR2I& aP, LINE& aNewHead ); [all …]
|
/dports/science/qmcpack/qmcpack-3.11.0/external_codes/boost_multi/multi/test/ |
H A D | array_ptr.cpp | 51 multi::array_ptr<double, 2> aP{&a}; in BOOST_AUTO_TEST_CASE() local 59 BOOST_REQUIRE( aP == aP2 ); in BOOST_AUTO_TEST_CASE() 62 BOOST_REQUIRE( bP != aP ); in BOOST_AUTO_TEST_CASE() 64 bP = aP; in BOOST_AUTO_TEST_CASE() 65 BOOST_REQUIRE( aP == bP ); in BOOST_AUTO_TEST_CASE() 66 BOOST_REQUIRE( *aP == *bP ); in BOOST_AUTO_TEST_CASE() 67 BOOST_REQUIRE( aP->operator==(*bP) ); in BOOST_AUTO_TEST_CASE() 69 auto&& aR = *aP; in BOOST_AUTO_TEST_CASE() 71 BOOST_REQUIRE( aR == *aP ); in BOOST_AUTO_TEST_CASE() 72 BOOST_REQUIRE( aR.equal(aP->begin()) ); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/common/geometry/ |
H A D | shape_line_chain.cpp | 52 SEG s( aP, aP ); in Collide() 122 m_points[aStartIndex] = aP; in Replace() 126 m_points[aStartIndex] = aP; in Replace() 175 int found_index = Find( aP ); in Split() 184 if( dist < min_dist && seg.A != aP && seg.B != aP ) in Split() 211 if( CPoint( s ) == aP ) in Find() 336 int d = seg.Distance( aP ); in PathLength() 376 if( ( ( p1.y > aP.y ) != ( p2.y > aP.y ) ) && ( aP.x - p1.x < d ) ) in PointInside() 401 if( s.A == aP || s.B == aP ) in EdgeContainingPoint() 418 return m_points[0] == aP; in CheckClearance() [all …]
|
/dports/editors/libreoffice6/libreoffice-6.4.7.2/filter/source/graphicfilter/idxf/ |
H A D | dxfreprd.cxx | 313 DXFVector aP; in CalcBoundingBox() local 314 aP=pE->aP0; in CalcBoundingBox() 317 rBox.Union(aP); in CalcBoundingBox() 318 aP=pE->aP0; in CalcBoundingBox() 321 rBox.Union(aP); in CalcBoundingBox() 326 DXFVector aP; in CalcBoundingBox() local 327 aP=pE->aP0; in CalcBoundingBox() 330 rBox.Union(aP); in CalcBoundingBox() 331 aP=pE->aP0; in CalcBoundingBox() 367 DXFVector aP; in CalcBoundingBox() local [all …]
|
/dports/editors/libreoffice/libreoffice-7.2.6.2/vcl/source/filter/idxf/ |
H A D | dxfreprd.cxx | 300 DXFVector aP; in CalcBoundingBox() local 301 aP=pE->aP0; in CalcBoundingBox() 304 rBox.Union(aP); in CalcBoundingBox() 305 aP=pE->aP0; in CalcBoundingBox() 308 rBox.Union(aP); in CalcBoundingBox() 313 DXFVector aP; in CalcBoundingBox() local 314 aP=pE->aP0; in CalcBoundingBox() 317 rBox.Union(aP); in CalcBoundingBox() 318 aP=pE->aP0; in CalcBoundingBox() 354 DXFVector aP; in CalcBoundingBox() local [all …]
|
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/router/ |
H A D | pns_dragger.cpp | 66 auto distA = ( aP - aSeg->Seg().A ).EuclideanNorm(); in startDragSegment() 67 auto distB = ( aP - aSeg->Seg().B ).EuclideanNorm(); in startDragSegment() 96 bool DRAGGER::startDragVia( const VECTOR2D& aP, VIA* aVia ) in startDragVia() argument 159 bool DRAGGER::dragMarkObstacles( const VECTOR2I& aP ) in dragMarkObstacles() argument 196 dumbDragVia( m_initialVia, m_lastNode, aP ); in dragMarkObstacles() 219 m_draggedVia->SetPos( aP ); in dumbDragVia() 245 bool DRAGGER::dragShove( const VECTOR2I& aP ) in dragShove() argument 338 bool DRAGGER::Drag( const VECTOR2I& aP ) in Drag() argument 341 return dragMarkObstacles( aP ); in Drag() 346 return dragMarkObstacles( aP ); in Drag() [all …]
|
H A D | pns_line_placer.h | 64 bool Start( const VECTOR2I& aP, ITEM* aStartItem ) override; 73 bool Move( const VECTOR2I& aP, ITEM* aEndItem ) override; 198 bool SplitAdjacentSegments( NODE* aNode, ITEM* aSeg, const VECTOR2I& aP ); 212 bool route( const VECTOR2I& aP ); 327 bool routeHead( const VECTOR2I& aP, LINE& aNewHead); 336 void routeStep( const VECTOR2I& aP ); 340 bool rhStopAtNearestObstacle( const VECTOR2I& aP, LINE& aNewHead ); 344 bool rhWalkOnly( const VECTOR2I& aP, LINE& aNewHead); 347 bool rhShoveOnly( const VECTOR2I& aP, LINE& aNewHead); 350 bool rhMarkObstacles( const VECTOR2I& aP, LINE& aNewHead ); [all …]
|
H A D | pns_router.cpp | 122 return m_world->HitTest( aP ); in QueryHoverItems() 140 m_placer->Start( aP, aStartItem ); in StartDragging() 147 if( m_dragger->Start ( aP, aStartItem ) ) in StartDragging() 180 if( ! isStartingPointRoutable( aP, aLayer ) ) in StartRouting() 214 bool rv = m_placer->Start( aP, aStartItem ); in StartRouting() 219 m_currentEnd = aP; in StartRouting() 234 m_currentEnd = aP; in Move() 239 movePlacing( aP, endItem ); in Move() 243 moveDragging( aP, endItem ); in Move() 256 m_dragger->Drag( aP ); in moveDragging() [all …]
|
H A D | pns_diff_pair_placer.h | 67 bool Start( const VECTOR2I& aP, ITEM* aStartItem ) override; 76 bool Move( const VECTOR2I& aP, ITEM* aEndItem ) override; 87 bool FixRoute( const VECTOR2I& aP, ITEM* aEndItem, bool aForceFinish ) override; 181 bool route( const VECTOR2I& aP ); 215 bool routeHead( const VECTOR2I& aP ); 219 bool rhWalkOnly( const VECTOR2I& aP ); 222 bool rhShoveOnly ( const VECTOR2I& aP ); 225 bool rhMarkObstacles( const VECTOR2I& aP ); 227 const VIA makeVia ( const VECTOR2I& aP, int aNet ); 229 …bool findDpPrimitivePair( const VECTOR2I& aP, ITEM* aItem, DP_PRIMITIVE_PAIR& aPair, std::string* … [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/XmlMDataXtd/ |
H A D | XmlMDataXtd_PatternStdDriver.cxx | 88 aP->Signature(signature); in Paste() 116 aP->Axis1(TNS); in Paste() 133 aP->Value1(TReal); in Paste() 169 aP->Axis2(TNS); in Paste() 186 aP->Value2(TReal); in Paste() 223 aP->Mirror(TNS); in Paste() 244 if (aP->Axis1Reversed()) in Paste() 258 TNS = aP->Axis1(); in Paste() 267 TReal = aP->Value1(); in Paste() 287 TNS = aP->Axis2(); in Paste() [all …]
|
/dports/cad/horizon-eda/horizon-2.1.0/3rd_party/router/include/geometry/ |
H A D | seg.h | 121 VECTOR2I LineProject( const VECTOR2I& aP ) const; 130 int Side( const VECTOR2I& aP ) const in Side() argument 206 return ( NearestPoint( aP ) - aP ).SquaredEuclideanNorm(); in SquaredDistance() 216 int Distance( const VECTOR2I& aP ) const in Distance() argument 218 return sqrt( SquaredDistance( aP ) ); in Distance() 306 ecoord TCoef( const VECTOR2I& aP ) const; 319 bool Contains( const VECTOR2I& aP ) const; 349 ecoord t = d.Dot( aP - A ); in LineProject() 363 ecoord dist = ( p * aP.x + q * aP.y + r ) / sqrt( p * p + q * q ); in LineDistance() 371 return d.Dot( aP - A); in TCoef() [all …]
|
H A D | shape_line_chain.h | 401 m_bbox = BOX2I( aP, VECTOR2I( 0, 0 ) ); 405 m_points.push_back( aP ); 406 m_bbox.Merge( aP ); 436 void Insert( int aVertex, const VECTOR2I& aP ) in Insert() argument 491 int Split( const VECTOR2I& aP ); 500 int Find( const VECTOR2I& aP ) const; 509 int FindSegment( const VECTOR2I& aP ) const; 567 int PathLength( const VECTOR2I& aP ) const; 577 bool PointInside( const VECTOR2I& aP ) const; 586 bool PointOnEdge( const VECTOR2I& aP ) const; [all …]
|
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/libs/kimath/src/geometry/ |
H A D | seg.cpp | 170 return SEG( aP, endPoint ); in PerpendicularSeg() 177 VECTOR2I endPoint = slope + aP; in ParallelSeg() 179 return SEG( aP, endPoint ); in ParallelSeg() 221 bool SEG::Contains( const VECTOR2I& aP ) const in Contains() 223 return Distance( aP ) <= 1; in Contains() 235 ecoord t = d.Dot( aP - A ); in NearestPoint() 257 c = aP; in ReflectPoint() 264 return 2 * c - aP; in ReflectPoint() 276 ecoord t = d.Dot( aP - A ); in LineProject() 291 int SEG::Distance( const VECTOR2I& aP ) const in Distance() [all …]
|
H A D | poly_grid_partition.cpp | 36 if( containsPoint( aP ) ) in ContainsPoint() 40 return checkClearance( aP, aClearance ); in ContainsPoint() 48 const auto gridPoint = poly2grid( aP ); in containsPoint() 50 if( !m_bbox.Contains( aP ) ) in containsPoint() 107 return m_outline.PointInside( aP ); in containsPoint() 124 int gx0 = poly2gridX( aP.x - aClearance - 1 ); in checkClearance() 379 if( aP.y == edge.A.y in scanCell() 396 edge.B.x, edge.B.y, aP.x, aP.y ); in scanCell() 400 if( edge.A.y == aP.y ) in scanCell() 404 else if( edge.B.y == aP.y ) in scanCell() [all …]
|
H A D | circle.cpp | 118 if( aP == intersectPoint ) in ConstructFromTanTanPt() 121 Center = aP; in ConstructFromTanTanPt() 136 hSolution.Center = anglebisector.LineProject( aP ); in ConstructFromTanTanPt() 140 SEG throughaP( intersectPoint, aP ); in ConstructFromTanTanPt() 152 if( ( hTanLineA - aP ).EuclideanNorm() > ( hTanLineB - aP ).EuclideanNorm() ) in ConstructFromTanTanPt() 188 bool CIRCLE::Contains( const VECTOR2I& aP ) const in Contains() 190 int distance = ( aP - Center ).EuclideanNorm(); in Contains() 197 VECTOR2I CIRCLE::NearestPoint( const VECTOR2I& aP ) const in NearestPoint() 199 VECTOR2I vec = aP - Center; in NearestPoint() 343 bool CIRCLE::Contains( const VECTOR2I& aP ) in Contains() argument [all …]
|
/dports/cad/opencascade/opencascade-7.6.0/src/DrawTrSurf/ |
H A D | DrawTrSurf_Debug.cxx | 68 const gp_Pnt& aP = *(gp_Pnt*)thePntPtr; in DrawTrSurf_SetPnt() local 70 …sprintf (buff, "Point (%.16g, %.16g, %.16g) set to DRAW variable %.80s", aP.X(), aP.Y(), aP.Z(), t… in DrawTrSurf_SetPnt() 71 DrawTrSurf::Set (theNameStr, aP); in DrawTrSurf_SetPnt() 88 const gp_Pnt2d& aP = *(gp_Pnt2d*)thePnt2dPtr; in DrawTrSurf_SetPnt2d() local 90 sprintf (buff, "Point (%.16g, %.16g) set to DRAW variable %.80s", aP.X(), aP.Y(), theNameStr); in DrawTrSurf_SetPnt2d() 91 DrawTrSurf::Set (theNameStr, aP); in DrawTrSurf_SetPnt2d()
|
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/libs/kimath/include/geometry/ |
H A D | seg.h | 134 VECTOR2I LineProject( const VECTOR2I& aP ) const; 142 int Side( const VECTOR2I& aP ) const in Side() argument 144 const ecoord det = ( B - A ).Cross( aP - A ); in Side() 220 SEG PerpendicularSeg( const VECTOR2I& aP ) const; 228 SEG ParallelSeg( const VECTOR2I& aP ) const; 242 ecoord SquaredDistance( const VECTOR2I& aP ) const in SquaredDistance() argument 244 return ( NearestPoint( aP ) - aP ).SquaredEuclideanNorm(); in SquaredDistance() 253 int Distance( const VECTOR2I& aP ) const; 360 ecoord TCoef( const VECTOR2I& aP ) const; 373 bool Contains( const VECTOR2I& aP ) const; [all …]
|