max

eve::max = functor<max_t>

inlineconstexpr

Header file

#include <eve/module/core.hpp>

Callable Signatures

namespace eve
{
   // Regular overloads
   constexpr auto max(eve::value auto x, eve::value auto ... xs)                 noexcept; // 1
   constexpr auto max(kumi::non_empty_product_type auto const& tup)              noexcept; // 2
 
   // Lanes masking
   constexpr auto max[conditional_expr auto c](/* any of the above overloads */) noexcept; // 3
   constexpr auto max[logical_value auto m](/* any of the above overloads */)    noexcept; // 3
 
   // Exclusive Semantic options - Only one of those can be set at once
   constexpr auto max[pedantic](/* any of the above overloads */)                noexcept; // 4
   constexpr auto max[numeric ](/* any of the above overloads */)                noexcept; // 5
}

Parameters

• x, xs... : arguments.
• tup: non empty tuple of arguments.
• c: Conditional expression masking the operation.
• m: Logical value masking the operation.

Return value

1. the maximal element is returned. If one of the elements is NaN the result is system dependant.
2. equivalent to the call on the elements of the tuple.
3. The operation is performed conditionnaly
4. Ensures conformity to the standard. That is for two parameters to be equivalent to: (x < y) ? y : x and this behaviour is also ensured on n parameters calls as if this scheme is recursively used.
5. NaNs are considered less than anything else.

Example

// revision 0
#include <eve/module/core.hpp>
#include <iostream>
 
int main()
{
  eve::wide wf0{0.0, 1.0, 2.0, 3.0, -1.0, -2.0, -3.0, -4.0};
  eve::wide wf1{0.0, -4.0, 1.0, -1.0, 2.0, -2.0, 3.0, -3.0};
  eve::wide wi0{0, 1, 2, 3, -1, -2, -3, -4};
  eve::wide wi1{0, -4, 1, -1, 2, -2, 3, -3};
  eve::wide wu0{0u, 1u, 2u, 3u, 4u, 5u, 6u, 7u};
  eve::wide wu1{7u, 6u, 5u, 4u, 3u, 2u, 1u, 0u};
 
  std::cout << "<- wf0                           = " << wf0 << "\n";
  std::cout << "<- wf1                           = " << wf1 << "\n";
  std::cout << "<- wi0                           = " << wi0 << "\n";
  std::cout << "<- wi1                           = " << wi1 << "\n";
  std::cout << "<- wu0                           = " << wu0 << "\n";
  std::cout << "<- wu1                           = " << wu1 << "\n";
 
  std::cout << "-> max(wf0, wf1)                 = " << eve::max(wf0, wf1) << "\n";
  std::cout << "-> max[ignore_last(2)](wf0, wf1) = " << eve::max[eve::ignore_last(2)](wf0, wf1) << "\n";
  std::cout << "-> max[wf0 != 0](wf0, wf1)       = " << eve::max[wf0 != 0](wf0, wf1) << "\n";
  std::cout << "-> max[pedantic](wf0, wf1)       = " << eve::max[eve::pedantic](wf0, wf1) << "\n";
  std::cout << "-> max[pedantic](wf0, wf1)       = " << eve::max[eve::pedantic](wf0, wf1) << "\n";
  std::cout << "-> max[numeric ](wf0, wf1)       = " << eve::max[eve::numeric ](wf0, wf1) << "\n";
  std::cout << "-> max(wu0, wu1)                 = " << eve::max(wu0, wu1) << "\n";
  std::cout << "-> max(wi0, wi1)                 = " << eve::max(wi0, wi1) << "\n";
  std::cout << "-> max(0.,1.,2.,3.,-3.,-4.,-6.0) = " << eve::max(0.0, 1.0, 2.0, 3.0, -3.0, -4., -6.0) << "\n";
}