Hackfut Security File Manager
Current Path:
/usr/include/c++/4.4.4/parallel
usr
/
include
/
c++
/
4.4.4
/
parallel
/
📁
..
📄
algo.h
(102.35 KB)
📄
algobase.h
(10.88 KB)
📄
algorithm
(1.35 KB)
📄
algorithmfwd.h
(29.46 KB)
📄
balanced_quicksort.h
(15.78 KB)
📄
base.h
(12.02 KB)
📄
basic_iterator.h
(1.57 KB)
📄
checkers.h
(4.5 KB)
📄
compatibility.h
(10.06 KB)
📄
compiletime_settings.h
(2.75 KB)
📄
equally_split.h
(3.12 KB)
📄
features.h
(3.5 KB)
📄
find.h
(13.96 KB)
📄
find_selectors.h
(6.93 KB)
📄
for_each.h
(3.58 KB)
📄
for_each_selectors.h
(9.57 KB)
📄
iterator.h
(5.15 KB)
📄
list_partition.h
(5.79 KB)
📄
losertree.h
(25.12 KB)
📄
merge.h
(9.33 KB)
📄
multiseq_selection.h
(16.31 KB)
📄
multiway_merge.h
(71.04 KB)
📄
multiway_mergesort.h
(15.12 KB)
📄
numeric
(19.04 KB)
📄
numericfwd.h
(6.77 KB)
📄
omp_loop.h
(3.9 KB)
📄
omp_loop_static.h
(3.94 KB)
📄
par_loop.h
(4.43 KB)
📄
parallel.h
(1.54 KB)
📄
partial_sum.h
(6.88 KB)
📄
partition.h
(14.56 KB)
📄
queue.h
(4.79 KB)
📄
quicksort.h
(5.78 KB)
📄
random_number.h
(3.72 KB)
📄
random_shuffle.h
(17.28 KB)
📄
search.h
(5.47 KB)
📄
set_operations.h
(14.13 KB)
📄
settings.h
(10.73 KB)
📄
sort.h
(7.25 KB)
📄
tags.h
(5.96 KB)
📄
types.h
(4.02 KB)
📄
unique_copy.h
(5.67 KB)
📄
workstealing.h
(9.85 KB)
Editing: equally_split.h
// -*- C++ -*- // Copyright (C) 2007, 2009 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 difference_type, typename OutputIterator> OutputIterator equally_split(difference_type n, thread_index_t num_threads, OutputIterator s) { difference_type chunk_length = n / num_threads; difference_type num_longer_chunks = n % num_threads; difference_type pos = 0; for (thread_index_t 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 * @returns _SplittingAlgorithm point */ template<typename difference_type> difference_type equally_split_point(difference_type n, thread_index_t num_threads, thread_index_t thread_no) { difference_type chunk_length = n / num_threads; difference_type 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 */
Upload File
Create Folder