Classes | |
class | _Alloc_base |
class | _Base_iterator |
struct | _Bracket_accessor |
class | _Iterator |
struct | _Node |
struct | _Node_base |
class | _Node_compare |
struct | _Region |
struct | always_true |
class | KDTree |
struct | squared_difference |
struct | squared_difference_counted |
Functions | |
template<typename _ValA , typename _ValB , typename _Cmp , typename _Acc > | |
bool | _S_node_compare (const size_t __dim, const _Cmp &__cmp, const _Acc &__acc, const _ValA &__a, const _ValB &__b) |
template<typename _ValA , typename _ValB , typename _Dist , typename _Acc > | |
_Dist::distance_type | _S_node_distance (const size_t __dim, const _Dist &__dist, const _Acc &__acc, const _ValA &__a, const _ValB &__b) |
template<typename _ValA , typename _ValB , typename _Dist , typename _Acc > | |
_Dist::distance_type | _S_accumulate_node_distance (const size_t __dim, const _Dist &__dist, const _Acc &__acc, const _ValA &__a, const _ValB &__b) |
template<typename _Val , typename _Cmp , typename _Acc , typename NodeType > | |
const NodeType * | _S_node_descend (const size_t __dim, const _Cmp &__cmp, const _Acc &__acc, const _Val &__val, const NodeType *__node) |
template<class SearchVal , typename NodeType , typename _Cmp , typename _Acc , typename _Dist , typename _Predicate > | |
std::pair< const NodeType *, std::pair< size_t, typename _Dist::distance_type > > | _S_node_nearest (const size_t __k, size_t __dim, SearchVal const &__val, const NodeType *__node, const _Node_base *__end, const NodeType *__best, typename _Dist::distance_type __max, const _Cmp &__cmp, const _Acc &__acc, const _Dist &__dist, _Predicate __p) |
template<typename _Val , typename _Ref , typename _Ptr > | |
bool | operator== (_Iterator< _Val, _Ref, _Ptr > const &, _Iterator< _Val, _Ref, _Ptr > const &) |
template<typename _Val > | |
bool | operator== (_Iterator< _Val, const _Val &, const _Val *> const &, _Iterator< _Val, _Val &, _Val *> const &) |
template<typename _Val > | |
bool | operator== (_Iterator< _Val, _Val &, _Val *> const &, _Iterator< _Val, const _Val &, const _Val *> const &) |
template<typename _Val , typename _Ref , typename _Ptr > | |
bool | operator!= (_Iterator< _Val, _Ref, _Ptr > const &, _Iterator< _Val, _Ref, _Ptr > const &) |
template<typename _Val > | |
bool | operator!= (_Iterator< _Val, const _Val &, const _Val *> const &, _Iterator< _Val, _Val &, _Val *> const &) |
template<typename _Val > | |
bool | operator!= (_Iterator< _Val, _Val &, _Val *> const &, _Iterator< _Val, const _Val &, const _Val *> const &) |
|
inline |
Compute the distance between two values and accumulate the result for all dimensions.
The distance functor and the accessor are references to the template parameters of the KDTree.
Referenced by KDTree< 2, KDTreeFeatureNode >::find_nearest(), and KDTree< 2, KDTreeFeatureNode >::find_nearest_if().
|
inline |
Compare two values on the same dimension using a comparison functor _Cmp and an accessor _Acc.
The comparison functor and the accessor are references to the template parameters of the KDTree.
Referenced by _S_node_descend(), and _S_node_nearest().
|
inline |
Descend on the left or the right of the node according to the comparison between the node's value and the value.
References _S_node_compare().
Referenced by _S_node_nearest().
|
inline |
Compute the distance between two values for one dimension only.
The distance functor and the accessor are references to the template parameters of the KDTree.
Referenced by _S_node_nearest().
|
inline |
Find the nearest node to __val from __node
If many nodes are equidistant to __val, the node with the lowest memory address is returned.
References _S_node_compare(), _S_node_descend(), and _S_node_distance().
Referenced by KDTree< 2, KDTreeFeatureNode >::find_nearest(), and KDTree< 2, KDTreeFeatureNode >::find_nearest_if().
|
inline |
References _Base_iterator::_M_node.
Referenced by DataValue::hasUnit(), ProteinHit::ScoreLess::operator()(), BaseFeature::QualityLess::operator()(), PeptideHit::PepXMLAnalysisResult::operator=(), IMSElement::setIsotopeDistribution(), IMSIsotopeDistribution::size(), VersionInfo::VersionDetails::VersionDetails(), and PeptideEvidence::~PeptideEvidence().
|
inline |
References _Base_iterator::_M_node.
|
inline |
References _Base_iterator::_M_node.
|
inline |
References _Base_iterator::_M_node.
Referenced by ClusteredMS2ConsensusSpectrum::ClusteredMS2ConsensusSpectrum(), Map< char, double >::equals(), DataValue::hasUnit(), MS2Feature::MS2Feature(), RichPeak2D::operator!=(), BinnedSpectrum::operator!=(), MSSpectrum::operator!=(), MSChromatogram::operator!=(), Peak1D::operator!=(), ChromatogramPeak::operator!=(), Peak2D::operator!=(), ProteinHit::ScoreLess::operator()(), BaseFeature::QualityLess::operator()(), PeptideHit::PepXMLAnalysisResult::operator=(), IMSElement::setIsotopeDistribution(), IMSIsotopeDistribution::size(), VersionInfo::VersionDetails::VersionDetails(), MSChromatogram::~MSChromatogram(), MSSpectrum::~MSSpectrum(), and PeptideEvidence::~PeptideEvidence().
|
inline |
References _Base_iterator::_M_node.
|
inline |
References _Base_iterator::_M_node.
OpenMS / TOPP release 2.3.0 | Documentation generated on Tue Jan 9 2018 18:22:06 using doxygen 1.8.13 |