diff -r d7129285ac32 -r dce9b8450656 src/cx/hash_map.h
--- a/src/cx/hash_map.h	Tue Mar 21 17:21:20 2023 +0100
+++ b/src/cx/hash_map.h	Tue Mar 28 19:13:33 2023 +0200
@@ -70,6 +70,9 @@
  *
  * If \p buckets is zero, an implementation defined default will be used.
  *
+ * If \p itemsize is CX_STORE_POINTERS, the created map will be created as if
+ * cxMapStorePointers() was called immediately after creation.
+ *
  * @note Iterators provided by this hash map implementation provide the remove operation.
  * The index value of an iterator is the incremented when the iterator advanced without removal.
  * In other words, when the iterator is finished, \c index==size .
@@ -87,27 +90,6 @@
 );
 
 /**
- * Convenience function for creating a hash map that is storing pointers.
- *
- * If \p buckets is zero, an implementation defined default will be used.
- *
- * @param allocator the allocator to use
- * @param buckets the initial number of buckets in this hash map
- * @return a pointer to the new hash map
- */
-__attribute__((__nonnull__, __warn_unused_result__))
-static inline CxMap *cxHashMapCreateForPointers(
-        CxAllocator *allocator,
-        size_t buckets
-) {
-    CxMap *map = cxHashMapCreate(allocator, sizeof(void *), buckets);
-    if (map != NULL) {
-        map->store_pointers = true;
-    }
-    return map;
-}
-
-/**
  * Increases the number of buckets, if necessary.
  *
  * The load threshold is \c 0.75*buckets. If the element count exceeds the load