[mlpack-git] master, mlpack-1.0.x: The Prescore() and PrescoreQ() functions aren't used anymore because I figured out how to do child-parent and parent-parent prunes without them using the TraversalInfo object. (8ded964)

gitdub at big.cc.gt.atl.ga.us gitdub at big.cc.gt.atl.ga.us
Thu Mar 5 21:44:10 EST 2015


Repository : https://github.com/mlpack/mlpack

On branches: master,mlpack-1.0.x
Link       : https://github.com/mlpack/mlpack/compare/904762495c039e345beba14c1142fd719b3bd50e...f94823c800ad6f7266995c700b1b630d5ffdcf40

>---------------------------------------------------------------

commit 8ded964c17fccaabf7a8db7c572c2e44327f833c
Author: Ryan Curtin <ryan at ratml.org>
Date:   Wed Feb 19 22:18:07 2014 +0000

    The Prescore() and PrescoreQ() functions aren't used anymore because I figured
    out how to do child-parent and parent-parent prunes without them using the
    TraversalInfo object.


>---------------------------------------------------------------

8ded964c17fccaabf7a8db7c572c2e44327f833c
 src/mlpack/methods/rann/ra_search_rules.hpp | 22 ----------------------
 1 file changed, 22 deletions(-)

diff --git a/src/mlpack/methods/rann/ra_search_rules.hpp b/src/mlpack/methods/rann/ra_search_rules.hpp
index e53be47..73d6b27 100644
--- a/src/mlpack/methods/rann/ra_search_rules.hpp
+++ b/src/mlpack/methods/rann/ra_search_rules.hpp
@@ -36,28 +36,6 @@ class RASearchRules
   double BaseCase(const size_t queryIndex, const size_t referenceIndex);
 
   /**
-   * TOFIX: This function is specified for the cover tree (usually) so
-   *   I need to think about it more algorithmically and keep its
-   *   implementation mostly empty.
-   *   Also, since the access to the points in the subtree of a cover tree
-   *   is non-trivial, we might have to re-work this.
-   *   FOR NOW: I am just using as for a BSP-tree, I will fix it when
-   *   we figure out cover trees.
-   *
-   */
-
-  double Prescore(TreeType& queryNode,
-                  TreeType& referenceNode,
-                  TreeType& referenceChildNode,
-                  const double baseCaseResult) const;
-  double PrescoreQ(TreeType& queryNode,
-                   TreeType& queryChildNode,
-                   TreeType& referenceNode,
-                   const double baseCaseResult) const;
-
-
-
-  /**
    * Get the score for recursion order.  A low score indicates priority for
    * recursion, while DBL_MAX indicates that the node should not be recursed
    * into at all (it should be pruned).



More information about the mlpack-git mailing list