inclusive_scan_right() [2/2]

template<monoid M, sized_product_type_or_more< 1 > T>

constexpr auto kumi::inclusive_scan_right ( M &&  m, T &&  t  )

inlineconstexpr

Computes the inclusive suffix scan of all elements of a product type using a non-tail recursive call.

Note

The first stored value is the result of the application of the monoid to it's identity and the last element of the product_type.

Parameters

m	Monoid callable function to apply
t	Product type to operate on

Returns

A tuple of suffix partial accumulations where each element 'I' equals m(get<0>(t), m(... , m(get<N-2>(t), get<N-1>(t)))

Helper type

namespace kumi::result
{
  template<typename Function, product_type Tuple> struct inclusive_scan_right;
 
  template<typename Function, product_type Tuple>
  using inclusive_scan_right_t = typename inclusive_scan_right<Function,Tuple>::type;
}

Computes the return type of a call to kumi::inclusive_scan_right

Example

 
#include <kumi/kumi.hpp>
#include <iostream>
 
int main()
{
  auto t = kumi::tuple{2.,1,short{55},'z'};
 
  auto output = kumi::inclusive_scan_right( [](auto elt, auto acc) 
                  { 
                    return acc + sizeof(elt); 
                  }
                  , t
                  , std::size_t{42}                
                );
 
  std::cout << output << "\n"; 
 
  auto u = kumi::tuple{1,3,2,4,0,5,9,6,7};
 
  std::cout << kumi::inclusive_scan_right(kumi::function::plus, u) << "\n";
}