Bertini 2 d882924 (2026-10-06 19:56 UTC)
Numerical algebraic geometry library (C++ core)
Loading...
Searching...
No Matches
bertini::algorithm::MidpathChecker< RealT, ComplexT, MetaDataType >::CrossedPath Struct Reference

Stores data for each path that crosses, including the index of the path, all paths that it crosses with, and whether it has the same starting point as a path it crosses with. More...

#include <midpath_check.hpp>

Public Member Functions

 CrossedPath (PathIndT index, PathIndT crossed_with, bool same_start)
 Record a path crossing.
PathIndT index () const
void crossed_with (std::pair< PathIndT, bool > crossed)
 Record an additional path that this one crosses with.
void rerun (bool same_start)
 Update whether this path needs rerunning, given another crossing.
bool rerun () const

Detailed Description

template<typename RealT, typename ComplexT, typename MetaDataType>
struct bertini::algorithm::MidpathChecker< RealT, ComplexT, MetaDataType >::CrossedPath

Stores data for each path that crosses, including the index of the path, all paths that it crosses with, and whether it has the same starting point as a path it crosses with.

Constructor & Destructor Documentation

◆ CrossedPath()

template<typename RealT, typename ComplexT, typename MetaDataType>
bertini::algorithm::MidpathChecker< RealT, ComplexT, MetaDataType >::CrossedPath::CrossedPath ( PathIndT index,
PathIndT crossed_with,
bool same_start )
inline

Record a path crossing.

Parameters
indexThe index of this path.
crossed_withThe index of a path it crosses with.
same_startWhether the two paths share the same starting point.

Member Function Documentation

◆ crossed_with()

template<typename RealT, typename ComplexT, typename MetaDataType>
void bertini::algorithm::MidpathChecker< RealT, ComplexT, MetaDataType >::CrossedPath::crossed_with ( std::pair< PathIndT, bool > crossed)
inline

Record an additional path that this one crosses with.

Parameters
crossedThe (path index, same-start) pair to add.

◆ index()

template<typename RealT, typename ComplexT, typename MetaDataType>
PathIndT bertini::algorithm::MidpathChecker< RealT, ComplexT, MetaDataType >::CrossedPath::index ( ) const
inline
Returns
The index of this path.

◆ rerun() [1/2]

template<typename RealT, typename ComplexT, typename MetaDataType>
bool bertini::algorithm::MidpathChecker< RealT, ComplexT, MetaDataType >::CrossedPath::rerun ( ) const
inline
Returns
Whether this path needs to be rerun.

◆ rerun() [2/2]

template<typename RealT, typename ComplexT, typename MetaDataType>
void bertini::algorithm::MidpathChecker< RealT, ComplexT, MetaDataType >::CrossedPath::rerun ( bool same_start)
inline

Update whether this path needs rerunning, given another crossing.

Parameters
same_startWhether the crossing path shares the same starting point.