comphelper/qa/unit/parallelsorttest.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  */
   9
  10 #include <comphelper/parallelsort.hxx>
  11 #include <comphelper/threadpool.hxx>
  12 #include <rtl/string.hxx>
  13 #include <cppunit/TestAssert.h>
  14 #include <cppunit/TestFixture.h>
  15 #include <cppunit/extensions/HelperMacros.h>
  16 #include <cppunit/plugin/TestPlugIn.h>
  17
  18 #include <cstdlib>
  19 #include <vector>
  20 #include <algorithm>
  21 #include <random>
  22
  23 class ParallelSortTest : public CppUnit::TestFixture
  24 {
  25 public:
  26     void testSortTiny();
  27     void testSortMedium();
  28     void testSortBig();
  29
  30     virtual void setUp() override;
  31     virtual void tearDown() override;
  32
  33     CPPUNIT_TEST_SUITE(ParallelSortTest);
  34     CPPUNIT_TEST(testSortTiny);
  35     CPPUNIT_TEST(testSortMedium);
  36     CPPUNIT_TEST(testSortBig);
  37     CPPUNIT_TEST_SUITE_END();
  38
  39 private:
  40     void sortTest(size_t nLen);
  41     void fillRandomUptoN(std::vector<size_t>& rVector, size_t N);
  42
  43     comphelper::ThreadPool* pThreadPool;
  44     size_t mnThreads;
  45 };
  46
  47 void ParallelSortTest::setUp()
  48 {
  49     pThreadPool = &comphelper::ThreadPool::getSharedOptimalPool();
  50     mnThreads = pThreadPool->getWorkerCount();
  51 }
  52
  53 void ParallelSortTest::tearDown()
  54 {
  55     if (pThreadPool)
  56         pThreadPool->joinThreadsIfIdle();
  57 }
  58
  59 void ParallelSortTest::fillRandomUptoN(std::vector<size_t>& rVector, size_t N)
  60 {
  61     rVector.resize(N);
  62     for (size_t nIdx = 0; nIdx < N; ++nIdx)
  63         rVector[nIdx] = nIdx;
  64     std::shuffle(rVector.begin(), rVector.end(), std::default_random_engine(42));
  65 }
  66
  67 void ParallelSortTest::sortTest(size_t nLen)
  68 {
  69     std::vector<size_t> aVector(nLen);
  70     fillRandomUptoN(aVector, nLen);
  71     comphelper::parallelSort(aVector.begin(), aVector.end());
  72     for (size_t nIdx = 0; nIdx < nLen; ++nIdx)
  73     {
  74         OString aMsg = "Wrong aVector[" + OString::number(nIdx) + "]";
  75         CPPUNIT_ASSERT_EQUAL_MESSAGE(aMsg.getStr(), nIdx, aVector[nIdx]);
  76     }
  77 }
  78
  79 void ParallelSortTest::testSortTiny()
  80 {
  81     sortTest(5);
  82     sortTest(15);
  83     sortTest(16);
  84     sortTest(17);
  85 }
  86
  87 void ParallelSortTest::testSortMedium()
  88 {
  89     sortTest(1025);
  90     sortTest(1029);
  91     sortTest(1024 * 2 + 1);
  92     sortTest(1024 * 2 + 9);
  93 }
  94
  95 void ParallelSortTest::testSortBig() { sortTest(1024 * 16 + 3); }
  96
  97 CPPUNIT_TEST_SUITE_REGISTRATION(ParallelSortTest);
  98
  99 CPPUNIT_PLUGIN_IMPLEMENT();
 100
 101 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */