From 571c8db33681cdceb22a95b8b6478737ea550f32 Mon Sep 17 00:00:00 2001
From: Ryan Curtin <ryan@ratml.org>
Date: Mon, 3 Oct 2016 16:04:21 -0400
Subject: [PATCH] Minor optimization: reserve full vector.

---
 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 7058adb002..7ea66908f2 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.