32 #include <type_traits> 35 #include <QStringList> 36 #include <boost/optional.hpp> 58 template<
typename T1,
typename T2,
template<
typename U>
class Container,
typename F>
66 auto i1 = begin (c1), e1 = end (c1);
67 auto i2 = begin (c2), e2 = end (c2);
68 for ( ; i1 != e1 && i2 != e2; ++i1, ++i2)
69 result.push_back (f (*i1, *i2));
73 template<
typename T1,
typename T2,
74 template<
typename U>
class Container,
75 template<
typename U1,
typename U2>
class Pair = QPair>
76 auto Zip (
const Container<T1>& c1,
const Container<T2>& c2) -> Container<Pair<T1, T2>>
79 [] (
const T1& t1,
const T2& t2) -> Pair<T1, T2>
80 {
return { t1, t2}; });
85 template<
typename Res,
typename T>
86 void Append (Res& result, T&& val, decltype (result.push_back (std::forward<T> (val)))* =
nullptr)
88 result.push_back (std::forward<T> (val));
91 template<
typename Res,
typename T>
92 void Append (Res& result, T&& val, decltype (result.insert (std::forward<T> (val)))* =
nullptr)
94 result.insert (std::forward<T> (val));
97 template<
typename T,
typename F>
103 template<
typename T,
typename F>
109 template<
typename T,
typename F>
112 return IsInvokableWithConstImpl<typename std::decay<T>::type, F> (0);
115 template<
template<
typename>
class Cont,
typename T>
128 template<
typename T,
template<
typename U>
class Container,
typename F>
129 auto Map (
const Container<T>& c, F f) ->
typename std::enable_if<!std::is_same<void, decltype (
Invoke (f, *c.begin ()))>::value,
132 Container<
typename std::decay<decltype (
Invoke (f, *c.begin ()))>
::type> result;
138 template<
typename Container,
typename F,
template<
typename>
class ResultCont =
QList>
139 auto Map (
const Container& c, F f) ->
typename std::enable_if<!detail::IsSimpleContainer<Container> () && !std::is_same<
void, decltype (
Invoke (f, *c.begin ()))>::value,
142 ResultCont<
typename std::decay<decltype (
Invoke (f, *c.begin ()))>
::type> cont;
148 template<
typename Container,
typename F>
149 auto Map (Container& c, F f) ->
typename std::enable_if<!detail::IsSimpleContainer<Container> () && std::is_same<
void, decltype (
Invoke (f, *c.begin ()))>::value>
::type 155 template<
typename Container,
typename F,
typename... ContArgs>
156 auto Map (
const Container& c, F f) ->
typename std::enable_if<!detail::IsSimpleContainer<Container> () && std::is_same<
void, decltype (
Invoke (f, *c.begin ()))>::value>
::type 183 template<
typename T,
template<
typename U>
class Container,
typename F>
184 auto Map (
const Container<T>& c, F f) ->
typename std::enable_if<std::is_same<void, decltype (Invoke (f, std::declval<T> ()))>::value,
void>::
type 190 template<
typename T,
template<
typename U>
class Container,
typename F>
191 Container<T>
Filter (
const Container<T>& c, F f)
194 for (
const auto& item : c)
196 result.push_back (item);
200 template<
template<
typename>
class Container,
typename T>
201 Container<T>
Concat (
const Container<Container<T>>& containers)
204 for (
const auto& cont : containers)
205 std::copy (cont.begin (), cont.end (), std::back_inserter (result));
209 template<
template<
typename...>
class Container,
typename... ContArgs>
210 auto Concat (
const Container<ContArgs...>& containers) ->
typename std::decay<decltype (*containers.begin ())>::
type 212 typename std::decay<decltype (*containers.begin ())>::
type result;
213 for (
const auto& cont : containers)
214 std::copy (cont.begin (), cont.end (), std::back_inserter (result));
218 template<
typename Cont,
typename F>
219 auto ConcatMap (Cont&& c, F&& f) -> decltype (
Concat (
Map (std::forward<Cont> (c), std::forward<F> (f))))
221 return Concat (
Map (std::forward<Cont> (c), std::forward<F> (f)));
224 template<
template<
typename>
class Container,
typename T>
225 Container<Container<T>>
SplitInto (
size_t numChunks,
const Container<T>& container)
227 Container<Container<T>> result;
229 const size_t chunkSize = container.size () / numChunks;
230 for (
size_t i = 0; i < numChunks; ++i)
232 Container<T> subcont;
233 const auto start = container.begin () + chunkSize * i;
234 const auto end = start + chunkSize;
235 std::copy (start, end, std::back_inserter (subcont));
236 result.push_back (subcont);
239 const auto lastStart = container.begin () + chunkSize * numChunks;
240 const auto lastEnd = container.end ();
241 std::copy (lastStart, lastEnd, std::back_inserter (result.front ()));
246 template<
template<
typename Pair,
typename... Rest>
class Cont, template<typename K, typename V> class Pair, typename K, typename V, typename KV, typename... Rest>
247 boost::optional<V>
Lookup (const KV& key, const Cont<Pair<K, V>, Rest...>& cont)
249 for (
const auto& pair : cont)
250 if (pair.first == key)
256 template<
typename Cont>
259 std::sort (cont.begin (), cont.end ());
267 return [r] (
const auto& left,
const auto& right) {
return Invoke (r, left) <
Invoke (r, right); };
270 const auto Apply = [] (
const auto& t) {
return t (); };
275 return [f = std::move (f)] (
const auto& pair) {
return Invoke (f, pair.first); };
281 return [f = std::move (f)] (
const auto& pair) {
return Invoke (f, pair.second); };
292 bool operator() (
const T& left,
const T& right)
const 308 typename std::result_of<T ()>::type operator() (
const T& t)
const 321 template<
typename Pair>
322 auto operator() (
const Pair& pair) -> decltype (
Invoke (F_, pair.first))
324 return Invoke (F_, pair.first);
333 template<
typename Pair>
334 auto operator() (
const Pair& pair) -> decltype (
Invoke (F_, pair.second))
336 return Invoke (F_, pair.second);
auto Zip(const Container< T1 > &c1, const Container< T2 > &c2) -> Container< Pair< T1, T2 >>
constexpr bool IsInvokableWithConstImpl(...)
auto ZipWith(const Container< T1 > &c1, const Container< T2 > &c2, F f) -> WrapType_t< Container< Decay_t< ResultOf_t< F(T1, T2)>>>>
Container< T > Concat(const Container< Container< T >> &containers)
struct LeechCraft::Util::@2 Apply
detail::ComparingByClosure< R > ComparingBy(R r)
auto ConcatMap(Cont &&c, F &&f) -> decltype(Concat(Map(std::forward< Cont >(c), std::forward< F >(f))))
detail::Snd< F > Second(F f)
void Append(Res &result, T &&val, decltype(result.insert(std::forward< T >(val)))*=nullptr)
void Append(Res &result, T &&val, decltype(result.push_back(std::forward< T >(val)))*=nullptr)
Container< T > Filter(const Container< T > &c, F f)
constexpr bool IsSimpleContainer()
auto Map(const Container< T > &c, F f) -> typename std::enable_if<!std::is_same< void, decltype(Invoke(f,*c.begin()))>::value, WrapType_t< Container< typename std::decay< decltype(Invoke(f,*c.begin()))>::type >>>::type
detail::Fst< F > First(F f)
auto Invoke(F &&f, Args &&...args) -> decltype(std::forward< F >(f)(std::forward< Args >(args)...))
boost::optional< V > Lookup(const KV &key, const Cont< Pair< K, V >, Rest... > &cont)
typename WrapType< T >::type WrapType_t
constexpr bool IsInvokableWithConst()
Container< Container< T > > SplitInto(size_t numChunks, const Container< T > &container)