ScalarTransformer.h

Go to the documentation of this file.

/***********************************************************************************\
* (c) Copyright 1998-2019 CERN for the benefit of the LHCb and ATLAS collaborations *
*                                                                                   *
* This software is distributed under the terms of the Apache version 2 licence,     *
* copied verbatim in the file "LICENSE".                                            *
*                                                                                   *
* In applying this licence, CERN does not waive the privileges and immunities       *
* granted to it by virtue of its status as an Intergovernmental Organization        *
* or submit itself to any jurisdiction.                                             *
\***********************************************************************************/
#ifndef SCALAR_TRANSFORMER_H
#define SCALAR_TRANSFORMER_H
 
#include "GaudiAlg/Transformer.h"
 
namespace Gaudi::Functional {
 
  // Scalar->Vector adapted N->1 algorithm
  template <typename ScalarOp, typename TransformerSignature, typename Traits_ = Traits::useDefaults>
  class ScalarTransformer;
  template <typename ScalarOp, typename Out, typename... In, typename Traits_>
  class ScalarTransformer<ScalarOp, Out( const In&... ), Traits_> : public Transformer<Out( const In&... ), Traits_> {
 
    const ScalarOp& scalarOp() const { return static_cast<const ScalarOp&>( *this ); }
 
  public:
    using Transformer<Out( const In&... ), Traits_>::Transformer;
 
    Out operator()( const In&... in ) const override final {
      const auto inrange = details::zip::range( in... );
      Out        out;
      out.reserve( inrange.size() );
      auto& scalar = scalarOp();
      for ( const auto&& tuple : inrange ) {
        details::invoke_optionally(
            [&out]( auto&& arg ) { details::insert( out, std::forward<decltype( arg )>( arg ) ); },
            std::apply( [&]( const auto&... i ) { return scalar( details::deref( i )... ); }, tuple ) );
      }
      details::applyPostProcessing( scalar, out );
      return out;
    }
  };
 
  // Scalar->Vector adapted N->M algorithm
  template <typename ScalarOp, typename TransformerSignature, typename Traits_ = Traits::useDefaults>
  class MultiScalarTransformer;
  template <typename ScalarOp, typename... Out, typename... In, typename Traits_>
  class MultiScalarTransformer<ScalarOp, std::tuple<Out...>( const In&... ), Traits_>
      : public MultiTransformer<std::tuple<Out...>( const In&... ), Traits_> {
 
    const ScalarOp& scalarOp() const { return static_cast<const ScalarOp&>( *this ); }
 
  public:
    using MultiTransformer<std::tuple<Out...>( const In&... ), Traits_>::MultiTransformer;
 
    std::tuple<Out...> operator()( const In&... in ) const override final {
      const auto         inrange = details::zip::range( in... );
      std::tuple<Out...> out;
      std::apply( [sz = inrange.size()]( auto&&... o ) { ( o.reserve( sz ), ... ); }, out );
      auto& scalar = scalarOp();
      for ( const auto&& indata : inrange ) {
        std::apply(
            [&scalar, &indata]( auto&... out ) {
              details::invoke_optionally(
                  [&out...]( auto&& outdata ) {
                    GF_SUPPRESS_SPURIOUS_CLANG_WARNING_BEGIN
                    std::apply(
                        [&out...]( auto&&... outdata1 ) {
                          ( details::insert( out, std::forward<decltype( outdata1 )>( outdata1 ) ), ... );
                        },
                        std::forward<decltype( outdata )>( outdata ) );
                    GF_SUPPRESS_SPURIOUS_CLANG_WARNING_END
                  },
                  std::apply( [&scalar]( const auto&... args ) { return scalar( details::deref( args )... ); },
                              indata ) );
            },
            out );
      }
      details::applyPostProcessing( scalar, out );
      return out;
    }
  };
} // namespace Gaudi::Functional
 
#endif