Leonardo Vencovsky

Tests should be based on heap allocated of `char *` and not `size_t` to test against `NULL` pointers and memory leaks.

Currently, bitset always uses a power of 2 size. If you want to only use 100 bits, all operations are based on 128 and might be incorrect. Operations on the...

...and that needs to change. * [ ] hashbidimap * [x] hashmultimap * [x] hashmultiset * [x] hashset * [x] treemap * [ ] treeset

HashBidiMap iterators are still not implemented properly. Currently you can only iterate over the keys. Decide whether: * [ ] One iterator containing both IterKey and IterVal * [ ]...

With the release of 1.8, examples and benchmarks are once again outdated. - [ ] Remake examples - [ ] Remake benchmarks

## INIT - [x] Bitset - [x] Deque - [x] HashBidiMap - [x] HashMap - [ ] HashMultiMap - [ ] HashMultiSet - [ ] HashSet - [ ] Heap...

Basic implementation and tests - [ ] Bitset - [ ] Deque - [ ] HashBidiMap - [ ] HashMap - [ ] HashMultiMap - [ ] HashMultiSet - [...

``` struct cmc_collection { enum cmc_collection_type type; // DEQUE, HASHMAP, LIST, STACK, etc const char *key_type; const char *val_type; }; ``` A `cmc_collection` is the common interface to all data...

Function tables shouldn't be required

3

The library should: - [ ] Allow fkey and fval parameters to be null - [ ] Check in _new() for required functions - [ ] Check if the struct...

When removing elements from a collection, check if ftable->free exists

1

- [ ] When a collection pops or removes elements from it, without returning it to the user, check for `ftable->free` and free the element