namespace eve::algo
{
template<relaxed_range Rng, typename Less>
template<relaxed_range Rng>
}
unaligned_t< iterator_t< R > > unaligned_iterator_t
Unaligned iterator for a relaxed range.
Definition ranges_types.hpp:68
constexpr auto min_element
SIMD version of std::min_element
Definition min_element.hpp:256
iterator to min element (end if the range is empty).
#include <eve/module/core.hpp>
#include <eve/module/algo.hpp>
#include <tts/tts.hpp>
#include <vector>
int main()
{
std::vector<int> v{ 2, -1, 4, -1, 0 };
std::cout << " -> v = "
<< tts::as_string(v)
<< "\n";
std::cout << " -> eve::algo::min_value(v) = "
std::cout << " -> eve::algo::min_element(v) - v.begin() = "
std::cout << " -> eve::algo::min_value(v, eve::is_greater) = "
std::cout << " -> eve::algo::min_value(v, eve::is_greater) - v.begin() = "
auto absolutes = eve::views::map(v,
eve::abs);
std::cout << " -> eve::algo::min_element[eve::algo::single_pass](absolutes) - absolutes.begin() = "
}
constexpr auto single_pass
Trait that changes the algorithm for min_element/max_element for index tracking.
Definition traits.hpp:289
constexpr auto min_value
SIMD algorithm that returns minimum value in the range.
Definition min_value.hpp:100
constexpr auto abs
elementwise_callable object computing the absolute value of the parameter.
Definition abs.hpp:85
constexpr auto is_greater
elementwise callable returning a logical true if and only if the element value of the first parameter...
Definition is_greater.hpp:84
Can be one of two algorithms: one pass and two pass (default).
Two pass finds a value and then does a linear search for the value. This proves to be faster on smaller simpler arrays. By default unrolls by 4 and aligned all memory accesses.
The one pass version keeps track of index and is better suited for complicated predicates. You can opt in by using single_pass
or expensive_callable
traits. The single_pass
opt-in will be aligning all data accesses