Search Toolkit Book for CAlignDistGraph
Definition at line 908 of file merge_tree.cpp.
◆ TAlignEquivListMap ◆ TIndexDistMap ◆ TIndexIndexMap ◆ CAlignDistGraph() [1/2] ◆ CAlignDistGraph() [2/2] ◆ AddAlignment() ◆ CalculateAllDistances() void CAlignDistGraph::CalculateAllDistances ( ) inline ◆ Empty() bool CAlignDistGraph::Empty ( void ) const inline ◆ GetAndRemoveNearestPair()Definition at line 1030 of file merge_tree.cpp.
References AlignEquivMap, CD, map_checker< Container >::empty(), map_checker< Container >::erase(), map_checker< Container >::insert(), ITERATE, max(), NearestDistMap, NearestMap, map_checker< Container >::size(), and x_CalculateOneDistance().
Referenced by CTreeAlignMerger::x_Merge_Dist_Impl().
◆ GetLastAlignEquivs() ◆ Print() void CAlignDistGraph::Print ( void ) ◆ RemoveEquivs()Definition at line 1098 of file merge_tree.cpp.
References AlignEquivMap, map_checker< Container >::end(), map_checker< Container >::erase(), ERASE_ITERATE, map_checker< Container >::find(), map_checker< Container >::insert(), ITERATE, m_EquivRangeBuilder, max(), CEquivRangeBuilder::MergeAbuttings(), NearestDistMap, NearestMap, CEquivRangeBuilder::SplitIntersections(), and x_CalculateOneDistance().
Referenced by CTreeAlignMerger::x_Merge_Dist_Impl().
◆ Size() size_t CAlignDistGraph::Size ( void ) const inline ◆ x_CalculateAllDistances() void CAlignDistGraph::x_CalculateAllDistances ( ) private ◆ x_CalculateOneDistance() void CAlignDistGraph::x_CalculateOneDistance ( size_t CalcIndex ) private ◆ AlignEquivMap ◆ m_EquivRangeBuilder ◆ m_NextIndex size_t CAlignDistGraph::m_NextIndex private ◆ NearestDistMap ◆ NearestMapThe documentation for this class was generated from the following file:
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4