summaryrefslogtreecommitdiffstats
path: root/comphelper/qa/unit/parallelsorttest.cxx
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 16:51:28 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 16:51:28 +0000
commit940b4d1848e8c70ab7642901a68594e8016caffc (patch)
treeeb72f344ee6c3d9b80a7ecc079ea79e9fba8676d /comphelper/qa/unit/parallelsorttest.cxx
parentInitial commit. (diff)
downloadlibreoffice-940b4d1848e8c70ab7642901a68594e8016caffc.tar.xz
libreoffice-940b4d1848e8c70ab7642901a68594e8016caffc.zip
Adding upstream version 1:7.0.4.upstream/1%7.0.4upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'comphelper/qa/unit/parallelsorttest.cxx')
-rw-r--r--comphelper/qa/unit/parallelsorttest.cxx101
1 files changed, 101 insertions, 0 deletions
diff --git a/comphelper/qa/unit/parallelsorttest.cxx b/comphelper/qa/unit/parallelsorttest.cxx
new file mode 100644
index 000000000..90dcb3c23
--- /dev/null
+++ b/comphelper/qa/unit/parallelsorttest.cxx
@@ -0,0 +1,101 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
+/*
+ * This file is part of the LibreOffice project.
+ *
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/.
+ */
+
+#include <comphelper/parallelsort.hxx>
+#include <comphelper/threadpool.hxx>
+#include <rtl/string.hxx>
+#include <cppunit/TestAssert.h>
+#include <cppunit/TestFixture.h>
+#include <cppunit/extensions/HelperMacros.h>
+#include <cppunit/plugin/TestPlugIn.h>
+
+#include <cstdlib>
+#include <vector>
+#include <algorithm>
+#include <random>
+
+class ParallelSortTest : public CppUnit::TestFixture
+{
+public:
+ void testSortTiny();
+ void testSortMedium();
+ void testSortBig();
+
+ virtual void setUp() override;
+ virtual void tearDown() override;
+
+ CPPUNIT_TEST_SUITE(ParallelSortTest);
+ CPPUNIT_TEST(testSortTiny);
+ CPPUNIT_TEST(testSortMedium);
+ CPPUNIT_TEST(testSortBig);
+ CPPUNIT_TEST_SUITE_END();
+
+private:
+ void sortTest(size_t nLen);
+ void fillRandomUptoN(std::vector<size_t>& rVector, size_t N);
+
+ comphelper::ThreadPool* pThreadPool;
+ size_t mnThreads;
+};
+
+void ParallelSortTest::setUp()
+{
+ pThreadPool = &comphelper::ThreadPool::getSharedOptimalPool();
+ mnThreads = pThreadPool->getWorkerCount();
+}
+
+void ParallelSortTest::tearDown()
+{
+ if (pThreadPool)
+ pThreadPool->joinAll();
+}
+
+void ParallelSortTest::fillRandomUptoN(std::vector<size_t>& rVector, size_t N)
+{
+ rVector.resize(N);
+ for (size_t nIdx = 0; nIdx < N; ++nIdx)
+ rVector[nIdx] = nIdx;
+ std::shuffle(rVector.begin(), rVector.end(), std::default_random_engine(42));
+}
+
+void ParallelSortTest::sortTest(size_t nLen)
+{
+ std::vector<size_t> aVector(nLen);
+ fillRandomUptoN(aVector, nLen);
+ comphelper::parallelSort(aVector.begin(), aVector.end());
+ for (size_t nIdx = 0; nIdx < nLen; ++nIdx)
+ {
+ OString aMsg = "Wrong aVector[" + OString::number(nIdx) + "]";
+ CPPUNIT_ASSERT_EQUAL_MESSAGE(aMsg.getStr(), nIdx, aVector[nIdx]);
+ }
+}
+
+void ParallelSortTest::testSortTiny()
+{
+ sortTest(5);
+ sortTest(15);
+ sortTest(16);
+ sortTest(17);
+}
+
+void ParallelSortTest::testSortMedium()
+{
+ sortTest(1025);
+ sortTest(1029);
+ sortTest(1024 * 2 + 1);
+ sortTest(1024 * 2 + 9);
+}
+
+void ParallelSortTest::testSortBig() { sortTest(1024 * 16 + 3); }
+
+CPPUNIT_TEST_SUITE_REGISTRATION(ParallelSortTest);
+
+CPPUNIT_PLUGIN_IMPLEMENT();
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */