Gecko [ www.corporacionhdm.com.pe ]

Name	Size	Permission	Date
algo.h	78.15 KB	-rw-r--r--	2025-03-31 10:36
algobase.h	16.75 KB	-rw-r--r--	2025-03-31 10:36
algorithm	1.35 KB	-rw-r--r--	2025-03-31 10:36
algorithmfwd.h	31.45 KB	-rw-r--r--	2025-03-31 10:36
balanced_quicksort.h	16.55 KB	-rw-r--r--	2025-03-31 10:36
base.h	12.08 KB	-rw-r--r--	2025-03-31 10:36
basic_iterator.h	1.55 KB	-rw-r--r--	2025-03-31 10:36
checkers.h	2.25 KB	-rw-r--r--	2025-03-31 10:36
compatibility.h	3.7 KB	-rw-r--r--	2025-03-31 10:36
compiletime_settings.h	2.8 KB	-rw-r--r--	2025-03-31 10:36
equally_split.h	3.28 KB	-rw-r--r--	2025-03-31 10:36
features.h	3.46 KB	-rw-r--r--	2025-03-31 10:36
find.h	13.27 KB	-rw-r--r--	2025-03-31 10:36
find_selectors.h	6.83 KB	-rw-r--r--	2025-03-31 10:36
for_each.h	3.85 KB	-rw-r--r--	2025-03-31 10:36
for_each_selectors.h	10.32 KB	-rw-r--r--	2025-03-31 10:36
iterator.h	5.54 KB	-rw-r--r--	2025-03-31 10:36
list_partition.h	6.39 KB	-rw-r--r--	2025-03-31 10:36
losertree.h	27.92 KB	-rw-r--r--	2025-03-31 10:36
merge.h	9.35 KB	-rw-r--r--	2025-03-31 10:36
multiseq_selection.h	21.56 KB	-rw-r--r--	2025-03-31 10:36
multiway_merge.h	68.88 KB	-rw-r--r--	2025-03-31 10:36
multiway_mergesort.h	14.91 KB	-rw-r--r--	2025-03-31 10:36
numeric	20.23 KB	-rw-r--r--	2025-03-31 10:36
numericfwd.h	7.32 KB	-rw-r--r--	2025-03-31 10:36
omp_loop.h	3.94 KB	-rw-r--r--	2025-03-31 10:36
omp_loop_static.h	4.01 KB	-rw-r--r--	2025-03-31 10:36
par_loop.h	4.45 KB	-rw-r--r--	2025-03-31 10:36
parallel.h	1.54 KB	-rw-r--r--	2025-03-31 10:36
partial_sum.h	7.3 KB	-rw-r--r--	2025-03-31 10:36
partition.h	14.61 KB	-rw-r--r--	2025-03-31 10:36
queue.h	5.41 KB	-rw-r--r--	2025-03-31 10:36
quicksort.h	5.98 KB	-rw-r--r--	2025-03-31 10:36
random_number.h	4.13 KB	-rw-r--r--	2025-03-31 10:36
random_shuffle.h	18.24 KB	-rw-r--r--	2025-03-31 10:36
search.h	5.26 KB	-rw-r--r--	2025-03-31 10:36
set_operations.h	14.25 KB	-rw-r--r--	2025-03-31 10:36
settings.h	12.17 KB	-rw-r--r--	2025-03-31 10:36
sort.h	7.53 KB	-rw-r--r--	2025-03-31 10:36
tags.h	5.84 KB	-rw-r--r--	2025-03-31 10:36
types.h	3.63 KB	-rw-r--r--	2025-03-31 10:36
unique_copy.h	6.02 KB	-rw-r--r--	2025-03-31 10:36
workstealing.h	9.39 KB	-rw-r--r--	2025-03-31 10:36

Rename

// -*- C++ -*-

// Copyright (C) 2007-2018 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/features.h
 *  @brief Defines on whether to include algorithm variants.
 *
 *  Less variants reduce executable size and compile time.
 *  This file is a GNU parallel extension to the Standard C++ Library.
 */

// Written by Johannes Singler.

#ifndef _GLIBCXX_PARALLEL_FEATURES_H
#define _GLIBCXX_PARALLEL_FEATURES_H 1

#ifndef _GLIBCXX_MERGESORT
/** @def _GLIBCXX_MERGESORT
 *  @brief Include parallel multi-way mergesort.
 *  @see __gnu_parallel::_Settings::sort_algorithm */
#define _GLIBCXX_MERGESORT 1
#endif

#ifndef _GLIBCXX_QUICKSORT
/** @def _GLIBCXX_QUICKSORT
 *  @brief Include parallel unbalanced quicksort.
 *  @see __gnu_parallel::_Settings::sort_algorithm */
#define _GLIBCXX_QUICKSORT 1
#endif

#ifndef _GLIBCXX_BAL_QUICKSORT
/** @def _GLIBCXX_BAL_QUICKSORT
 *  @brief Include parallel dynamically load-balanced quicksort.
 *  @see __gnu_parallel::_Settings::sort_algorithm */
#define _GLIBCXX_BAL_QUICKSORT 1
#endif

#ifndef _GLIBCXX_FIND_GROWING_BLOCKS
/** @brief Include the growing blocks variant for std::find.
 *  @see __gnu_parallel::_Settings::find_algorithm */
#define _GLIBCXX_FIND_GROWING_BLOCKS 1
#endif

#ifndef _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS
/** @brief Include the equal-sized blocks variant for std::find.
 *  @see __gnu_parallel::_Settings::find_algorithm */
#define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS 1
#endif

#ifndef _GLIBCXX_FIND_EQUAL_SPLIT
/** @def _GLIBCXX_FIND_EQUAL_SPLIT
 *  @brief Include the equal splitting variant for std::find.
 *  @see __gnu_parallel::_Settings::find_algorithm */
#define _GLIBCXX_FIND_EQUAL_SPLIT 1
#endif

#ifndef _GLIBCXX_TREE_INITIAL_SPLITTING
/** @def _GLIBCXX_TREE_INITIAL_SPLITTING
 *  @brief Include the initial splitting variant for
 *  _Rb_tree::insert_unique(_IIter beg, _IIter __end).
 *  @see __gnu_parallel::_Rb_tree */
#define _GLIBCXX_TREE_INITIAL_SPLITTING 1
#endif

#ifndef _GLIBCXX_TREE_DYNAMIC_BALANCING
/** @def _GLIBCXX_TREE_DYNAMIC_BALANCING
 *  @brief Include the dynamic balancing variant for
 *  _Rb_tree::insert_unique(_IIter beg, _IIter __end).
 *  @see __gnu_parallel::_Rb_tree */
#define _GLIBCXX_TREE_DYNAMIC_BALANCING 1
#endif

#ifndef _GLIBCXX_TREE_FULL_COPY
/** @def _GLIBCXX_TREE_FULL_COPY
 *  @brief In order to sort the input sequence of
 *  _Rb_tree::insert_unique(_IIter beg, _IIter __end) a
 *  full copy of the input elements is done.
 *  @see __gnu_parallel::_Rb_tree */
#define _GLIBCXX_TREE_FULL_COPY 1
#endif

#endif /* _GLIBCXX_PARALLEL_FEATURES_H */