46d0afba73
and use it for the pivot table construction routine processBuckets(). The implementation uses ideas from the non-parallel sample sort discussed in the below paper, but parallelizes the "binning"/"classification" operations and the sorting of the bins themselves. Sanders, Peter, and Sebastian Winkel. "Super scalar sample sort." European Symposium on Algorithms. Springer, Berlin, Heidelberg, 2004. which can be accessed at : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.72.366&rep=rep1&type=pdf Change-Id: I3723b87e2feb8d7d9ee03f71f6025e26add914ce Reviewed-on: https://gerrit.libreoffice.org/79486 Tested-by: Jenkins Reviewed-by: Luboš Luňák <l.lunak@collabora.com>
30 lines
No EOL
859 B
Makefile
30 lines
No EOL
859 B
Makefile
# -*- Mode: makefile-gmake; tab-width: 4; indent-tabs-mode: t -*-
|
|
#
|
|
# 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/.
|
|
#
|
|
|
|
$(eval $(call gb_CppunitTest_CppunitTest,comphelper_parallelsort_test))
|
|
|
|
$(eval $(call gb_CppunitTest_add_exception_objects,comphelper_parallelsort_test, \
|
|
comphelper/qa/unit/parallelsorttest \
|
|
))
|
|
|
|
$(eval $(call gb_CppunitTest_use_externals,comphelper_parallelsort_test,\
|
|
boost_headers \
|
|
))
|
|
|
|
$(eval $(call gb_CppunitTest_use_sdk_api,comphelper_parallelsort_test))
|
|
|
|
$(eval $(call gb_CppunitTest_use_libraries,comphelper_parallelsort_test, \
|
|
comphelper \
|
|
cppuhelper \
|
|
cppu \
|
|
sal \
|
|
tl \
|
|
))
|
|
|
|
# vim: set noet sw=4 ts=4:
|