Home
last modified time | relevance | path

Searched refs:childScore (Results 1 – 5 of 5) sorted by relevance

/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/cover_tree/
H A Dsingle_tree_traverser_impl.hpp158 const double childScore = rule.Score(queryIndex, *node); in Traverse() local
162 if (childScore == DBL_MAX) in Traverse()
187 newFrame.score = childScore; in Traverse()
H A Ddual_tree_traverser_impl.hpp331 double childScore = rule.Score(queryNode, refNode->Child(j)); in ReferenceRecursion() local
332 if (childScore == DBL_MAX) in ReferenceRecursion()
344 newFrame.score = childScore; // Use the score of the parent. in ReferenceRecursion()
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/spill_tree/
H A Dspill_dual_tree_traverser_impl.hpp89 const double childScore = rule.Score(queryIndex, referenceNode); in Traverse() local
91 if (childScore == DBL_MAX) in Traverse()
148 const double childScore = rule.Score(queryIndex, referenceNode); in Traverse() local
150 if (childScore == DBL_MAX) in Traverse()
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/rectangle_tree/
H A Ddual_tree_traverser_impl.hpp75 const double childScore = rule.Score(queryNode.Point(query), in Traverse() local
78 if (childScore == DBL_MAX) in Traverse()
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/core/tree/binary_space_tree/
H A Ddual_tree_traverser_impl.hpp83 const double childScore = rule.Score(query, referenceNode); in Traverse() local
85 if (childScore == DBL_MAX) in Traverse()