From: Andre Noll Date: Sun, 26 Jul 2009 16:26:57 +0000 (+0200) Subject: osl.h.in: Minor documentation improvements. X-Git-Tag: v0.1.0~12 X-Git-Url: http://git.tuebingen.mpg.de/?p=osl.git;a=commitdiff_plain;h=227af1913a44055d629154d5e8dbd8b518961ba3 osl.h.in: Minor documentation improvements. --- diff --git a/osl.h.in b/osl.h.in index cd39a3b..d5a7d1d 100644 --- a/osl.h.in +++ b/osl.h.in @@ -78,7 +78,7 @@ struct osl_row; * specified. Such a function always takes pointers to the two objects to be * compared. It must return -1, zero, or 1, if the first argument is considered * to be respectively less than, equal to, or greater than the second. If two - * members compare as equal, their order in the sorted array is undefined. + * members compare as equal, their order in the rbtree is undefined. */ typedef int osl_compare_func(const struct osl_object *obj1, const struct osl_object *obj2); @@ -445,8 +445,8 @@ int osl_rbtree_last_row(const struct osl_table *t, unsigned col_num, * \param result Row is returned here. * * Retrieve the n-th order statistic with respect to the compare function - * of the rbtree column \a col_num. In other words, get that row with - * \a n th greatest value in column \a col_num. It's an error if + * of the rbtree column \a col_num. In other words, get the row with + * \a n th greatest value in column \a col_num. It is an error if * \a col_num is not a rbtree column, or if \a n is larger than the * number of rows in the table. *