1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
|
#pragma once
#include <c10/util/ArrayRef.h>
#include <c10/util/Exception.h>
#include <c10/util/irange.h>
#include <vector>
namespace torch::lazy {
TORCH_API std::vector<int64_t> InversePermutation(
c10::ArrayRef<int64_t> input_permutation);
TORCH_API bool IsPermutation(c10::ArrayRef<int64_t> permutation);
// Gathers the input using the order specified by the permutation. For each i,
// output[i] = dimensions[permutation[i]]. The given permutation must be the
// same size as the input.
template <typename Container>
std::vector<typename Container::value_type> PermuteDimensions(
c10::ArrayRef<int64_t> permutation,
const Container& dimensions) {
using T = typename Container::value_type;
TORCH_CHECK(
dimensions.size() == permutation.size(),
"Invalid permutation specified. dimensions.size() != permutation.size() (",
dimensions.size(),
" vs. ",
permutation.size(),
")");
TORCH_CHECK(
IsPermutation(permutation),
"Invalid permutation specified. Permutation is not permutation");
std::vector<T> output(dimensions.size());
for (const auto i : c10::irange(permutation.size())) {
output[i] = dimensions[permutation[i]];
}
return output;
}
} // namespace torch::lazy
|
