#include
#include
#include
#include
#include
template
std::span remove_duplicates(std::span input) {
std::set seen;
auto end_it = std::remove_if(input.begin(), input.end(), [&](const T& value) {
// If the value is already seen, we should remove it
if (seen.find(value) != seen.end()) {
return true; // Mark for removal
} else {
seen.insert(value);
return false; // Keep this value
}
});
return std::span(input.data(), std::distance(input.begin(), end_it));
}
int main() {
std::vector data = {1, 2, 3, 2, 1, 4};
auto result_span = remove_duplicates(std::span(data));
for (const auto& value : result_span) {
std::cout << value << " ";
}
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?