diff options
| author | Mattias Andrée <maandree@operamail.com> | 2014-08-29 03:33:25 +0200 |
|---|---|---|
| committer | Mattias Andrée <maandree@operamail.com> | 2014-08-29 03:33:25 +0200 |
| commit | 890db3ba40dc93b197e50e40d83532f7259f5231 (patch) | |
| tree | b3a75c19536c73d2ce68e44555d5f2c1a504666a /src/libmdsserver | |
| parent | info: client list (diff) | |
| download | mds-890db3ba40dc93b197e50e40d83532f7259f5231.tar.gz mds-890db3ba40dc93b197e50e40d83532f7259f5231.tar.bz2 mds-890db3ba40dc93b197e50e40d83532f7259f5231.tar.xz | |
typo
Signed-off-by: Mattias Andrée <maandree@operamail.com>
Diffstat (limited to 'src/libmdsserver')
| -rw-r--r-- | src/libmdsserver/linked-list.c | 2 | ||||
| -rw-r--r-- | src/libmdsserver/linked-list.h | 6 |
2 files changed, 4 insertions, 4 deletions
diff --git a/src/libmdsserver/linked-list.c b/src/libmdsserver/linked-list.c index 948b0a8..292c610 100644 --- a/src/libmdsserver/linked-list.c +++ b/src/libmdsserver/linked-list.c @@ -155,7 +155,7 @@ int linked_list_clone(const linked_list_t* restrict this, linked_list_t* restric /** * Pack the list so that there are no reusable * positions, and reduce the capacity to the - * smallest capacity that can be used. Not that + * smallest capacity that can be used. Note that * values (nodes) returned by the list's methods * will become invalid. Additionally (to reduce * the complexity) the list will be defragment diff --git a/src/libmdsserver/linked-list.h b/src/libmdsserver/linked-list.h index 4edaad2..d6f56c5 100644 --- a/src/libmdsserver/linked-list.h +++ b/src/libmdsserver/linked-list.h @@ -140,7 +140,7 @@ int linked_list_clone(const linked_list_t* restrict this, linked_list_t* restric /** * Pack the list so that there are no reusable * positions, and reduce the capacity to the - * smallest capacity that can be used. Not that + * smallest capacity that can be used. Note that * values (nodes) returned by the list's methods * will become invalid. Additionally (to reduce * the complexity) the list will be defragment @@ -191,7 +191,7 @@ ssize_t linked_list_insert_after(linked_list_t* restrict this, size_t value, ssi * @param predecessor The reference node * @return The node that has been removed */ -ssize_t linked_list_remove_after(linked_list_t* restrict this, ssize_t predecessor); +ssize_t linked_list_remove_after(linked_list_t* restrict this, ssize_t predecessor); /** * Insert a value before a specified, reference, node @@ -211,7 +211,7 @@ ssize_t linked_list_insert_before(linked_list_t* restrict this, size_t value, ss * @param successor The reference node * @return The node that has been removed */ -ssize_t linked_list_remove_before(linked_list_t* restrict this, ssize_t successor); +ssize_t linked_list_remove_before(linked_list_t* restrict this, ssize_t successor); /** * Remove the node from the list |