sc/qa/unit/mark_test.cxx | 6 ++----
1 file changed, 2 insertions(+), 4 deletions(-)
New commits:
commit 28c526bc88dad00c74fba969fd76032ac94801fe
Author: Manish <mbera.de...@gmail.com>
AuthorDate: Mon Dec 9 20:51:09 2024 +0530
Commit: Ilmari Lauhakangas <ilmari.lauhakan...@libreoffice.org>
CommitDate: Tue Dec 10 11:36:58 2024 +0100
tdf#163738 use insert function instead of for loop
Change-Id: I8e2d361459ed0db3bea28a0df9550d298145110b
Reviewed-on: https://gerrit.libreoffice.org/c/core/+/178158
Reviewed-by: Ilmari Lauhakangas <ilmari.lauhakan...@libreoffice.org>
Tested-by: Jenkins
diff --git a/sc/qa/unit/mark_test.cxx b/sc/qa/unit/mark_test.cxx
index bca735aae202..ed46311dc82d 100644
--- a/sc/qa/unit/mark_test.cxx
+++ b/sc/qa/unit/mark_test.cxx
@@ -139,11 +139,9 @@ static void lcl_GetSortedRanges( const ScRangeList&
rRangeList, ScRangeList& rRa
std::vector<ScRange> aRanges;
size_t nSize = rRangeList.size();
aRanges.reserve( nSize );
- for ( size_t nIdx = 0; nIdx < nSize; ++nIdx )
- aRanges.push_back( rRangeList[nIdx] );
+ aRanges.insert(aRanges.end(), rRangeList.begin(), rRangeList.end());
std::sort( aRanges.begin(), aRanges.end() );
- for ( size_t nIdx = 0; nIdx < nSize; ++nIdx )
- rRangeListOut.push_back( aRanges[nIdx] );
+ rRangeListOut.insert(rRangeListOut.end(), aRanges.begin(), aRanges.end());
}
void Test::testSimpleMark( const ScRange& rRange, const ScRange&
rSelectionCover,
