rt/snapraid
1
0
Fork 0
mirror of https://github.com/amadvance/snapraid.git synced 2026-10-26 19:01:57 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update to TommyDS v2.1

Browse source
This commit is contained in:
Andrea Mazzoleni 2016-11-03 18:33:12 +01:00
parent 4c6eb5b3a8
commit 18f89c1a56
2 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

2
tommyds/tommyarrayblkof.h
View file

@ -33,7 +33,7 @@
* 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,
* Note that in this case tommy_arrayblkof_ref() returns a pointer to the element,
* that should be used for getting and setting elements in the array,
* as generic getter and setter are not available.
*/

2
tommyds/tommytree.h
View file

@ -132,7 +132,7 @@ void tommy_tree_init(tommy_tree* tree, tommy_compare_func* cmp);
* If the element is already present, it's not inserted again.
* Check the return value to identify if the element was already present or not.
* You have to provide the pointer of the node embedded into the object and
* the pointer at the object.
* the pointer to the object.
* \param node Pointer to the node embedded into the object to insert.
* \param data Pointer to the object to insert.
* \return The element in the tree. Either the already existing one, or the one just inserted.