| 75 * @note Iterators provided by this hash map implementation provide the remove operation. |
75 * @note Iterators provided by this hash map implementation provide the remove operation. |
| 76 * The index value of an iterator is incremented when the iterator advanced without removal. |
76 * The index value of an iterator is incremented when the iterator advanced without removal. |
| 77 * In other words, when the iterator is finished, \c index==size . |
77 * In other words, when the iterator is finished, \c index==size . |
| 78 * |
78 * |
| 79 * @param allocator the allocator to use |
79 * @param allocator the allocator to use |
| |
80 * (if \c NULL, a default stdlib allocator will be used) |
| 80 * @param itemsize the size of one element |
81 * @param itemsize the size of one element |
| 81 * @param buckets the initial number of buckets in this hash map |
82 * @param buckets the initial number of buckets in this hash map |
| 82 * @return a pointer to the new hash map |
83 * @return a pointer to the new hash map |
| 83 */ |
84 */ |
| 84 cx_attr_nonnull |
|
| 85 cx_attr_nodiscard |
85 cx_attr_nodiscard |
| 86 cx_attr_malloc |
86 cx_attr_malloc |
| 87 cx_attr_dealloc(cxMapDestroy, 1) |
87 cx_attr_dealloc(cxMapDestroy, 1) |
| 88 CxMap *cxHashMapCreate( |
88 CxMap *cxHashMapCreate( |
| 89 const CxAllocator *allocator, |
89 const CxAllocator *allocator, |