Index: uspace/lib/cpp/include/impl/unordered_map.hpp
===================================================================
--- uspace/lib/cpp/include/impl/unordered_map.hpp	(revision c7d7368c97e59c1cfd85de75aedaa9facc055a1e)
+++ uspace/lib/cpp/include/impl/unordered_map.hpp	(revision 46c766879be0b87b8eb1017a5336ecf1ea7a3f5a)
@@ -266,5 +266,7 @@
             template<class T>
             pair<iterator, bool> insert(
-                enable_if_t<is_constructible_v<value_type, T&&>, T&&> val)
+                T&& val,
+                enable_if_t<is_constructible_v<value_type, T&&>>* = nullptr
+            )
             {
                 return emplace(forward<T>(val));
@@ -284,5 +286,6 @@
             iterator insert(
                 const_iterator hint,
-                enable_if_t<is_constructible_v<value_type, T&&>, T&&> val
+                T&& val,
+                enable_if_t<is_constructible_v<value_type, T&&>>* = nullptr
             )
             {
@@ -940,5 +943,6 @@
             template<class T>
             iterator insert(
-                enable_if_t<is_constructible_v<value_type, T&&>, T&&> val
+                T&& val,
+                enable_if_t<is_constructible_v<value_type, T&&>>* = nullptr
             )
             {
@@ -959,5 +963,6 @@
             iterator insert(
                 const_iterator hint,
-                enable_if_t<is_constructible_v<value_type, T&&>, T&&> val
+                T&& val,
+                enable_if_t<is_constructible_v<value_type, T&&>>* = nullptr
             )
             {
@@ -1160,4 +1165,5 @@
                     unordered_map<Key, Value, Hash, Pred, Alloc>& rhs)
     {
+        // TODO: this does not compare values, use is_permutation when we have it
         return lhs.table_.is_eq_to(rhs.table_);
     }