drop.hpp
Go to the documentation of this file.
1 //
2 // Copyright (C) 2014, 2015 Ableton AG, Berlin. All rights reserved.
3 //
4 // Permission is hereby granted, free of charge, to any person obtaining a
5 // copy of this software and associated documentation files (the "Software"),
6 // to deal in the Software without restriction, including without limitation
7 // the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 // and/or sell copies of the Software, and to permit persons to whom the
9 // Software is furnished to do so, subject to the following conditions:
10 //
11 // The above copyright notice and this permission notice shall be included in
12 // all copies or substantial portions of the Software.
13 //
14 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
19 // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
20 // DEALINGS IN THE SOFTWARE.
21 //
22 
27 #pragma once
28 
31 #include <atria/xform/skip.hpp>
33 
34 namespace atria {
35 namespace xform {
36 
37 namespace detail {
38 
39 struct drop_rf_gen
40 {
41  template <typename ReducingFnT,
42  typename IntegralT>
43  struct apply
44  {
45  ReducingFnT step;
46  IntegralT total;
47 
48  template <typename StateT, typename ...InputTs>
49  auto operator() (StateT&& s, InputTs&& ...is)
50  -> decltype(
51  wrap_state(call(step, state_unwrap(std::forward<StateT>(s)),
52  std::forward<InputTs>(is)...),
53  total))
54  {
55  auto count = state_data(std::forward<StateT>(s),
56  constantly(total));
57  return count != 0
58  ? wrap_state(
59  skip(step,
60  state_unwrap(std::forward<StateT>(s)),
61  std::forward<InputTs>(is)...),
62  count - 1)
63  : wrap_state(
64  call(step,
65  state_unwrap(std::forward<StateT>(s)),
66  std::forward<InputTs>(is)...),
67  count);
68  }
69  };
70 };
71 
72 } // namespace detail
73 
74 template <typename T>
75 using drop_t = transducer_impl<detail::drop_rf_gen, T>;
76 
80 template <typename IntegralT>
81 auto drop(IntegralT&& n)
83 {
85  std::forward<IntegralT>(n) };
86 }
87 
88 } // namespace xform
89 } // namespace atria
constexpr auto count(InitT init=InitT{0}, StepT step=StepT{1}) -> count_t< InitT, StepT >
Generator transducer produces a sequence:
Definition: count.hpp:78
auto call(ReducingFnT &&step, StateT &&state, InputTs &&...ins) -> estd::enable_if_t< is_skip_state< estd::decay_t< StateT > >
Call the next reducing function in a transducer that could otherwise skip calling the next reducing f...
Definition: skip.hpp:276
auto state_unwrap(T &&s) -> decltype(state_traits_t< T >::unwrap(std::forward< T >(s)))
Convenience function for calling state_traits::unwrap
STL namespace.
auto constantly(T &&value) -> constantly_t< estd::decay_t< T > >
Similar to clojure.core/constantly.
Definition: constantly.hpp:56
auto state_data(T &&s, D &&d) -> decltype(state_traits_t< T >::data(std::forward< T >(s), std::forward< D >(d)))
Convenience function for calling state_traits::data
Utility to write simple transducers easily.
C++ amazing templates and reusable implementations awesomeness.
Definition: _doc.hpp:35
auto wrap_state(StateT &&next, DataT &&data=DataT{}) -> state_wrapper< TagT, estd::decay_t< StateT >, estd::decay_t< DataT > >
Given a tag TagT and a state next and associated data, returns a state_wrapper instance.
auto skip(ReducingFnT &&, StateT &&state, InputTs &&...) -> skip_result_t< ReducingFnT, StateT, InputTs... >
Skip calling the next reducing function in a transducer.
Definition: skip.hpp:228
auto drop(IntegralT &&n) -> drop_t< estd::decay_t< IntegralT > >
Similar to clojure.core/drop$1.
Definition: drop.hpp:81
Fork me on GitHub