Gecko [ sachasauda.akalacademy.ac.in ]

Name	Size	Permission
algo.h	95.66 KB	-rw-r--r--
algobase.h	11.42 KB	-rw-r--r--
algorithm	1.35 KB	-rw-r--r--
algorithmfwd.h	31.45 KB	-rw-r--r--
balanced_quicksort.h	16.38 KB	-rw-r--r--
base.h	11.96 KB	-rw-r--r--
basic_iterator.h	1.55 KB	-rw-r--r--
checkers.h	2.25 KB	-rw-r--r--
compatibility.h	3.7 KB	-rw-r--r--
compiletime_settings.h	2.76 KB	-rw-r--r--
equally_split.h	3.28 KB	-rw-r--r--
features.h	3.46 KB	-rw-r--r--
find.h	13.27 KB	-rw-r--r--
find_selectors.h	6.83 KB	-rw-r--r--
for_each.h	3.85 KB	-rw-r--r--
for_each_selectors.h	10.32 KB	-rw-r--r--
iterator.h	5.54 KB	-rw-r--r--
list_partition.h	6.38 KB	-rw-r--r--
losertree.h	27.78 KB	-rw-r--r--
merge.h	9.34 KB	-rw-r--r--
multiseq_selection.h	21.56 KB	-rw-r--r--
multiway_merge.h	68.78 KB	-rw-r--r--
multiway_mergesort.h	14.91 KB	-rw-r--r--
numeric	20.38 KB	-rw-r--r--
numericfwd.h	7.32 KB	-rw-r--r--
omp_loop.h	3.94 KB	-rw-r--r--
omp_loop_static.h	4.01 KB	-rw-r--r--
par_loop.h	4.45 KB	-rw-r--r--
parallel.h	1.54 KB	-rw-r--r--
partial_sum.h	7.3 KB	-rw-r--r--
partition.h	14.58 KB	-rw-r--r--
queue.h	5.4 KB	-rw-r--r--
quicksort.h	5.98 KB	-rw-r--r--
random_number.h	4.13 KB	-rw-r--r--
random_shuffle.h	18.24 KB	-rw-r--r--
search.h	5.26 KB	-rw-r--r--
set_operations.h	14.25 KB	-rw-r--r--
settings.h	12.17 KB	-rw-r--r--
sort.h	7.52 KB	-rw-r--r--
tags.h	5.84 KB	-rw-r--r--
types.h	3.63 KB	-rw-r--r--
unique_copy.h	6.02 KB	-rw-r--r--
workstealing.h	9.39 KB	-rw-r--r--

Code Editor : tags.h

// -*- C++ -*-

// Copyright (C) 2007-2013 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/tags.h
 * @brief Tags for compile-time selection.
 *  This file is a GNU parallel extension to the Standard C++ Library.
 */

// Written by Johannes Singler and Felix Putze.

#ifndef _GLIBCXX_PARALLEL_TAGS_H
#define _GLIBCXX_PARALLEL_TAGS_H 1

#include <omp.h>
#include <parallel/types.h>

namespace __gnu_parallel
{
  /** @brief Forces sequential execution at compile time. */
  struct sequential_tag { };

/** @brief Recommends parallel execution at compile time,
   *  optionally using a user-specified number of threads. */
  struct parallel_tag
  {
    private:
      _ThreadIndex _M_num_threads;

public:
      /** @brief Default constructor. Use default number of threads. */
      parallel_tag()
      { _M_num_threads = 0; }

/** @brief Default constructor. Recommend number of threads to use.
       *  @param __num_threads Desired number of threads. */
      parallel_tag(_ThreadIndex __num_threads)
      { _M_num_threads = __num_threads; }

/** @brief Find out desired number of threads.
       *  @return Desired number of threads. */
      _ThreadIndex __get_num_threads()
      {
        if(_M_num_threads == 0)
          return omp_get_max_threads();
        else
          return _M_num_threads;
      }

/** @brief Set the desired number of threads.
       *  @param __num_threads Desired number of threads. */
      void set_num_threads(_ThreadIndex __num_threads)
      { _M_num_threads = __num_threads; }
  };

/** @brief Recommends parallel execution using the
      default parallel algorithm. */
  struct default_parallel_tag : public parallel_tag
  {
    default_parallel_tag() { }
    default_parallel_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Recommends parallel execution using dynamic
      load-balancing at compile time. */
  struct balanced_tag : public parallel_tag { };

/** @brief Recommends parallel execution using static
      load-balancing at compile time. */
  struct unbalanced_tag : public parallel_tag { };

/** @brief Recommends parallel execution using OpenMP dynamic
      load-balancing at compile time. */
  struct omp_loop_tag : public parallel_tag { };

/** @brief Recommends parallel execution using OpenMP static
      load-balancing at compile time. */
  struct omp_loop_static_tag : public parallel_tag { };

/** @brief Base class for for std::find() variants. */
  struct find_tag { };

/** @brief Forces parallel merging
   *  with exact splitting, at compile time. */
  struct exact_tag : public parallel_tag
  {
    exact_tag() { }
    exact_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Forces parallel merging
   *  with exact splitting, at compile time. */
  struct sampling_tag : public parallel_tag
  {
    sampling_tag() { }
    sampling_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Forces parallel sorting using multiway mergesort
   *  at compile time. */
  struct multiway_mergesort_tag : public parallel_tag
  {
    multiway_mergesort_tag() { }
    multiway_mergesort_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Forces parallel sorting using multiway mergesort
   *  with exact splitting at compile time. */
  struct multiway_mergesort_exact_tag : public parallel_tag
  {
    multiway_mergesort_exact_tag() { }
    multiway_mergesort_exact_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Forces parallel sorting using multiway mergesort
   *  with splitting by sampling at compile time. */
  struct multiway_mergesort_sampling_tag : public parallel_tag
  {
    multiway_mergesort_sampling_tag() { }
    multiway_mergesort_sampling_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Forces parallel sorting using unbalanced quicksort
   *  at compile time. */
  struct quicksort_tag : public parallel_tag
  {
    quicksort_tag() { }
    quicksort_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Forces parallel sorting using balanced quicksort
   *  at compile time. */
  struct balanced_quicksort_tag : public parallel_tag
  {
    balanced_quicksort_tag() { }
    balanced_quicksort_tag(_ThreadIndex __num_threads)
    : parallel_tag(__num_threads) { }
  };

/** @brief Selects the growing block size variant for std::find().
      @see _GLIBCXX_FIND_GROWING_BLOCKS */
  struct growing_blocks_tag : public find_tag { };

/** @brief Selects the constant block size variant for std::find().
      @see _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS */
  struct constant_size_blocks_tag : public find_tag { };

/** @brief Selects the equal splitting variant for std::find().
      @see _GLIBCXX_FIND_EQUAL_SPLIT */
  struct equal_split_tag : public find_tag { };
}

#endif /* _GLIBCXX_PARALLEL_TAGS_H */

${this.title}

Code Editor : tags.h