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
|
#include <c10/util/irange.h>
#include <torch/csrc/lazy/core/permutation_util.h>
#include <algorithm>
#include <numeric>
namespace torch {
namespace lazy {
std::vector<int64_t> InversePermutation(
c10::ArrayRef<int64_t> input_permutation) {
TORCH_CHECK(IsPermutation(input_permutation));
std::vector<int64_t> output_permutation(input_permutation.size(), -1);
for (const auto i : c10::irange(input_permutation.size())) {
output_permutation.at(input_permutation.at(i)) = i;
}
return output_permutation;
}
bool IsPermutation(c10::ArrayRef<int64_t> permutation) {
std::vector<int64_t> trivial_permutation(permutation.size());
std::iota(trivial_permutation.begin(), trivial_permutation.end(), 0);
return std::is_permutation(
permutation.begin(), permutation.end(), trivial_permutation.begin());
}
} // namespace lazy
} // namespace torch
|
