Generalize unique
This commit is contained in:
parent
1d6d14c398
commit
427995b1e3
@ -1588,11 +1588,11 @@ struct RankInfo {
|
|||||||
};
|
};
|
||||||
|
|
||||||
template <typename A>
|
template <typename A>
|
||||||
std::vector<A> unique(std::vector<A> const &xs) {
|
A unique(A const &xs) {
|
||||||
auto result = xs;
|
auto result = xs;
|
||||||
std::sort(result.begin(), result.end());
|
std::sort(std::begin(result), std::end(result));
|
||||||
auto const& last = std::unique(result.begin(), result.end());
|
auto const& last = std::unique(std::begin(result), std::end(result));
|
||||||
result.erase(last, result.end());
|
result.erase(last, std::end(result));
|
||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -1736,6 +1736,7 @@ namespace group_and_sort {
|
|||||||
// Provides the node on which the slice-element is found
|
// Provides the node on which the slice-element is found
|
||||||
// Right now we distribute the slices in a round robin fashion
|
// Right now we distribute the slices in a round robin fashion
|
||||||
// over the different nodes (NOTE: not mpi ranks but nodes)
|
// over the different nodes (NOTE: not mpi ranks but nodes)
|
||||||
|
inline
|
||||||
size_t isOnNode(size_t tuple, size_t nodes) { return tuple % nodes; }
|
size_t isOnNode(size_t tuple, size_t nodes) { return tuple % nodes; }
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user