about summary refs log tree commit diff
path: root/iconv/strtab.c
diff options
context:
space:
mode:
authorOndřej Bílka <neleai@seznam.cz>2013-08-21 19:48:48 +0200
committerOndřej Bílka <neleai@seznam.cz>2013-08-21 19:48:48 +0200
commitc0c3f78afb6070721848574e2e5dff5cfa20e28d (patch)
tree6a1d44ea1e2f3d5425c05fd485c54aa15fda75f6 /iconv/strtab.c
parent46ed103824ff42668ddfc36c1b3fdb9219d48eee (diff)
downloadglibc-c0c3f78afb6070721848574e2e5dff5cfa20e28d.tar.gz
glibc-c0c3f78afb6070721848574e2e5dff5cfa20e28d.tar.xz
glibc-c0c3f78afb6070721848574e2e5dff5cfa20e28d.zip
Fix typos.
Diffstat (limited to 'iconv/strtab.c')
-rw-r--r--iconv/strtab.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/iconv/strtab.c b/iconv/strtab.c
index c62553e2e0..17286401a0 100644
--- a/iconv/strtab.c
+++ b/iconv/strtab.c
@@ -180,7 +180,7 @@ newstring (struct Strtab *st, const char *str, size_t len)
 
 
 /* XXX This function should definitely be rewritten to use a balancing
-   tree algorith (AVL, red-black trees).  For now a simple, correct
+   tree algorithm (AVL, red-black trees).  For now a simple, correct
    implementation is enough.  */
 static struct Strent **
 searchstring (struct Strent **sep, struct Strent *newstr)