FM / parallel

/usr/include/c++/11/parallel

Name	Size	Mode	Actions
algo.h	80664	0644	edit dl rm
algobase.h	18361	0644	edit dl rm
algorithm	1381	0644	edit dl rm
algorithmfwd.h	32306	0644	edit dl rm
balanced_quicksort.h	16952	0644	edit dl rm
base.h	12422	0644	edit dl rm
basic_iterator.h	1586	0644	edit dl rm
checkers.h	2235	0644	edit dl rm
compatibility.h	3790	0644	edit dl rm
compiletime_settings.h	2871	0644	edit dl rm
equally_split.h	3356	0644	edit dl rm
features.h	3543	0644	edit dl rm
find.h	13591	0644	edit dl rm
find_selectors.h	6992	0644	edit dl rm
for_each.h	3947	0644	edit dl rm
for_each_selectors.h	10565	0644	edit dl rm
iterator.h	5678	0644	edit dl rm
list_partition.h	6542	0644	edit dl rm
losertree.h	28592	0644	edit dl rm
merge.h	9578	0644	edit dl rm
multiseq_selection.h	22073	0644	edit dl rm
multiway_merge.h	70617	0644	edit dl rm
multiway_mergesort.h	15281	0644	edit dl rm
numeric	20717	0644	edit dl rm
numericfwd.h	7506	0644	edit dl rm
omp_loop.h	4031	0644	edit dl rm
omp_loop_static.h	4104	0644	edit dl rm
parallel.h	1576	0644	edit dl rm
partial_sum.h	7474	0644	edit dl rm
partition.h	14961	0644	edit dl rm
par_loop.h	4552	0644	edit dl rm
queue.h	5542	0644	edit dl rm
quicksort.h	6126	0644	edit dl rm
random_number.h	4227	0644	edit dl rm
random_shuffle.h	18675	0644	edit dl rm
search.h	5391	0644	edit dl rm
settings.h	12462	0644	edit dl rm
set_operations.h	14590	0644	edit dl rm
sort.h	7709	0644	edit dl rm
tags.h	5982	0644	edit dl rm
types.h	3716	0644	edit dl rm
unique_copy.h	6165	0644	edit dl rm
workstealing.h	9610	0644	edit dl rm

Edit: /usr/include/c++/11/parallel/unique_copy.h (6165B)

// -*- C++ -*-

// Copyright (C) 2007-2021 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the terms
// of the GNU General Public License as published by the Free Software
// Foundation; either version 3, or (at your option) any later
// version.

// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file parallel/unique_copy.h
 *  @brief Parallel implementations of std::unique_copy().
 *  This file is a GNU parallel extension to the Standard C++ Library.
 */

// Written by Robert Geisberger and Robin Dapp.

#ifndef _GLIBCXX_PARALLEL_UNIQUE_COPY_H
#define _GLIBCXX_PARALLEL_UNIQUE_COPY_H 1

#include <parallel/parallel.h>
#include <parallel/multiseq_selection.h>

namespace __gnu_parallel
{
  /** @brief Parallel std::unique_copy(), w/__o explicit equality predicate.
    *  @param __first Begin iterator of input sequence.
    *  @param __last End iterator of input sequence.
    *  @param __result Begin iterator of result __sequence.
    *  @param __binary_pred Equality predicate.
    *  @return End iterator of result __sequence. */
  template<typename _IIter,
           class _OutputIterator,
           class _BinaryPredicate>
    _OutputIterator
    __parallel_unique_copy(_IIter __first, _IIter __last,
			   _OutputIterator __result,
			   _BinaryPredicate __binary_pred)
    {
      _GLIBCXX_CALL(__last - __first)

typedef std::iterator_traits<_IIter> _TraitsType;
      typedef typename _TraitsType::value_type _ValueType;
      typedef typename _TraitsType::difference_type _DifferenceType;

_DifferenceType __size = __last - __first;

if (__size == 0)
	return __result;

// Let the first thread process two parts.
      _DifferenceType *__counter;
      _DifferenceType *__borders;

_ThreadIndex __num_threads = __get_max_threads();
      // First part contains at least one element.
#     pragma omp parallel num_threads(__num_threads)
      {
#       pragma omp single
	{
	  __num_threads = omp_get_num_threads();
	  __borders = new _DifferenceType[__num_threads + 2];
	  __equally_split(__size, __num_threads + 1, __borders);
	  __counter = new _DifferenceType[__num_threads + 1];
	}

_ThreadIndex __iam = omp_get_thread_num();

_DifferenceType __begin, __end;

// Check for length without duplicates
	// Needed for position in output
	_DifferenceType __i = 0;
	_OutputIterator __out = __result;

if (__iam == 0)
          {
            __begin = __borders[0] + 1;   // == 1
            __end = __borders[__iam + 1];

++__i;
            *__out++ = *__first;

for (_IIter __iter = __first + __begin; __iter < __first + __end;
		 ++__iter)
              {
        	if (!__binary_pred(*__iter, *(__iter - 1)))
                  {
                    ++__i;
                    *__out++ = *__iter;
                  }
              }
          }
	else
          {
            __begin = __borders[__iam]; //one part
            __end = __borders[__iam + 1];

for (_IIter __iter = __first + __begin; __iter < __first + __end;
		 ++__iter)
              {
        	if (!__binary_pred(*__iter, *(__iter - 1)))
                  ++__i;
              }
          }
	__counter[__iam] = __i;

// Last part still untouched.
	_DifferenceType __begin_output;

#       pragma omp barrier

// Store result in output on calculated positions.
	__begin_output = 0;

if (__iam == 0)
          {
            for (_ThreadIndex __t = 0; __t < __num_threads; ++__t)
              __begin_output += __counter[__t];

__i = 0;

_OutputIterator __iter_out = __result + __begin_output;

__begin = __borders[__num_threads];
            __end = __size;

for (_IIter __iter = __first + __begin; __iter < __first + __end;
		 ++__iter)
              {
        	if (__iter == __first
		    || !__binary_pred(*__iter, *(__iter - 1)))
                  {
                    ++__i;
                    *__iter_out++ = *__iter;
                  }
              }

__counter[__num_threads] = __i;
          }
	else
          {
            for (_ThreadIndex __t = 0; __t < __iam; __t++)
              __begin_output += __counter[__t];

_OutputIterator __iter_out = __result + __begin_output;
            for (_IIter __iter = __first + __begin; __iter < __first + __end;
		 ++__iter)
              {
        	if (!__binary_pred(*__iter, *(__iter - 1)))
                  *__iter_out++ = *__iter;
              }
          }
      }

_DifferenceType __end_output = 0;
      for (_ThreadIndex __t = 0; __t < __num_threads + 1; __t++)
	__end_output += __counter[__t];

delete[] __borders;

return __result + __end_output;
    }

/** @brief Parallel std::unique_copy(), without explicit equality predicate
    *  @param __first Begin iterator of input sequence.
    *  @param __last End iterator of input sequence.
    *  @param __result Begin iterator of result __sequence.
    *  @return End iterator of result __sequence. */
  template<typename _IIter, class _OutputIterator>
    inline _OutputIterator
    __parallel_unique_copy(_IIter __first, _IIter __last,
			   _OutputIterator __result)
    {
      typedef typename std::iterator_traits<_IIter>::value_type
	_ValueType;
      return __parallel_unique_copy(__first, __last, __result,
				    std::equal_to<_ValueType>());
    }

}//namespace __gnu_parallel

#endif /* _GLIBCXX_PARALLEL_UNIQUE_COPY_H */

cmd: