OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	01/31/2023 12:38:15 PM	rwxr-xr-x
📄 algo.h	78.15 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 algobase.h	16.75 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 algorithm	1.35 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 algorithmfwd.h	31.45 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 balanced_quicksort.h	16.55 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 base.h	12.08 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 basic_iterator.h	1.55 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 checkers.h	2.25 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 compatibility.h	3.7 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 compiletime_settings.h	2.8 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 equally_split.h	3.28 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 features.h	3.46 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 find.h	13.27 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 find_selectors.h	6.83 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 for_each.h	3.85 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 for_each_selectors.h	10.32 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 iterator.h	5.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 list_partition.h	6.39 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 losertree.h	27.92 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 merge.h	9.35 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multiseq_selection.h	21.56 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multiway_merge.h	68.88 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 multiway_mergesort.h	14.91 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 numeric	20.23 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 numericfwd.h	7.32 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 omp_loop.h	3.94 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 omp_loop_static.h	4.01 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 par_loop.h	4.45 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 parallel.h	1.54 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 partial_sum.h	7.3 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 partition.h	14.61 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 queue.h	5.41 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 quicksort.h	5.98 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random_number.h	4.13 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 random_shuffle.h	18.24 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 search.h	5.26 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 set_operations.h	14.25 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 settings.h	12.17 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 sort.h	7.53 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 tags.h	5.84 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 types.h	3.63 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 unique_copy.h	6.02 KB	12/04/2019 02:25:41 PM	rw-r--r--
📄 workstealing.h	9.39 KB	12/04/2019 02:25:41 PM	rw-r--r--

Editing: equally_split.h

// -*- C++ -*-

// Copyright (C) 2007-2017 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/equally_split.h
 *  This file is a GNU parallel extension to the Standard C++ Library.
 */

// Written by Johannes Singler.

#ifndef _GLIBCXX_PARALLEL_EQUALLY_SPLIT_H
#define _GLIBCXX_PARALLEL_EQUALLY_SPLIT_H 1

namespace __gnu_parallel
{
  /** @brief function to split a sequence into parts of almost equal size.
   *
   *  The resulting sequence __s of length __num_threads+1 contains the
   *  splitting positions when splitting the range [0,__n) into parts of
   *  almost equal size (plus minus 1).  The first entry is 0, the last
   *  one n. There may result empty parts.
   *  @param __n Number of elements
   *  @param __num_threads Number of parts
   *  @param __s Splitters
   *  @returns End of __splitter sequence, i.e. @c __s+__num_threads+1 */
  template<typename _DifferenceType, typename _OutputIterator>
    _OutputIterator
    __equally_split(_DifferenceType __n, _ThreadIndex __num_threads,
		    _OutputIterator __s)
    {
      _DifferenceType __chunk_length = __n / __num_threads;
      _DifferenceType __num_longer_chunks = __n % __num_threads;
      _DifferenceType __pos = 0;
      for (_ThreadIndex __i = 0; __i < __num_threads; ++__i)
	{
	  *__s++ = __pos;
	  __pos += ((__i < __num_longer_chunks)
		    ? (__chunk_length + 1) : __chunk_length);
	}
      *__s++ = __n;
      return __s;
    }

/** @brief function to split a sequence into parts of almost equal size.
   *
   *  Returns the position of the splitting point between
   *  thread number __thread_no (included) and
   *  thread number __thread_no+1 (excluded).
   *  @param __n Number of elements
   *  @param __num_threads Number of parts
   *  @param __thread_no Number of threads
   *  @returns splitting point */
  template<typename _DifferenceType>
    _DifferenceType
    __equally_split_point(_DifferenceType __n,
			  _ThreadIndex __num_threads,
			  _ThreadIndex __thread_no)
    {
      _DifferenceType __chunk_length = __n / __num_threads;
      _DifferenceType __num_longer_chunks = __n % __num_threads;
      if (__thread_no < __num_longer_chunks)
	return __thread_no * (__chunk_length + 1);
      else
	return __num_longer_chunks * (__chunk_length + 1)
          + (__thread_no - __num_longer_chunks) * __chunk_length;
    }
}

#endif /* _GLIBCXX_PARALLEL_EQUALLY_SPLIT_H */