[mlpack-git] master: Minor optimization: reserve full vector. (571c8db)
gitdub at mlpack.org
gitdub at mlpack.org
Mon Oct 3 16:04:21 EDT 2016
Repository : https://github.com/mlpack/mlpack
On branch : master
Link : https://github.com/mlpack/mlpack/compare/9ef7339d40550a974b3939e9fcb966fac2c09065...ebdb5abeaa3fd621a06ae663862bb72df76d2b40
>---------------------------------------------------------------
commit 571c8db33681cdceb22a95b8b6478737ea550f32
Author: Ryan Curtin <ryan at ratml.org>
Date: Mon Oct 3 16:04:21 2016 -0400
Minor optimization: reserve full vector.
>---------------------------------------------------------------
571c8db33681cdceb22a95b8b6478737ea550f32
src/mlpack/core/tree/octree/dual_tree_traverser_impl.hpp | 5 +++--
1 file changed, 3 insertions(+), 2 deletions(-)
diff --git a/src/mlpack/core/tree/octree/dual_tree_traverser_impl.hpp b/src/mlpack/core/tree/octree/dual_tree_traverser_impl.hpp
index 7058adb..7ea6690 100644
--- a/src/mlpack/core/tree/octree/dual_tree_traverser_impl.hpp
+++ b/src/mlpack/core/tree/octree/dual_tree_traverser_impl.hpp
@@ -81,12 +81,13 @@ void Octree<MetricType, StatisticType, MatType>::DualTreeTraverser<RuleType>::
// We have to recurse down the reference node, so we need to do it in an
// ordered manner.
arma::vec scores(referenceNode.NumChildren());
- std::vector<typename RuleType::TraversalInfoType> tis;
+ std::vector<typename RuleType::TraversalInfoType>
+ tis(referenceNode.NumChildren());
for (size_t i = 0; i < referenceNode.NumChildren(); ++i)
{
rule.TraversalInfo() = traversalInfo;
scores[i] = rule.Score(queryNode, referenceNode.Child(i));
- tis.push_back(rule.TraversalInfo());
+ tis[i] = rule.TraversalInfo();
}
// Sort the scores.
More information about the mlpack-git
mailing list