Function DecideOrder

oneflow/core/auto_parallel/algorithm_util.h:60–66

// comp(v[order[i]], v[order[j]]) == true for all i<j.
template<class T, class Compare>
void DecideOrder(const T& v, std::vector<int32_t>& order, const Compare& comp) {
  // Initialize order
  order.resize(v.size());
  for (int32_t i = 0; i < v.size(); i++) { order[i] = i; }
  // sort
  std::sort(order.begin(), order.end(), [&](int32_t i, int32_t j) { return comp(v[i], v[j]); });
}

// Inverse function of order
// The reason why we need the inverse_order, a.k.a id2order, instead of id2value is to eliminate