CAPD RedHom Library
|
#include <capd/apiRedHom/Algorithms.h>
Public Types | |
typedef std::vector< std::pair< bool, SimplicialComplex::CellCode > > | FiltrationStep |
typedef FiniteTopologicalSpace::APIComplex::CellCode | CellCode |
typedef std::function< bool(CellCode, CellCode)> | IsInOpenSet |
typedef std::function< IsInOpenSet(size_t step)> | IsInOpenSetAtStep |
Public Member Functions | |
BuildFiniteTopologicalSpaceZigZagByIntersections (FiniteTopologicalSpace &finiteTopologicalSpace, size_t numberOfSteps, IsInOpenSetAtStep isInOpenSetAtStep) | |
void | operator() () |
size_t | filtrationSteps () |
FiltrationStep | filtrationStep (size_t filtrationIdx) |
template<typename F > | |
void | call (F f) |
Static Public Member Functions | |
static bool | Enabled () |
typedef FiniteTopologicalSpace::APIComplex::CellCode capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::CellCode |
typedef std::vector<std::pair<bool, SimplicialComplex::CellCode> > capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::FiltrationStep |
typedef std::function<bool(CellCode, CellCode)> capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::IsInOpenSet |
typedef std::function<IsInOpenSet(size_t step)> capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::IsInOpenSetAtStep |
|
inline |
void capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::call | ( | F | f | ) |
|
static |
auto capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::filtrationStep | ( | size_t | filtrationIdx | ) |
size_t capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::filtrationSteps | ( | ) |
void capd::apiRedHom::BuildFiniteTopologicalSpaceZigZagByIntersections::operator() | ( | ) |