util/transpose.hpp

View this file on GitHub
Last update: 2024-11-09 00:49:07+00:00
Include: #include "util/transpose.hpp"

Depends on

prelude.hpp

Verified with

test/ds/wavelet_matrix_with_fenwick.test.cpp

Code

#pragma once
#include "prelude.hpp"

template <class T, size_t... Is>
auto transpose_impl(const vector<T>& v, index_sequence<Is...>) {
  tuple<vector<decay_t<tuple_element_t<Is, T>>>...> w;
  (get<Is>(w).reserve(v.size()), ...);
  for (const auto& row : v)
    (get<Is>(w).push_back(get<Is>(row)), ...);
  return w;
}

template <class T>
auto transpose(const vector<T>& v) {
  return transpose_impl(v, make_index_sequence<tuple_size_v<T>>{});
}

#line 2 "prelude.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vc = vector<char>;
#define rep2(i, m, n) for (auto i = (m); i < (n); i++)
#define rep(i, n) rep2(i, 0, n)
#define repr2(i, m, n) for (auto i = (n); i-- > (m);)
#define repr(i, n) repr2(i, 0, n)
#define all(x) begin(x), end(x)
auto ndvec(int n, auto e) { return vector(n, e); }
auto ndvec(int n, auto ...e) { return vector(n, ndvec(e...)); }
auto comp_key(auto&& f) { return [&](auto&& a, auto&& b) { return f(a) < f(b); }; }
auto& max(const auto& a, const auto& b) { return a < b ? b : a; }
auto& min(const auto& a, const auto& b) { return b < a ? b : a; }
#if __cpp_lib_ranges
namespace R = std::ranges;
namespace V = std::views;
#endif
#line 3 "util/transpose.hpp"

template <class T, size_t... Is>
auto transpose_impl(const vector<T>& v, index_sequence<Is...>) {
  tuple<vector<decay_t<tuple_element_t<Is, T>>>...> w;
  (get<Is>(w).reserve(v.size()), ...);
  for (const auto& row : v)
    (get<Is>(w).push_back(get<Is>(row)), ...);
  return w;
}

template <class T>
auto transpose(const vector<T>& v) {
  return transpose_impl(v, make_index_sequence<tuple_size_v<T>>{});
}