diff options
| author | Andreas Jaeger <aj@suse.de> | 2000-03-10 08:41:39 +0000 |
|---|---|---|
| committer | Andreas Jaeger <aj@suse.de> | 2000-03-10 08:41:39 +0000 |
| commit | e8b1163ed03e17558e918116b2ab594a60161154 (patch) | |
| tree | 79aa1e06f5a24d3fa6d23c007cf141aacaf4d4f0 /locale | |
| parent | f25da8d01f8d783fff627a95628a73b037526245 (diff) | |
| download | glibc-e8b1163ed03e17558e918116b2ab594a60161154.zip glibc-e8b1163ed03e17558e918116b2ab594a60161154.tar.gz glibc-e8b1163ed03e17558e918116b2ab594a60161154.tar.bz2 | |
2000-03-09 Martin Buchholz <martin@xemacs.org>
* sysdeps/unix/sysv/linux/alpha/syscall.S:
* manual/message.texi (Using gettextized software):
* manual/message.texi (Message Translation): Doc Fixes.
* manual/filesys.texi (File Size):
* manual/charset.texi (glibc iconv Implementation):
* locale/programs/ld-collate.c (collate_output):
* iconv/gconv_db.c (find_derivation):
* manual/install.texi:
* manual/search.texi (Hash Search Function):
* manual/stdio.texi (Output Conversion Syntax):
* FAQ.in:
* config.h.in:
* sysdeps/generic/dl-sysdep.c:
Doc Fixes. `allows to' is not correct English.
* elf/rtld.c: Doc fixes.
* manual/creature.texi (Feature Test Macros): Doc fixes.
* manual/memory.texi (Hooks for Malloc): Doc Fixes.
* manual/filesys.texi (Working Directory): Check for ERANGE to
avoid infloop.
Diffstat (limited to 'locale')
| -rw-r--r-- | locale/programs/ld-collate.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/locale/programs/ld-collate.c b/locale/programs/ld-collate.c index d8363bd..1943f62 100644 --- a/locale/programs/ld-collate.c +++ b/locale/programs/ld-collate.c @@ -2012,8 +2012,8 @@ collate_output (struct localedef_t *locale, struct charmap_t *charmap, { /* The entries in the list are sorted by length and then alphabetically. This is the order in which we will add the - elements to the collation table. This allows to simply - walk the table in sequence and stop at the first matching + elements to the collation table. This allows simply walking + the table in sequence and stopping at the first matching entry. Since the longer sequences are coming first in the list they have the possibility to match first, just as it has to be. In the worst case we are walking to the end of |