From 18f89c1a56e970d48f903286dc1cff216cfe2c84 Mon Sep 17 00:00:00 2001 From: Andrea Mazzoleni Date: Thu, 3 Nov 2016 18:33:12 +0100 Subject: [PATCH] Update to TommyDS v2.1 --- tommyds/tommyarrayblkof.h | 2 +- tommyds/tommytree.h | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/tommyds/tommyarrayblkof.h b/tommyds/tommyarrayblkof.h index f7ce93ab..fce6840c 100644 --- a/tommyds/tommyarrayblkof.h +++ b/tommyds/tommyarrayblkof.h @@ -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. */ diff --git a/tommyds/tommytree.h b/tommyds/tommytree.h index 1eeda24d..55e40060 100644 --- a/tommyds/tommytree.h +++ b/tommyds/tommytree.h @@ -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.