JehanneOS/newlib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

search: remove TRAD_SYNOPSIS

Browse Source 
Signed-off-by: Yaakov Selkowitz <yselkowi@redhat.com>
This commit is contained in:
Yaakov Selkowitz 2017-11-30 01:41:48 -06:00
parent 35d2d2fe2e
commit bf3a554bc6
3 changed files with 3 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
newlib/libc/search/bsearch.c
View File

@ -20,20 +20,12 @@ FUNCTION
INDEX INDEX
bsearch bsearch
ANSI_SYNOPSIS SYNOPSIS
#include <stdlib.h> #include <stdlib.h>
void *bsearch(const void *<[key]>, const void *<[base]>, void *bsearch(const void *<[key]>, const void *<[base]>,
size_t <[nmemb]>, size_t <[size]>, size_t <[nmemb]>, size_t <[size]>,
int (*<[compar]>)(const void *, const void *)); 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 DESCRIPTION
<<bsearch>> searches an array beginning at <[base]> for any element <<bsearch>> searches an array beginning at <[base]> for any element
that matches <[key]>, using binary search. <[nmemb]> is the element that matches <[key]>, using binary search. <[nmemb]> is the element

10
newlib/libc/search/qsort.c
View File

@ -5,19 +5,11 @@ FUNCTION
INDEX INDEX
qsort qsort
ANSI_SYNOPSIS SYNOPSIS
#include <stdlib.h> #include <stdlib.h>
void qsort(void *<[base]>, size_t <[nmemb]>, size_t <[size]>, void qsort(void *<[base]>, size_t <[nmemb]>, size_t <[size]>,
int (*<[compar]>)(const void *, const void *) ); 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 DESCRIPTION
<<qsort>> sorts an array (beginning at <[base]>) of <[nmemb]> objects. <<qsort>> sorts an array (beginning at <[base]>) of <[nmemb]> objects.
<[size]> describes the size of each element of the array. <[size]> describes the size of each element of the array.

11
newlib/libc/search/qsort_r.c
View File

@ -5,7 +5,7 @@ FUNCTION
INDEX INDEX
qsort_r qsort_r
ANSI_SYNOPSIS SYNOPSIS
#define _BSD_SOURCE #define _BSD_SOURCE
#include <stdlib.h> #include <stdlib.h>
void qsort_r(void *<[base]>, size_t <[nmemb]>, size_t <[size]>, void qsort_r(void *<[base]>, size_t <[nmemb]>, size_t <[size]>,
@ -18,15 +18,6 @@ ANSI_SYNOPSIS
int (*<[compar]>)(const void *, const void *, void *), int (*<[compar]>)(const void *, const void *, void *),
void *<[thunk]>); 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 DESCRIPTION
<<qsort_r>> sorts an array (beginning at <[base]>) of <[nmemb]> objects. <<qsort_r>> sorts an array (beginning at <[base]>) of <[nmemb]> objects.
<[size]> describes the size of each element of the array. <[size]> describes the size of each element of the array.