File Manager

X7ROOT File Manager

Current Path: /usr/include/c++/8/parallel

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

Editing: checkers.h

// -*- 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/checkers.h
 *  @brief Routines for checking the correctness of algorithm results.
 *  This file is a GNU parallel extension to the Standard C++ Library.
 */

// Written by Johannes Singler.

#ifndef _GLIBCXX_PARALLEL_CHECKERS_H
#define _GLIBCXX_PARALLEL_CHECKERS_H 1

#include <cstdio>
#include <bits/stl_algobase.h>
#include <bits/stl_function.h>

namespace __gnu_parallel
{
  /**
   * @brief Check whether @c [__begin, @c __end) is sorted according
   * to @c __comp.
   * @param __begin Begin iterator of sequence.
   * @param __end End iterator of sequence.
   * @param __comp Comparator.
   * @return @c true if sorted, @c false otherwise.
   */
  template<typename _IIter, typename _Compare>
    bool
    __is_sorted(_IIter __begin, _IIter __end, _Compare __comp)
    {
      if (__begin == __end)
        return true;

_IIter __current(__begin), __recent(__begin);

unsigned long long __position = 1;
      for (__current++; __current != __end; __current++)
        {
          if (__comp(*__current, *__recent))
            {
              return false;
            }
          __recent = __current;
          __position++;
        }

return true;
    }
}

#endif /* _GLIBCXX_PARALLEL_CHECKERS_H */

X7ROOT File Manager

Editing: checkers.h

Upload File

Create Folder