@@ -20,20 +20,12 @@ FUNCTION
INDEX
bsearch
-ANSI_SYNOPSIS
+SYNOPSIS
#include <stdlib.h>
void *bsearch(const void *<[key]>, const void *<[base]>,
size_t <[nmemb]>, size_t <[size]>,
int (*<[compar]>)(const void *, const void *));
-TRAD_SYNOPSIS
- #include <stdlib.h>
- char *bsearch(<[key]>, <[base]>, <[nmemb]>, <[size]>, <[compar]>)
- char *<[key]>;
- char *<[base]>;
- size_t <[nmemb]>, <[size]>;
- int (*<[compar]>)();
-
DESCRIPTION
<<bsearch>> searches an array beginning at <[base]> for any element
that matches <[key]>, using binary search. <[nmemb]> is the element
@@ -5,19 +5,11 @@ FUNCTION
INDEX
qsort
-ANSI_SYNOPSIS
+SYNOPSIS
#include <stdlib.h>
void qsort(void *<[base]>, size_t <[nmemb]>, size_t <[size]>,
int (*<[compar]>)(const void *, const void *) );
-TRAD_SYNOPSIS
- #include <stdlib.h>
- qsort(<[base]>, <[nmemb]>, <[size]>, <[compar]> )
- char *<[base]>;
- size_t <[nmemb]>;
- size_t <[size]>;
- int (*<[compar]>)();
-
DESCRIPTION
<<qsort>> sorts an array (beginning at <[base]>) of <[nmemb]> objects.
<[size]> describes the size of each element of the array.
@@ -5,7 +5,7 @@ FUNCTION
INDEX
qsort_r
-ANSI_SYNOPSIS
+SYNOPSIS
#define _BSD_SOURCE
#include <stdlib.h>
void qsort_r(void *<[base]>, size_t <[nmemb]>, size_t <[size]>,
@@ -18,15 +18,6 @@ ANSI_SYNOPSIS
int (*<[compar]>)(const void *, const void *, void *),
void *<[thunk]>);
-TRAD_SYNOPSIS
- #include <stdlib.h>
- qsort_r(<[base]>, <[nmemb]>, <[size]>, <[compar]>, <[thumb]>)
- char *<[base]>;
- size_t <[nmemb]>;
- size_t <[size]>;
- int (*<[compar]>)();
- char *<[thumb]>;
-
DESCRIPTION
<<qsort_r>> sorts an array (beginning at <[base]>) of <[nmemb]> objects.
<[size]> describes the size of each element of the array.
Signed-off-by: Yaakov Selkowitz <yselkowi@redhat.com> --- newlib/libc/search/bsearch.c | 10 +--------- newlib/libc/search/qsort.c | 10 +--------- newlib/libc/search/qsort_r.c | 11 +---------- 3 files changed, 3 insertions(+), 28 deletions(-) -- 2.15.0