simpleified flat_set::contains as we only need comparisons to work

Author: Klaim

libmamba/include/mamba/util/flat_set.hpp

@@ -112,11 +112,7 @@ namespace mamba::util
         auto erase(const_iterator first, const_iterator last) -> const_iterator;
         auto erase(const value_type& value) -> size_type;
 
-        template <
-            class T,
-            // TODO: C++ >= 20 replace by concept
-            class = std::enable_if_t<
-                std::is_convertible_v<T, value_type> || std::is_convertible_v<value_type, T>>>
+        template <class T>
         auto contains(const T& value) const -> bool;
 
     private:
@@ -416,7 +412,7 @@ namespace mamba::util
     }
 
     template <typename K, typename C, typename A>
-    template <class T, class>
+    template <class T>
     auto flat_set<K, C, A>::contains(const T& value) const -> bool
     {
         return std::binary_search(begin(), end(), value);