PNS::WALKAROUND Class Reference

#include <pns_walkaround.h>

Inheritance diagram for PNS::WALKAROUND:

Classes
struct	RESULT

Public Types
enum	WALKAROUND_STATUS { IN_PROGRESS = 0 , ALMOST_DONE , DONE , STUCK }

Public Member Functions
	WALKAROUND (NODE *aWorld, ROUTER *aRouter)
	~WALKAROUND ()
void	SetWorld (NODE *aNode)
void	SetIterationLimit (const int aIterLimit)
void	SetSolidsOnly (bool aSolidsOnly)
void	SetItemMask (int aMask)
void	SetForceWinding (bool aEnabled, bool aCw)
void	RestrictToSet (bool aEnabled, const std::set< ITEM * > &aSet)
WALKAROUND_STATUS	Route (const LINE &aInitialPath, LINE &aWalkPath, bool aOptimize=true)
const RESULT	Route (const LINE &aInitialPath)
ROUTER *	Router () const
	Return current router settings. More...
ROUTING_SETTINGS &	Settings () const
	Return the logger object, allowing to dump geometry to a file. More...
virtual LOGGER *	Logger ()
void	SetLogger (LOGGER *aLogger)
void	SetDebugDecorator (DEBUG_DECORATOR *aDecorator)
	Assign a debug decorator allowing this algo to draw extra graphics for visual debugging. More...
DEBUG_DECORATOR *	Dbg () const
const BOX2I &	VisibleViewArea () const

Protected Attributes
DEBUG_DECORATOR *	m_debugDecorator
ROUTER *	m_router
LOGGER *	m_logger

Private Member Functions
void	start (const LINE &aInitialPath)
WALKAROUND_STATUS	singleStep (LINE &aPath, bool aWindingDirection)
NODE::OPT_OBSTACLE	nearestObstacle (const LINE &aPath)

Private Attributes
NODE *	m_world
int	m_iteration
int	m_iterationLimit
int	m_itemMask
bool	m_forceWinding
bool	m_forceCw
VECTOR2I	m_cursorPos
NODE::OPT_OBSTACLE	m_currentObstacle [2]
std::set< ITEM * >	m_restrictedSet
std::vector< VECTOR2I >	m_restrictedVertices
bool	m_forceLongerPath

Static Private Attributes
static const int	DefaultIterationLimit = 50

Detailed Description

Definition at line 35 of file pns_walkaround.h.

Member Enumeration Documentation

WALKAROUND_STATUS

enum PNS::WALKAROUND::WALKAROUND_STATUS

Enumerator
IN_PROGRESS
ALMOST_DONE
DONE
STUCK

Definition at line 56 of file pns_walkaround.h.

 {
 IN_PROGRESS = 0,
 ALMOST_DONE,
 DONE,
 STUCK
 };

Constructor & Destructor Documentation

WALKAROUND()

PNS::WALKAROUND::WALKAROUND ( NODE *  aWorld, ROUTER *  aRouter  )

inline

Definition at line 40 of file pns_walkaround.h.

 :
 ALGO_BASE ( aRouter ),
 m_world( aWorld ),
 m_iterationLimit( DefaultIterationLimit )
 {
 m_forceWinding = false;
 m_itemMask = ITEM::ANY_T;
 
 // Initialize other members, to avoid uninitialized variables.
 m_iteration = 0;
 m_forceCw = false;
 m_forceLongerPath = false;
 }

References PNS::ITEM::ANY_T, m_forceCw, m_forceLongerPath, m_forceWinding, m_itemMask, and m_iteration.

~WALKAROUND()

PNS::WALKAROUND::~WALKAROUND ( )

inline

Definition at line 54 of file pns_walkaround.h.

{};

Member Function Documentation

Dbg()

DEBUG_DECORATOR * PNS::ALGO_BASE::Dbg ( ) const

inlineinherited

Definition at line 78 of file pns_algo_base.h.

 {
 return m_debugDecorator;
 }

References PNS::ALGO_BASE::m_debugDecorator.

