Updates with latest TommyDS.

tommyarrayblk.h

@@ -34,7 +34,7 @@
  * the already allocated memory, and then not increasing the heap fragmentation.
  * This means that the address of the allocated blocks never change.
  *
- * Allocated blocks are always of the same fixed size of 64 KiB.
+ * Allocated blocks are always of the same fixed size of 64 Ki pointers.
  */
 
 #ifndef __TOMMYARRAYBLK_H

tommyarrayblkof.h

@@ -32,6 +32,9 @@
  *
  * This is very similar at ::tommy_arrayblk, but it allows to store elements of any
  * size and not just pointers.
+ *
+ * Note that in this case tommy_arrayblkof_ref() returns a pointer at the element,
+ * and it should be used for both get() and set() operation.
  */
 
 #ifndef __TOMMYARRAYBLKOF_H
@@ -61,6 +64,7 @@ typedef struct tommy_arrayblkof_struct {
 
 /**
  * Initializes the array.
+ * \param element_size Size in byte of the element to store in the array.
  */
 void tommy_arrayblkof_init(tommy_arrayblkof* array, unsigned element_size);
 

tommyhashdyn.h

@@ -170,6 +170,9 @@ void tommy_hashdyn_init(tommy_hashdyn* hashdyn);
 
 /**
  * Deinitializes the hashtable.
+ *
+ * You can call this function with elements still contained,
+ * but such elements are not going to be freed by this call.
  */
 void tommy_hashdyn_done(tommy_hashdyn* hashdyn);