Algorithm.h

Go to the documentation of this file.

/* Copyright (C) 2023 FIAS Frankfurt Institute for Advanced Studies, Frankfurt / Main
   SPDX-License-Identifier: GPL-3.0-only
   Authors: Felix Weiglhofer [committer] */
#ifndef CBM_ALGO_BASE_COMPAT_ALGORITHMS_H
#define CBM_ALGO_BASE_COMPAT_ALGORITHMS_H
 
#include "BuildInfo.h"
 
#include <algorithm>
#include <poolstl/algorithm>
#include <poolstl/execution>
 
#ifdef HAVE_PARALLEL_ALGORITHM
#include <execution>
#endif
 
namespace cbm::algo
{
 
  task_thread_pool::task_thread_pool& GetGlobalSTLThreadPool();
 
  template<typename It, typename Compare>
  void Sort(It first, It last, Compare comp)
  {
// Disable parallel sorting for the moment
// The underlying implementation in libTBB has a massive memory leak:
// https://community.intel.com/t5/Intel-oneAPI-Threading-Building/std-sort-std-execution-par-unseq-has-a-memory-leak-on-Linux/m-p/1580910
//
// Update 2024-05-02: Add poolstl as a replacement for libTBB
#if 0
// #ifdef HAVE_PARALLEL_STL_LIBTBB
    std::sort(std::execution::par_unseq, first, last, comp);
#elif defined(HAVE_PARALLEL_STL_POOLSTL)
    std::sort(poolstl::par.on(GetGlobalSTLThreadPool()), first, last, comp);
#else
    std::sort(first, last, comp);
#endif
  }
}  // namespace cbm::algo
 
 
#endif