Referenced by PNS::LINE_PLACER::buildInitialLine(), PNS::MEANDER_PLACER::doMove(), PNS::COMPONENT_DRAGGER::Drag(), PNS::DRAGGER::dragShove(), PNS::DRAGGER::dragWalkaround(), PNS::SHOVE::fixupViaCollisions(), PNS::LINE_PLACER::handlePullback(), PNS::LINE_PLACER::handleSelfIntersections(), PNS::LINE_PLACER::mergeHead(), PNS::DP_MEANDER_PLACER::Move(), PNS::MEANDER_SKEW_PLACER::Move(), PNS::SHOVE::onCollidingArc(), PNS::SHOVE::onCollidingLine(), PNS::SHOVE::onCollidingSegment(), PNS::SHOVE::onCollidingSolid(), PNS::SHOVE::onCollidingVia(), PNS::SHOVE::onReverseCollidingVia(), PNS::DRAGGER::optimizeAndUpdateDraggedLine(), PNS::LINE_PLACER::optimizeTailHeadTransition(), PNS::SHOVE::pushLineStack(), PNS::SHOVE::pushOrShoveVia(), PNS::LINE_PLACER::reduceTail(), PNS::SHOVE::replaceLine(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), PNS::LINE_PLACER::routeStep(), PNS::SHOVE::runOptimizer(), PNS::SHOVE::shoveIteration(), PNS::SHOVE::ShoveLines(), PNS::SHOVE::shoveLineToHullSet(), PNS::SHOVE::shoveMainLoop(), PNS::SHOVE::ShoveMultiLines(), PNS::SHOVE::ShoveObstacleLine(), singleStep(), PNS::DRAGGER::Start(), PNS::LINE_PLACER::Trace(), PNS::DRAGGER::tryWalkaround(), and PNS::SHOVE::unwindLineStack().

Logger()

LOGGER * PNS::ALGO_BASE::Logger ( )

virtualinherited

Reimplemented in PNS::SHOVE.

Definition at line 34 of file pns_algo_base.cpp.

{
 return nullptr;
}

Referenced by PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), PNS::DRAGGER::Start(), and PNS::DRAGGER::tryWalkaround().

nearestObstacle()

NODE::OPT_OBSTACLE PNS::WALKAROUND::nearestObstacle ( const LINE &  aPath )

private

Definition at line 43 of file pns_walkaround.cpp.

{
 NODE::OPT_OBSTACLE obs = m_world->NearestObstacle(
 &aPath, m_itemMask, m_restrictedSet.empty() ? nullptr : &m_restrictedSet, false );
 
 if( m_restrictedSet.empty() )
 return obs;
 
 else if( obs && m_restrictedSet.find ( obs->m_item ) != m_restrictedSet.end() )
 return obs;
 
 return NODE::OPT_OBSTACLE();
}

References m_itemMask, m_restrictedSet, m_world, and PNS::NODE::NearestObstacle().

Referenced by Route(), and singleStep().

RestrictToSet()

void PNS::WALKAROUND::RestrictToSet	(	bool	aEnabled,
		const std::set< ITEM * > &	aSet
	)

Definition at line 58 of file pns_walkaround.cpp.

{
 m_restrictedVertices.clear();
 
 if( aEnabled )
 m_restrictedSet = aSet;
 else
 m_restrictedSet.clear();
 
 for( auto item : aSet )
 {
  if( auto solid = dyn_cast<SOLID*>( item ) )
 {
 m_restrictedVertices.push_back( solid->Anchor( 0 ) );
 }
 }
}

References m_restrictedSet, and m_restrictedVertices.

Referenced by PNS::SHOVE::onCollidingSolid().

Route() [1/2]

const WALKAROUND::RESULT PNS::WALKAROUND::Route

(

const LINE &

aInitialPath

)

Definition at line 115 of file pns_walkaround.cpp.

