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: search.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/search.h
 *  @brief Parallel implementation base for std::search() and
 *  std::search_n().
 *  This file is a GNU parallel extension to the Standard C++ Library.
 */

// Written by Felix Putze.

#ifndef _GLIBCXX_PARALLEL_SEARCH_H
#define _GLIBCXX_PARALLEL_SEARCH_H 1

#include <bits/stl_algobase.h>

#include <parallel/parallel.h>
#include <parallel/equally_split.h>

namespace __gnu_parallel
{
  /**
   *  @brief Precalculate __advances for Knuth-Morris-Pratt algorithm.
   *  @param __elements Begin iterator of sequence to search for.
   *  @param __length Length of sequence to search for.
   *  @param __off Returned __offsets. 
   */
  template<typename _RAIter, typename _DifferenceTp>
    void
    __calc_borders(_RAIter __elements, _DifferenceTp __length, 
		   _DifferenceTp* __off)
    {
      typedef _DifferenceTp _DifferenceType;

__off[0] = -1;
      if (__length > 1)
	__off[1] = 0;
      _DifferenceType __k = 0;
      for (_DifferenceType __j = 2; __j <= __length; __j++)
	{
          while ((__k >= 0) && !(__elements[__k] == __elements[__j-1]))
            __k = __off[__k];
          __off[__j] = ++__k;
	}
    }

// Generic parallel find algorithm (requires random access iterator).

/** @brief Parallel std::search.
   *  @param __begin1 Begin iterator of first sequence.
   *  @param __end1 End iterator of first sequence.
   *  @param __begin2 Begin iterator of second sequence.
   *  @param __end2 End iterator of second sequence.
   *  @param __pred Find predicate.
   *  @return Place of finding in first sequences. */
  template<typename __RAIter1,
           typename __RAIter2,
           typename _Pred>
    __RAIter1
    __search_template(__RAIter1 __begin1, __RAIter1 __end1,
		      __RAIter2 __begin2, __RAIter2 __end2,
		      _Pred __pred)
    {
      typedef std::iterator_traits<__RAIter1> _TraitsType;
      typedef typename _TraitsType::difference_type _DifferenceType;

_GLIBCXX_CALL((__end1 - __begin1) + (__end2 - __begin2));

_DifferenceType __pattern_length = __end2 - __begin2;

// Pattern too short.
      if(__pattern_length <= 0)
	return __end1;

// Last point to start search.
      _DifferenceType __input_length = (__end1 - __begin1) - __pattern_length;

// Where is first occurrence of pattern? defaults to end.
      _DifferenceType __result = (__end1 - __begin1);
      _DifferenceType *__splitters;

// Pattern too long.
      if (__input_length < 0)
	return __end1;

omp_lock_t __result_lock;
      omp_init_lock(&__result_lock);

_ThreadIndex __num_threads = std::max<_DifferenceType>
	(1, std::min<_DifferenceType>(__input_length,
				      __get_max_threads()));

_DifferenceType __advances[__pattern_length];
      __calc_borders(__begin2, __pattern_length, __advances);

#     pragma omp parallel num_threads(__num_threads)
      {
#       pragma omp single
	{
	  __num_threads = omp_get_num_threads();
	  __splitters = new _DifferenceType[__num_threads + 1];
	  __equally_split(__input_length, __num_threads, __splitters);
	}

_ThreadIndex __iam = omp_get_thread_num();

_DifferenceType __start = __splitters[__iam],
	                 __stop = __splitters[__iam + 1];

_DifferenceType __pos_in_pattern = 0;
	bool __found_pattern = false;

while (__start <= __stop && !__found_pattern)
	  {
	    // Get new value of result.
#pragma omp flush(__result)
	    // No chance for this thread to find first occurrence.
	    if (__result < __start)
	      break;
	    while (__pred(__begin1[__start + __pos_in_pattern],
			  __begin2[__pos_in_pattern]))
	      {
		++__pos_in_pattern;
		if (__pos_in_pattern == __pattern_length)
		  {
		    // Found new candidate for result.
		    omp_set_lock(&__result_lock);
		    __result = std::min(__result, __start);
		    omp_unset_lock(&__result_lock);

__found_pattern = true;
		    break;
		  }
	      }
	    // Make safe jump.
	    __start += (__pos_in_pattern - __advances[__pos_in_pattern]);
	    __pos_in_pattern = (__advances[__pos_in_pattern] < 0
				? 0 : __advances[__pos_in_pattern]);
	  }
      } //parallel

omp_destroy_lock(&__result_lock);

delete[] __splitters;
      
      // Return iterator on found element.
      return (__begin1 + __result);
    }
} // end namespace

#endif /* _GLIBCXX_PARALLEL_SEARCH_H */