quicksort.h File Reference

Detailed Description

Definition of the quicksort function.

Copyright

Copyright (c) 2012-2024, OpenGeoSys Community (http://www.opengeosys.org) Distributed under a Modified BSD License. See accompanying file LICENSE.txt or http://www.opengeosys.org/project/license

Definition in file quicksort.h.

#include <algorithm>
#include <cassert>
#include <cstddef>
#include <iterator>
#include <vector>

Include dependency graph for quicksort.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	BaseLib

Functions
template<typename It1 , typename It2 , typename Comparator >
void	BaseLib::quicksort (It1 first1, It1 last1, It2 first2, Comparator compare)
template<typename It1 , typename It2 >
void	BaseLib::quicksort (It1 first1, It1 last1, It2 first2)
template<typename T1 , typename T2 = std::size_t>
void	BaseLib::quicksort (T1 *array, std::size_t beg, std::size_t end, T2 *perm)
template<typename T1 , typename T2 = std::size_t>
void	BaseLib::quicksort (std::vector< T1 > &array, std::size_t beg, std::size_t end, std::vector< T2 > &perm)
template<typename T1 , typename T2 = std::size_t>
void	BaseLib::quicksort (std::vector< T1 * > &array, std::size_t beg, std::size_t end, std::vector< T2 > &perm)