{
 LINE path_cw( aInitialPath ), path_ccw( aInitialPath );
 WALKAROUND_STATUS s_cw = IN_PROGRESS, s_ccw = IN_PROGRESS;
 SHAPE_LINE_CHAIN best_path;
 RESULT result;
 
 // special case for via-in-the-middle-of-track placement
 if( aInitialPath.PointCount() <= 1 )
 {
 if( aInitialPath.EndsWithVia() && m_world->CheckColliding( &aInitialPath.Via(),
 m_itemMask ) )
 return RESULT( STUCK, STUCK );
 
 return RESULT( DONE, DONE, aInitialPath, aInitialPath );
 }
 
 start( aInitialPath );
 
 m_currentObstacle[0] = m_currentObstacle[1] = nearestObstacle( aInitialPath );
 
 result.lineCw = aInitialPath;
 result.lineCcw = aInitialPath;
 
 if( m_forceWinding )
 {
 s_cw = m_forceCw ? IN_PROGRESS : STUCK;
 s_ccw = m_forceCw ? STUCK : IN_PROGRESS;
 }
 
 // In some situations, there isn't a trivial path (or even a path at all). Hitting the
 // iteration limit causes lag, so we can exit out early if the walkaround path gets very long
 // compared with the initial path. If the length exceeds the initial length times this factor,
 // fail out.
 const int maxWalkDistFactor = 10;
 long long lengthLimit = aInitialPath.CLine().Length() * maxWalkDistFactor;
 
 while( m_iteration < m_iterationLimit )
 {
 if( s_cw != STUCK && s_cw != ALMOST_DONE )
 s_cw = singleStep( path_cw, true );
 
 if( s_ccw != STUCK && s_ccw != ALMOST_DONE )
 s_ccw = singleStep( path_ccw, false );
 
 if( s_cw != IN_PROGRESS )
 {
 result.lineCw = path_cw;
 result.statusCw = s_cw;
 }
 
 if( s_ccw != IN_PROGRESS )
 {
 result.lineCcw = path_ccw;
 result.statusCcw = s_ccw;
 }
 
 if( s_cw != IN_PROGRESS && s_ccw != IN_PROGRESS )
 break;
 
 // Safety valve
 if( path_cw.Line().Length() > lengthLimit && path_ccw.Line().Length() > lengthLimit )
 break;
 
 m_iteration++;
 }
 
 if( s_cw == IN_PROGRESS )
 {
 result.lineCw = path_cw;
 result.statusCw = ALMOST_DONE;
 }
 
 if( s_ccw == IN_PROGRESS )
 {
 result.lineCcw = path_ccw;
 result.statusCcw = ALMOST_DONE;
 }
 
 if( result.lineCw.SegmentCount() < 1 || result.lineCw.CPoint( 0 ) != aInitialPath.CPoint( 0 ) )
 {
 result.statusCw = STUCK;
 }
 
 if( result.lineCw.PointCount() > 0 && result.lineCw.CPoint( -1 ) != aInitialPath.CPoint( -1 ) )
 {
 result.statusCw = ALMOST_DONE;
 }
 
 if( result.lineCcw.SegmentCount() < 1 ||
 result.lineCcw.CPoint( 0 ) != aInitialPath.CPoint( 0 ) )
 {
 result.statusCcw = STUCK;
 }
 
 if( result.lineCcw.PointCount() > 0 &&
 result.lineCcw.CPoint( -1 ) != aInitialPath.CPoint( -1 ) )
 {
 result.statusCcw = ALMOST_DONE;
 }
 
 result.lineCw.ClearLinks();
 result.lineCcw.ClearLinks();
 
 return result;
}

References ALMOST_DONE, PNS::NODE::CheckColliding(), PNS::LINK_HOLDER::ClearLinks(), PNS::LINE::CLine(), PNS::LINE::CPoint(), DONE, PNS::LINE::EndsWithVia(), IN_PROGRESS, SHAPE_LINE_CHAIN::Length(), PNS::LINE::Line(), PNS::WALKAROUND::RESULT::lineCcw, PNS::WALKAROUND::RESULT::lineCw, m_currentObstacle, m_forceCw, m_forceWinding, m_itemMask, m_iteration, m_iterationLimit, m_world, nearestObstacle(), PNS::LINE::PointCount(), PNS::LINE::SegmentCount(), singleStep(), start(), PNS::WALKAROUND::RESULT::statusCcw, PNS::WALKAROUND::RESULT::statusCw, STUCK, and PNS::LINE::Via().

Route() [2/2]

WALKAROUND::WALKAROUND_STATUS PNS::WALKAROUND::Route	(	const LINE &	aInitialPath,
		LINE &	aWalkPath,
		bool	aOptimize = true
	)

Definition at line 223 of file pns_walkaround.cpp.

