From 80f990b8e3d05e47e041685a7811f1352d03ad4d Mon Sep 17 00:00:00 2001
From: Noel Grandin <noel.grandin@collabora.co.uk>
Date: Tue, 4 Sep 2018 18:03:28 +0200
Subject: clang-tidy performance-inefficient-vector-operation

Change-Id: Iebcaea7b08c5284946d83b6b6b9ed26b218025d4
Reviewed-on: https://gerrit.libreoffice.org/59992
Tested-by: Jenkins
Reviewed-by: Noel Grandin <noel.grandin@collabora.co.uk>
---
 unotools/source/config/dynamicmenuoptions.cxx | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

(limited to 'unotools')

diff --git a/unotools/source/config/dynamicmenuoptions.cxx b/unotools/source/config/dynamicmenuoptions.cxx
index 0ead1d8e76ce..871886b238d0 100644
--- a/unotools/source/config/dynamicmenuoptions.cxx
+++ b/unotools/source/config/dynamicmenuoptions.cxx
@@ -490,7 +490,8 @@ void SvtDynamicMenuOptions_Impl::impl_SortAndExpandPropertyNames( const Sequence
     lDestination.realloc( (nSourceCount*PROPERTYCOUNT)+nDestinationStep ); // get enough memory for copy operations after nDestination ...
 
     // Copy all items to temp. vector to use fast sort operations :-)
-    for( sal_Int32 nSourceStep=0; nSourceStep<nSourceCount; ++nSourceStep )
+    lTemp.reserve(nSourceCount);
+    for (sal_Int32 nSourceStep = 0; nSourceStep < nSourceCount; ++nSourceStep)
         lTemp.push_back( lSource[nSourceStep] );
 
     // Sort all entries by number ...
-- 
cgit