unordered_set 1.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243
  1. // -*-c++-*-
  2. // vim: set ft=cpp:
  3. /* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
  4. file LICENSE.rst or https://cmake.org/licensing for details. */
  5. #pragma once
  6. #include <unordered_set> // IWYU pragma: export
  7. #include <cm/bits/container_helpers.hxx> // IWYU pragma: export
  8. #include <cm/bits/erase_if.hxx>
  9. namespace cm {
  10. // should be updated when C++20 is finalized
  11. #if (__cplusplus > 201703L || \
  12. (defined(_MSVC_LANG) && _MSVC_LANG > 201703)) && \
  13. defined(__cpp_lib_erase_if)
  14. using std::erase_if;
  15. #else
  16. template <typename Key, typename Hash, typename KeyEqual, typename Allocator,
  17. typename Predicate>
  18. inline void erase_if(std::unordered_set<Key, Hash, KeyEqual, Allocator>& cont,
  19. Predicate pred)
  20. {
  21. internals::erase_if(cont, pred);
  22. }
  23. template <typename Key, typename Hash, typename KeyEqual, typename Allocator,
  24. typename Predicate>
  25. inline void erase_if(
  26. std::unordered_multiset<Key, Hash, KeyEqual, Allocator>& cont,
  27. Predicate pred)
  28. {
  29. internals::erase_if(cont, pred);
  30. }
  31. #endif
  32. } // namespace cm