{
 LINE path_cw( aInitialPath ), path_ccw( aInitialPath );
 WALKAROUND_STATUS s_cw = IN_PROGRESS, s_ccw = IN_PROGRESS;
 SHAPE_LINE_CHAIN best_path;
 
 // special case for via-in-the-middle-of-track placement
 if( aInitialPath.PointCount() <= 1 )
 {
 if( aInitialPath.EndsWithVia() && m_world->CheckColliding( &aInitialPath.Via(),
 m_itemMask ) )
 return STUCK;
 
 aWalkPath = aInitialPath;
 return DONE;
 }
 
 start( aInitialPath );
 
 m_currentObstacle[0] = m_currentObstacle[1] = nearestObstacle( aInitialPath );
 
 aWalkPath = aInitialPath;
 
 if( m_forceWinding )
 {
 s_cw = m_forceCw ? IN_PROGRESS : STUCK;
 s_ccw = m_forceCw ? STUCK : IN_PROGRESS;
 }
 
 while( m_iteration < m_iterationLimit )
 {
 if( path_cw.PointCount() == 0 )
 s_cw = STUCK; // cw path is empty, can't continue
 
 if( path_ccw.PointCount() == 0 )
 s_ccw = STUCK; // ccw path is empty, can't continue
 
 if( s_cw != STUCK )
 s_cw = singleStep( path_cw, true );
 
 if( s_ccw != STUCK )
 s_ccw = singleStep( path_ccw, false );
 
 if( ( s_cw == DONE && s_ccw == DONE ) || ( s_cw == STUCK && s_ccw == STUCK ) )
 {
 int len_cw = path_cw.CLine().Length();
 int len_ccw = path_ccw.CLine().Length();
 
 if( m_forceLongerPath )
 aWalkPath = ( len_cw > len_ccw ? path_cw : path_ccw );
 else
 aWalkPath = ( len_cw < len_ccw ? path_cw : path_ccw );
 
 break;
 }
 else if( s_cw == DONE && !m_forceLongerPath )
 {
 aWalkPath = path_cw;
 break;
 }
 else if( s_ccw == DONE && !m_forceLongerPath )
 {
 aWalkPath = path_ccw;
 break;
 }
 
 m_iteration++;
 }
 
 if( m_iteration == m_iterationLimit )
 {
 int len_cw = path_cw.CLine().Length();
 int len_ccw = path_ccw.CLine().Length();
 
 if( m_forceLongerPath )
 aWalkPath = ( len_cw > len_ccw ? path_cw : path_ccw );
 else
 aWalkPath = ( len_cw < len_ccw ? path_cw : path_ccw );
 }
 
 aWalkPath.Line().Simplify();
 
 if( aWalkPath.SegmentCount() < 1 )
 return STUCK;
 
 if( aWalkPath.CPoint( -1 ) != aInitialPath.CPoint( -1 ) )
 return ALMOST_DONE;
 
 if( aWalkPath.CPoint( 0 ) != aInitialPath.CPoint( 0 ) )
 return STUCK;
 
 WALKAROUND_STATUS st = s_ccw == DONE || s_cw == DONE ? DONE : STUCK;
 
 if( st == DONE )
 {
 if( aOptimize )
 OPTIMIZER::Optimize( &aWalkPath, OPTIMIZER::MERGE_OBTUSE, m_world );
 }
 
 return st;
}

References ALMOST_DONE, PNS::NODE::CheckColliding(), PNS::LINE::CLine(), PNS::LINE::CPoint(), DONE, PNS::LINE::EndsWithVia(), IN_PROGRESS, SHAPE_LINE_CHAIN::Length(), PNS::LINE::Line(), m_currentObstacle, m_forceCw, m_forceLongerPath, m_forceWinding, m_itemMask, m_iteration, m_iterationLimit, m_world, PNS::OPTIMIZER::MERGE_OBTUSE, nearestObstacle(), PNS::OPTIMIZER::Optimize(), PNS::LINE::PointCount(), PNS::LINE::SegmentCount(), SHAPE_LINE_CHAIN::Simplify(), singleStep(), start(), STUCK, and PNS::LINE::Via().

Referenced by PNS::DIFF_PAIR_PLACER::attemptWalk(), PNS::SHOVE::onCollidingSolid(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), and PNS::DRAGGER::tryWalkaround().

