apaam/mlpack
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Suggested Changes

Browse Source
This commit is contained in:
Manish
2018-02-12 22:47:20 +05:30
parent edcb00749d
commit 7dde697267
2 changed files with 6 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/mlpack/core/tree/greedy_single_tree_traverser.hpp
+4 -1
View File
@@ -41,7 +41,10 @@ class GreedySingleTreeTraverser
size_t NumPrunes() const { return numPrunes; }
//! Set value of minBaseCases.
void MinBaseCases(size_t baseCases) { minBaseCases = baseCases; }
size_t& MinBaseCases() { return minBaseCases; }
//! Get value of minBaseCases.
size_t MinBaseCases() const { return minBaseCases; }
private:
//! Reference to the rules with which the tree will be traversed.
src/mlpack/methods/neighbor_search/neighbor_search_impl.hpp
+2 -2
View File
@@ -663,7 +663,7 @@ DualTreeTraversalType, SingleTreeTraversalType>::Search(
tree::GreedySingleTreeTraverser<Tree, RuleType> traverser(rules);
// Set the value of minBaseCases.
traverser.MinBaseCases(k);
traverser.MinBaseCases() = k;
// Now have it traverse for each point.
for (size_t i = 0; i < querySet.n_cols; ++i)
@@ -963,7 +963,7 @@ DualTreeTraversalType, SingleTreeTraversalType>::Search(
tree::GreedySingleTreeTraverser<Tree, RuleType> traverser(rules);
// Set the value of minBaseCases.
traverser.MinBaseCases(k);
traverser.MinBaseCases() = k;
// Now have it traverse for each point.
for (size_t i = 0; i < referenceSet->n_cols; ++i)