Update.
2000-05-23 Andreas Jaeger <aj@suse.de> * stdio-common/tfformat.c (sprint_doubles): Add testcase for %a. * manual/search.texi (Array Sort Function): Document that qsort is not necessarily in-place. * sunrpc/rpc_main.c (parseargs): Don't accept -M and -N. Closes PR libc/1731. * stdio-common/tfformat.c (sprint_doubles): Add testcase for %a.
This commit is contained in:
parent
e513a8fd6e
commit
21ad6b26f4
12
ChangeLog
12
ChangeLog
@ -1,3 +1,15 @@
|
||||
2000-05-23 Andreas Jaeger <aj@suse.de>
|
||||
|
||||
* stdio-common/tfformat.c (sprint_doubles): Add testcase for %a.
|
||||
|
||||
* manual/search.texi (Array Sort Function): Document that qsort is
|
||||
not necessarily in-place.
|
||||
|
||||
* sunrpc/rpc_main.c (parseargs): Don't accept -M and -N.
|
||||
Closes PR libc/1731.
|
||||
|
||||
* stdio-common/tfformat.c (sprint_doubles): Add testcase for %a.
|
||||
|
||||
2000-05-22 Jakub Jelinek <jakub@redhat.com>
|
||||
|
||||
* elf/dl-load.c (_dl_init_paths): If env_path_list has 0 elements,
|
||||
|
@ -183,6 +183,10 @@ Functions}):
|
||||
|
||||
The @code{qsort} function derives its name from the fact that it was
|
||||
originally implemented using the ``quick sort'' algorithm.
|
||||
|
||||
The implementation of @code{qsort} in this library might not be an
|
||||
in-place sort and might thereby use an extra amount of memory to store
|
||||
the array.
|
||||
@end deftypefun
|
||||
|
||||
@node Search/Sort Example
|
||||
|
@ -4009,6 +4009,8 @@ sprint_double_type sprint_doubles[] =
|
||||
{__LINE__, 11.25, "11.2", "%.1f"},
|
||||
{__LINE__, 1.75, "1.8", "%.1f"},
|
||||
{__LINE__, 11.75, "11.8", "%.1f"},
|
||||
{__LINE__, 16, "0x1.0p+4", "%.1a"},
|
||||
{__LINE__, 16, "0x1.00000000000000000000p+4", "%.20a"},
|
||||
|
||||
{0 }
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user