Router()

ROUTER * PNS::ALGO_BASE::Router ( ) const

inlineinherited

Return current router settings.

Definition at line 54 of file pns_algo_base.h.

References PNS::ALGO_BASE::m_router.

Referenced by PNS::DIFF_PAIR_PLACER::attemptWalk(), PNS::MEANDER_PLACER_BASE::Clearance(), PNS::DIFF_PAIR_PLACER::CommitPlacement(), PNS::DP_MEANDER_PLACER::CommitPlacement(), PNS::LINE_PLACER::CommitPlacement(), PNS::MEANDER_PLACER::CommitPlacement(), PNS::COMPONENT_DRAGGER::FixRoute(), PNS::DRAGGER::FixRoute(), PNS::DIFF_PAIR_PLACER::initPlacement(), PNS::LINE_PLACER::initPlacement(), PNS::SHOVE::onCollidingSolid(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), PNS::DIFF_PAIR_PLACER::Start(), PNS::DP_MEANDER_PLACER::Start(), PNS::MEANDER_PLACER::Start(), PNS::MEANDER_SKEW_PLACER::Start(), PNS::DRAGGER::Start(), and PNS::DRAGGER::tryWalkaround().

SetDebugDecorator()

void PNS::ALGO_BASE::SetDebugDecorator ( DEBUG_DECORATOR *  aDecorator )

inlineinherited

Assign a debug decorator allowing this algo to draw extra graphics for visual debugging.

Definition at line 73 of file pns_algo_base.h.

 {
 m_debugDecorator = aDecorator;
 }

References PNS::ALGO_BASE::m_debugDecorator.

Referenced by PNS::SHOVE::onCollidingSolid(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), PNS::SHOVE::SHOVE(), and PNS::DRAGGER::tryWalkaround().

SetForceWinding()

void PNS::WALKAROUND::SetForceWinding ( bool  aEnabled, bool  aCw  )

inline

Definition at line 101 of file pns_walkaround.h.

 {
 m_forceCw = aCw;
 m_forceWinding = aEnabled;
 }

References m_forceCw, and m_forceWinding.

SetItemMask()

void PNS::WALKAROUND::SetItemMask ( int  aMask )

inline

Definition at line 96 of file pns_walkaround.h.

 {
 m_itemMask = aMask;
 }

References m_itemMask.

SetIterationLimit()

void PNS::WALKAROUND::SetIterationLimit ( const int  aIterLimit )

inline

Definition at line 83 of file pns_walkaround.h.

 {
 m_iterationLimit = aIterLimit;
 }

References m_iterationLimit.

Referenced by PNS::DIFF_PAIR_PLACER::attemptWalk(), PNS::SHOVE::onCollidingSolid(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), and PNS::DRAGGER::tryWalkaround().

SetLogger()

void PNS::ALGO_BASE::SetLogger ( LOGGER *  aLogger )

inlineinherited

Definition at line 65 of file pns_algo_base.h.

 {
 m_logger = aLogger;
 }

References PNS::ALGO_BASE::m_logger.

Referenced by PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), and PNS::DRAGGER::tryWalkaround().

SetSolidsOnly()

void PNS::WALKAROUND::SetSolidsOnly ( bool  aSolidsOnly )

inline

Definition at line 88 of file pns_walkaround.h.

 {
 if( aSolidsOnly )
 m_itemMask = ITEM::SOLID_T;
 else
 m_itemMask = ITEM::ANY_T;
 }

References PNS::ITEM::ANY_T, m_itemMask, and PNS::ITEM::SOLID_T.

Referenced by PNS::DIFF_PAIR_PLACER::attemptWalk(), PNS::SHOVE::onCollidingSolid(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), and PNS::DRAGGER::tryWalkaround().

Settings()

ROUTING_SETTINGS & PNS::ALGO_BASE::Settings ( ) const

inherited

Return the logger object, allowing to dump geometry to a file.

Definition at line 28 of file pns_algo_base.cpp.

{
 return m_router->Settings();
}

References PNS::ALGO_BASE::m_router, and PNS::ROUTER::Settings().

