StlAlgorithms.hpp File Reference

#include <algorithm>
#include <iterator>
#include <numeric>
#include <utility>

Go to the source code of this file.

Namespaces
namespace	nc
namespace	nc::stl_algorithms

Macros
#define	CONDITIONAL_NO_EXCEPT   noexcept

Functions
template<class InputIt , class UnaryPredicate >
bool	nc::stl_algorithms::all_of (InputIt first, InputIt last, UnaryPredicate p) noexcept
template<class InputIt , class UnaryPredicate >
bool	nc::stl_algorithms::any_of (InputIt first, InputIt last, UnaryPredicate p) noexcept
template<class InputIt , class OutputIt >
OutputIt	nc::stl_algorithms::copy (InputIt first, InputIt last, OutputIt destination) noexcept
template<class InputIt , class T >
std::iterator_traits< InputIt >::difference_type	nc::stl_algorithms::count (InputIt first, InputIt last, const T &value) noexcept
template<class InputIt1 , class InputIt2 >
bool	nc::stl_algorithms::equal (InputIt1 first1, InputIt1 last1, InputIt2 first2) noexcept
template<class InputIt1 , class InputIt2 , class BinaryPredicate >
bool	nc::stl_algorithms::equal (InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) noexcept
template<class ForwardIt , class T >
void	nc::stl_algorithms::fill (ForwardIt first, ForwardIt last, const T &value) noexcept
template<class InputIt , class T >
InputIt	nc::stl_algorithms::find (InputIt first, InputIt last, const T &value) noexcept
template<class InputIt , class UnaryFunction >
void	nc::stl_algorithms::for_each (InputIt first, InputIt last, UnaryFunction f)
template<class ForwardIt >
bool	nc::stl_algorithms::is_sorted (ForwardIt first, ForwardIt last) noexcept
template<class ForwardIt , class Compare >
bool	nc::stl_algorithms::is_sorted (ForwardIt first, ForwardIt last, Compare comp) noexcept
template<class ForwardIt >
ForwardIt	nc::stl_algorithms::max_element (ForwardIt first, ForwardIt last) noexcept
template<class ForwardIt , class Compare >
ForwardIt	nc::stl_algorithms::max_element (ForwardIt first, ForwardIt last, Compare comp) noexcept
template<class ForwardIt >
ForwardIt	nc::stl_algorithms::min_element (ForwardIt first, ForwardIt last) noexcept
template<class ForwardIt , class Compare >
ForwardIt	nc::stl_algorithms::min_element (ForwardIt first, ForwardIt last, Compare comp) noexcept
template<class ForwardIt >
std::pair< ForwardIt, ForwardIt >	nc::stl_algorithms::minmax_element (ForwardIt first, ForwardIt last) noexcept
template<class ForwardIt , class Compare >
std::pair< ForwardIt, ForwardIt >	nc::stl_algorithms::minmax_element (ForwardIt first, ForwardIt last, Compare comp) noexcept
template<class InputIt , class UnaryPredicate >
bool	nc::stl_algorithms::none_of (InputIt first, InputIt last, UnaryPredicate p) noexcept
template<class RandomIt >
void	nc::stl_algorithms::nth_element (RandomIt first, RandomIt nth, RandomIt last) noexcept
template<class RandomIt , class Compare >
void	nc::stl_algorithms::nth_element (RandomIt first, RandomIt nth, RandomIt last, Compare comp) noexcept
template<class ForwardIt , class T >
void	nc::stl_algorithms::replace (ForwardIt first, ForwardIt last, const T &oldValue, const T &newValue) noexcept
template<class BidirIt >
void	nc::stl_algorithms::reverse (BidirIt first, BidirIt last) noexcept
template<class ForwardIt >
void	nc::stl_algorithms::rotate (ForwardIt first, ForwardIt firstN, ForwardIt last) noexcept
template<class InputIt1 , class InputIt2 , class OutputIt >
OutputIt	nc::stl_algorithms::set_difference (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination)
template<class InputIt1 , class InputIt2 , class OutputIt , class Compare >
OutputIt	nc::stl_algorithms::set_difference (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
template<class InputIt1 , class InputIt2 , class OutputIt >
OutputIt	nc::stl_algorithms::set_intersection (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept
template<class InputIt1 , class InputIt2 , class OutputIt , class Compare >
OutputIt	nc::stl_algorithms::set_intersection (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
template<class InputIt1 , class InputIt2 , class OutputIt >
OutputIt	nc::stl_algorithms::set_union (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination) noexcept
template<class InputIt1 , class InputIt2 , class OutputIt , class Compare >
OutputIt	nc::stl_algorithms::set_union (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt destination, Compare comp) noexcept
template<class RandomIt >
void	nc::stl_algorithms::sort (RandomIt first, RandomIt last) noexcept
template<class RandomIt , class Compare >
void	nc::stl_algorithms::sort (RandomIt first, RandomIt last, Compare comp) noexcept
template<class RandomIt >
void	nc::stl_algorithms::stable_sort (RandomIt first, RandomIt last) noexcept
template<class RandomIt , class Compare >
void	nc::stl_algorithms::stable_sort (RandomIt first, RandomIt last, Compare comp) noexcept
template<class InputIt , class OutputIt , class UnaryOperation >
OutputIt	nc::stl_algorithms::transform (InputIt first, InputIt last, OutputIt destination, UnaryOperation unaryFunction)
template<class InputIt1 , class InputIt2 , class OutputIt , class BinaryOperation >
OutputIt	nc::stl_algorithms::transform (InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt destination, BinaryOperation unaryFunction)
template<class InputIt , class OutputIt >
constexpr OutputIt	nc::stl_algorithms::unique_copy (InputIt first, InputIt last, OutputIt destination) noexcept
template<class InputIt , class OutputIt , class BinaryPredicate >
constexpr OutputIt	nc::stl_algorithms::unique_copy (InputIt first, InputIt last, OutputIt destination, BinaryPredicate binaryFunction) noexcept

Detailed Description

Author

David Pilger dpilg.nosp@m.er26.nosp@m.@gmai.nosp@m.l.co.nosp@m.m GitHub Repository

License Copyright 2018-2023 David Pilger

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files(the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions :

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

Description Macro to define whether or not c++17 parallel algorithm policies are supported

Macro Definition Documentation

CONDITIONAL_NO_EXCEPT

#define CONDITIONAL_NO_EXCEPT   noexcept