42 template<
template<
typename U>
class Container,
typename T1,
typename T2,
typename F>
43 auto ZipWith (
const Container<T1>& c1,
const Container<T2>& c2, F f) ->
WrapType_t<Container<std::decay_t<std::result_of_t<F (T1, T2)>>>>
45 WrapType_t<Container<std::decay_t<std::result_of_t<F (T1, T2)>>>> result;
50 auto i1 = begin (c1), e1 = end (c1);
51 auto i2 = begin (c2), e2 = end (c2);
52 for ( ; i1 != e1 && i2 != e2; ++i1, ++i2)
53 result.push_back (f (*i1, *i2));
57 template<
typename T1,
typename T2,
58 template<
typename U>
class Container,
59 template<
typename U1,
typename U2>
class Pair = QPair>
60 auto Zip (
const Container<T1>& c1,
const Container<T2>& c2) -> Container<Pair<T1, T2>>
63 [] (
const T1& t1,
const T2& t2) -> Pair<T1, T2>
64 {
return { t1, t2}; });
69 template<
typename Res,
typename T>
70 void Append (Res& result, T&& val,
decltype (result.push_back (std::forward<T> (val)))* =
nullptr)
72 result.push_back (std::forward<T> (val));
75 template<
typename Res,
typename T>
76 void Append (Res& result, T&& val,
decltype (result.insert (std::forward<T> (val)))* =
nullptr)
78 result.insert (std::forward<T> (val));
87 template<
template<
typename...>
class Container,
typename... Args>
99 template<
typename Container,
typename T>
105 template<
template<
typename>
class Container,
typename U,
typename T>
120 template<
template<
typename...>
class Fallback,
bool ForceFallback,
typename Container,
typename F>
123 using FRet_t = std::decay_t<
decltype (std::invoke (f, *c.begin ()))>;
124 static_assert (!std::is_same<void, FRet_t> {},
"The function shall not return void.");
126 using DecayContainer_t = std::decay_t<Container>;
128 using ResultCont_t = std::conditional_t<
130 detail::IsSimpleContainer<DecayContainer_t> () &&
131 !detail::IsNotBrokenSFINAE_v<DecayContainer_t>,
137 Append (cont, std::invoke (f, t));
142 template<
typename Container,
typename F>
143 auto Map (Container&& c, F f)
145 return detail::MapImpl<QList, false> (std::forward<Container> (c), std::forward<F> (f));
148 template<
template<
typename...>
class Fallback,
typename Container,
typename F>
151 return detail::MapImpl<Fallback, true> (std::forward<Container> (c), std::forward<F> (f));
154 template<
typename T,
template<
typename U>
class Container,
typename F>
155 Container<T>
Filter (
const Container<T>& c, F f)
158 for (
const auto& item : c)
159 if (std::invoke (f, item))
164 template<
template<
typename>
class Container,
typename T>
165 Container<T>
Concat (
const Container<Container<T>>& containers)
168 for (
const auto& cont : containers)
169 std::copy (cont.begin (), cont.end (), std::back_inserter (result));
173 template<
template<
typename...>
class Container,
typename... ContArgs>
174 auto Concat (
const Container<ContArgs...>& containers) -> std::decay_t<
decltype (*containers.begin ())>
176 std::decay_t<
decltype (*containers.begin ())> result;
177 for (
const auto& cont : containers)
178 for (
const auto& item : cont)
183 template<
typename Cont,
typename F>
186 return Concat (
Map (std::forward<Cont> (c), std::forward<F> (f)));
189 template<
template<
typename>
class Container,
typename T>
190 Container<Container<T>>
SplitInto (
size_t numChunks,
const Container<T>& container)
192 Container<Container<T>> result;
194 const size_t chunkSize = container.size () / numChunks;
195 for (
size_t i = 0; i < numChunks; ++i)
197 Container<T> subcont;
198 const auto start = container.begin () + chunkSize * i;
199 const auto end = start + chunkSize;
200 std::copy (start, end, std::back_inserter (subcont));
201 result.push_back (subcont);
204 const auto lastStart = container.begin () + chunkSize * numChunks;
205 const auto lastEnd = container.end ();
206 std::copy (lastStart, lastEnd, std::back_inserter (result.front ()));
211 template<
typename Cont>
214 std::sort (cont.begin (), cont.end ());
215 return std::forward<Cont> (cont);
218 constexpr auto Id = [] (
auto&& t) ->
decltype (
auto) {
return std::forward<decltype (t)> (t); };
223 return [r] (
const auto& left,
const auto& right) {
return std::invoke (r, left) < std::invoke (r, right); };
229 return [r] (
const auto& left,
const auto& right) {
return std::invoke (r, left) == std::invoke (r, right); };
232 constexpr auto Apply = [] (
const auto& t) {
return t (); };
234 constexpr auto Fst = [] (
const auto& pair) {
return pair.first; };
236 constexpr auto Snd = [] (
const auto& pair) {
return pair.second; };
241 return [f = std::forward<F> (f)] (
const auto& pair) {
return std::invoke (f, pair.first); };
247 return [f = std::forward<F> (f)] (
const auto& pair) {
return std::invoke (f, pair.second); };
auto MapImpl(Container &&c, F f)
constexpr bool IsSimpleContainer()
constexpr bool IsNotBrokenSFINAE_v
void Append(Res &result, T &&val, decltype(result.push_back(std::forward< T >(val))) *=nullptr)
Container< T > Filter(const Container< T > &c, F f)
auto ConcatMap(Cont &&c, F &&f)
typename WrapType< T >::type WrapType_t
Container< T > Concat(const Container< Container< T > > &containers)
auto MapAs(Container &&c, F &&f)
auto ZipWith(const Container< T1 > &c1, const Container< T2 > &c2, F f) -> WrapType_t< Container< std::decay_t< std::result_of_t< F(T1, T2)> > > >
decltype(auto) Sorted(Cont &&cont)
auto Zip(const Container< T1 > &c1, const Container< T2 > &c2) -> Container< Pair< T1, T2 > >
auto Map(Container &&c, F f)
Container< Container< T > > SplitInto(size_t numChunks, const Container< T > &container)
static const size_t ArgsCount