Referenced by PNS::DIFF_PAIR_PLACER::attemptWalk(), PNS::LINE_PLACER::buildInitialLine(), PNS::LINE_PLACER::CommitPlacement(), PNS::DRAGGER::dragMarkObstacles(), PNS::DRAGGER::dragShove(), PNS::DRAGGER::dragWalkaround(), PNS::COMPONENT_DRAGGER::FixRoute(), PNS::DRAGGER::FixRoute(), PNS::DIFF_PAIR_PLACER::FixRoute(), PNS::LINE_PLACER::FixRoute(), PNS::LINE_PLACER::Move(), PNS::SHOVE::onCollidingSolid(), PNS::DRAGGER::optimizeAndUpdateDraggedLine(), PNS::DIFF_PAIR_PLACER::propagateDpHeadForces(), PNS::LINE_PLACER::rhMarkObstacles(), PNS::LINE_PLACER::rhShoveOnly(), PNS::LINE_PLACER::rhWalkOnly(), PNS::DIFF_PAIR_PLACER::route(), PNS::LINE_PLACER::routeHead(), PNS::LINE_PLACER::routeStep(), PNS::SHOVE::runOptimizer(), PNS::SHOVE::shoveMainLoop(), PNS::LINE_PLACER::Start(), PNS::DRAGGER::Start(), PNS::DRAGGER::tryWalkaround(), and PNS::LINE_PLACER::UnfixRoute().

SetWorld()

void PNS::WALKAROUND::SetWorld ( NODE *  aNode )

inline

Definition at line 78 of file pns_walkaround.h.

 {
 m_world = aNode;
 }

References m_world.

Referenced by PNS::LINE_PLACER::rhShoveOnly().

singleStep()

WALKAROUND::WALKAROUND_STATUS PNS::WALKAROUND::singleStep ( LINE &  aPath, bool  aWindingDirection  )

private

Definition at line 77 of file pns_walkaround.cpp.

{
 OPT<OBSTACLE>& current_obs =
 aWindingDirection ? m_currentObstacle[0] : m_currentObstacle[1];
 
 if( !current_obs )
 return DONE;
 
 VECTOR2I initialLast = aPath.CPoint( -1 );
 
 SHAPE_LINE_CHAIN path_walk;
 
 bool s_cw = aPath.Walkaround( current_obs->m_hull, path_walk, aWindingDirection );
 
 PNS_DBG( Dbg(), BeginGroup, "hull/walk", 1 );
 PNS_DBG( Dbg(), AddShape, &current_obs->m_hull, RED, 0, wxString::Format( "hull-%s-%d", aWindingDirection ? wxT( "cw" ) : wxT( "ccw" ), m_iteration ) );
 PNS_DBG( Dbg(), AddShape, &aPath.CLine(), GREEN, 0, wxString::Format( "path-%s-%d", aWindingDirection ? wxT( "cw" ) : wxT( "ccw" ), m_iteration ) );
 PNS_DBG( Dbg(), AddShape, &path_walk, BLUE, 0, wxString::Format( "result-%s-%d", aWindingDirection ? wxT( "cw" ) : wxT( "ccw" ), m_iteration ) );
 PNS_DBG( Dbg(), Message, wxString::Format( wxT( "Stat cw %d" ), !!s_cw ) );
 PNS_DBGN( Dbg(), EndGroup );
 
 path_walk.Simplify();
 aPath.SetShape( path_walk );
 
 // If the end of the line is inside an obstacle, additional walkaround iterations are not
 // going to help. Exit now to prevent pegging the iteration limiter and causing lag.
 if( current_obs && current_obs->m_hull.PointInside( initialLast ) &&
 !current_obs->m_hull.PointOnEdge( initialLast ) )
 {
 return ALMOST_DONE;
 }
 
 current_obs = nearestObstacle( LINE( aPath, path_walk ) );
 
 return IN_PROGRESS;
}

References ALMOST_DONE, BLUE, PNS::LINE::CLine(), PNS::LINE::CPoint(), PNS::ALGO_BASE::Dbg(), DONE, Format(), GREEN, IN_PROGRESS, m_currentObstacle, m_iteration, nearestObstacle(), PNS_DBG, PNS_DBGN, RED, PNS::LINE::SetShape(), SHAPE_LINE_CHAIN::Simplify(), and PNS::LINE::Walkaround().

Referenced by Route().

start()

