update readme

readme.md

@@ -21,7 +21,7 @@ Asserts are used to check various assumptions. Use `NDEBUG` flag to turn off ass
 | [fpqueue.h](https://github.com/abxh/data-structures-c/blob/main/lib/fpqueue.h)       | Fixed-size priority queue based on binary (max-)heap     | [Documentation](https://abxh.github.io/data-structures-c/fpqueue_8h.html)                                                                                   |
 | [fhashtable.h](https://github.com/abxh/data-structures-c/blob/main/lib/fhashtable.h) | Fixed-size open-adressing hashtable (robin hood hashing) | [Documentation](https://abxh.github.io/data-structures-c/fhashtable_8h.html)                                                                                |
 | [arena.h](https://github.com/abxh/data-structures-c/blob/main/lib/arena.h)           | Arena allocator                                          | [Documentation](https://abxh.github.io/data-structures-c/arena_8h.html)                                                                                     |
-| [pool.h](https://github.com/abxh/data-structures-c/blob/main/lib/arena.h)            | Pool allocator                                           | [Documentation](https://abxh.github.io/data-structures-c/arena_8h.html)                                                                                     |
+| [pool.h](https://github.com/abxh/data-structures-c/blob/main/lib/pool.h)             | Pool allocator                                           | [Documentation](https://abxh.github.io/data-structures-c/pool_8h.html)                                                                                      |
 | [freelist.h](https://github.com/abxh/data-structures-c/blob/main/lib/freelist.h)     | Best-fit free list allocator (with underlying free tree) | [Documentation](https://abxh.github.io/data-structures-c/freelist_8h.html)                                                                                  |
 | [list.h](https://github.com/abxh/data-structures-c/blob/main/lib/list.h)             | Intrusive circular doubly linked list                    | [Documentation](https://abxh.github.io/data-structures-c/list_8h.html)                                                                                      |
 | [rbtree.h](https://github.com/abxh/data-structures-c/blob/main/lib/rbtree.h)         | Intrusive red-black tree                                 | [Documentation](https://abxh.github.io/data-structures-c/rbtree_8h.html)                                                                                    |