/*! @file Forward declares `boost::hana::zip_shortest_with`. @copyright Louis Dionne 2013-2016 Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt) */ #ifndef BOOST_HANA_FWD_ZIP_SHORTEST_WITH_HPP #define BOOST_HANA_FWD_ZIP_SHORTEST_WITH_HPP #include #include BOOST_HANA_NAMESPACE_BEGIN //! Zip one sequence or more with a given function. //! @ingroup group-Sequence //! //! Given a `n`-ary function `f` and `n` sequences `s1, ..., sn`, //! `zip_shortest_with` produces a sequence whose `i`-th element is //! `f(s1[i], ..., sn[i])`, where `sk[i]` denotes the `i`-th element of //! the `k`-th sequence. In other words, `zip_shortest_with` produces a //! sequence of the form //! @code //! [ //! f(s1[0], ..., sn[0]), //! f(s1[1], ..., sn[1]), //! ... //! f(s1[M], ..., sn[M]) //! ] //! @endcode //! where `M` is the length of the shortest sequence. Hence, the returned //! sequence stops when the shortest input sequence is exhausted. If you //! know that all the sequences you are about to zip have the same length, //! you should use `zip_with` instead, since it can be more optimized. //! Also note that it is an error to provide no sequence at all, i.e. //! `zip_shortest_with` expects at least one sequence. //! //! //! Example //! ------- //! @include example/zip_shortest_with.cpp #ifdef BOOST_HANA_DOXYGEN_INVOKED constexpr auto zip_shortest_with = [](auto&& f, auto&& x1, ..., auto&& xn) { return tag-dispatched; }; #else template struct zip_shortest_with_impl : zip_shortest_with_impl> { }; struct zip_shortest_with_t { template constexpr auto operator()(F&& f, Xs&& xs, Ys&& ...ys) const; }; constexpr zip_shortest_with_t zip_shortest_with{}; #endif BOOST_HANA_NAMESPACE_END #endif // !BOOST_HANA_FWD_ZIP_SHORTEST_WITH_HPP