void PNS::WALKAROUND::start ( const LINE &  aInitialPath )

private

Definition at line 36 of file pns_walkaround.cpp.

{
 m_iteration = 0;
 m_iterationLimit = 50;
}

References m_iteration, and m_iterationLimit.

Referenced by Route().

VisibleViewArea()

const BOX2I & PNS::ALGO_BASE::VisibleViewArea ( ) const

inherited

Definition at line 40 of file pns_algo_base.cpp.

{
 return m_router->VisibleViewArea();
}

References PNS::ALGO_BASE::m_router, and PNS::ROUTER::VisibleViewArea().

Referenced by PNS::DRAGGER::optimizeAndUpdateDraggedLine(), and PNS::SHOVE::runOptimizer().

Member Data Documentation

DefaultIterationLimit

const int PNS::WALKAROUND::DefaultIterationLimit = 50

staticprivate

Definition at line 37 of file pns_walkaround.h.

m_currentObstacle

NODE::OPT_OBSTACLE PNS::WALKAROUND::m_currentObstacle[2]

private

Definition at line 128 of file pns_walkaround.h.

Referenced by Route(), and singleStep().

m_cursorPos

VECTOR2I PNS::WALKAROUND::m_cursorPos

private

Definition at line 127 of file pns_walkaround.h.

m_debugDecorator

DEBUG_DECORATOR* PNS::ALGO_BASE::m_debugDecorator

protectedinherited

Definition at line 86 of file pns_algo_base.h.

Referenced by PNS::ALGO_BASE::Dbg(), and PNS::ALGO_BASE::SetDebugDecorator().

m_forceCw

bool PNS::WALKAROUND::m_forceCw

private

Definition at line 126 of file pns_walkaround.h.

Referenced by Route(), SetForceWinding(), and WALKAROUND().

m_forceLongerPath

bool PNS::WALKAROUND::m_forceLongerPath

private

Definition at line 131 of file pns_walkaround.h.

Referenced by Route(), and WALKAROUND().

m_forceWinding

bool PNS::WALKAROUND::m_forceWinding

private

Definition at line 125 of file pns_walkaround.h.

Referenced by Route(), SetForceWinding(), and WALKAROUND().

m_itemMask

int PNS::WALKAROUND::m_itemMask

private

Definition at line 124 of file pns_walkaround.h.

Referenced by nearestObstacle(), Route(), SetItemMask(), SetSolidsOnly(), and WALKAROUND().

m_iteration

int PNS::WALKAROUND::m_iteration

private

Definition at line 122 of file pns_walkaround.h.

Referenced by Route(), singleStep(), start(), and WALKAROUND().

m_iterationLimit

int PNS::WALKAROUND::m_iterationLimit

private

Definition at line 123 of file pns_walkaround.h.

Referenced by Route(), SetIterationLimit(), and start().

m_logger

LOGGER* PNS::ALGO_BASE::m_logger

protectedinherited

Definition at line 88 of file pns_algo_base.h.

Referenced by PNS::ALGO_BASE::SetLogger().

m_restrictedSet

std::set<ITEM*> PNS::WALKAROUND::m_restrictedSet

private

Definition at line 129 of file pns_walkaround.h.

Referenced by nearestObstacle(), and RestrictToSet().

m_restrictedVertices

std::vector<VECTOR2I> PNS::WALKAROUND::m_restrictedVertices

private

Definition at line 130 of file pns_walkaround.h.

Referenced by RestrictToSet().

m_router

ROUTER* PNS::ALGO_BASE::m_router

protectedinherited

Definition at line 87 of file pns_algo_base.h.

Referenced by PNS::MEANDER_PLACER_BASE::lineLength(), PNS::ALGO_BASE::Router(), PNS::ALGO_BASE::Settings(), PNS::DIFF_PAIR_PLACER::updateLeadingRatLine(), PNS::LINE_PLACER::updateLeadingRatLine(), and PNS::ALGO_BASE::VisibleViewArea().

m_world

NODE* PNS::WALKAROUND::m_world

private

Definition at line 120 of file pns_walkaround.h.

Referenced by nearestObstacle(), Route(), and SetWorld().

---

The documentation for this class was generated from the following files:

• pns_walkaround.h
• pns_walkaround.cpp