summaryrefslogtreecommitdiff
path: root/deps/tao_tuple/28626e99/include/tao/seq/partial_sum.hpp
blob: b66a02d5f00c58fa5cbb6a63626e3f4e6469e366 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
// The Art of C++ / Sequences
// Copyright (c) 2015 Daniel Frey

#ifndef TAOCPP_SEQUENCES_INCLUDE_PARTIAL_SUM_HPP
#define TAOCPP_SEQUENCES_INCLUDE_PARTIAL_SUM_HPP

#include <cstddef>
#include <utility>

#include "make_integer_sequence.hpp"
#include "sum.hpp"

namespace tao
{
  namespace seq
  {
    namespace impl
    {
      template< std::size_t, typename S, typename = make_index_sequence< S::size() > >
      struct partial_sum;

      template< std::size_t I, typename T, T... Ns, std::size_t... Is >
      struct partial_sum< I, integer_sequence< T, Ns... >, index_sequence< Is... > >
        : seq::sum< T, ( ( Is < I ) ? Ns : 0 )... >
      {
        static_assert( I <= sizeof...( Is ), "tao::seq::partial_sum<I, S>: I is out of range" );
      };
    }

    template< std::size_t I, typename T, T... Ns >
    struct partial_sum
      : impl::partial_sum< I, integer_sequence< T, Ns... > >
    {};

    template< std::size_t I, typename T, T... Ns >
    struct partial_sum< I, integer_sequence< T, Ns... > >
      : impl::partial_sum< I, integer_sequence< T, Ns... > >
    {};
  }
}

#endif // TAOCPP_SEQUENCES_INCLUDE_PARTIAL_SUM_HPP