take_while.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 take_while_rf_gen
40 {
41  template <typename ReducingFnT,
42  typename PredicateT>
43  struct apply
44  {
45  ReducingFnT step;
46  PredicateT predicate;
47 
48  template <typename StateT, typename ...InputTs>
49  auto operator() (StateT&& s, InputTs&& ...is)
50  -> maybe_reduced<estd::decay_t<decltype(
51  call(step, state_unwrap(std::forward<StateT>(s)),
52  std::forward<InputTs>(is)...))> >
53  {
54  return estd::invoke(predicate, is...)
55  ? not_reduced(call(step, state_unwrap(std::forward<StateT>(s)),
56  std::forward<InputTs>(is)...))
57  : reduced(skip(step, state_unwrap(std::forward<StateT>(s)),
58  std::forward<InputTs>(is)...));
59  }
60  };
61 };
62 
63 } // namespace detail
64 
65 template <typename T>
66 using take_while_t = transducer_impl<detail::take_while_rf_gen, T>;
67 
71 template <typename PredicateT>
72 auto take_while(PredicateT&& p)
74 {
76  std::forward<PredicateT>(p) };
77 }
78 
79 } // namespace xform
80 } // namespace atria
auto reduced(T &&x) -> decltype(reduced_if(std::forward< T >(x), true))
Wraps x such that the reduction should finish.
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.
state_wrapper< maybe_reduced_tag, T, bool > maybe_reduced
State wrapper for transducers that may want to signal that the reduction is finished.
typename std::decay< T >::type decay_t
Similar to C++14 std::decay_t.
Definition: type_traits.hpp:54
auto take_while(PredicateT &&p) -> take_while_t< estd::decay_t< PredicateT > >
Similar to clojure.core/take_while$1.
Definition: take_while.hpp:72
Utility to write simple transducers easily.
auto not_reduced(T &&x) -> decltype(reduced_if(std::forward< T >(x), false))
Wraps x such that the reduction should continue.
C++ amazing templates and reusable implementations awesomeness.
Definition: _doc.hpp:35
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
Fork me on GitHub