diff options
| author | Yaakov Selkowitz <yselkowi@redhat.com> | 2017-11-30 10:41:48 +0300 |
|---|---|---|
| committer | Yaakov Selkowitz <yselkowi@redhat.com> | 2017-12-01 12:41:51 +0300 |
| commit | bf3a554bc65b563c437ee9b46c1b8b915e1a056b (patch) | |
| tree | de025f4d24d192757c8a329ecf26147774c56ce4 /newlib/libc/search | |
| parent | 35d2d2fe2ecbfc611820285cc4d47644012e1e1d (diff) | |
search: remove TRAD_SYNOPSIS
Signed-off-by: Yaakov Selkowitz <yselkowi@redhat.com>
Diffstat (limited to 'newlib/libc/search')
| -rw-r--r-- | newlib/libc/search/bsearch.c | 10 | ||||
| -rw-r--r-- | newlib/libc/search/qsort.c | 10 | ||||
| -rw-r--r-- | newlib/libc/search/qsort_r.c | 11 |
3 files changed, 3 insertions, 28 deletions
diff --git a/newlib/libc/search/bsearch.c b/newlib/libc/search/bsearch.c index d874e79ae..579633c12 100644 --- a/newlib/libc/search/bsearch.c +++ b/newlib/libc/search/bsearch.c @@ -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 diff --git a/newlib/libc/search/qsort.c b/newlib/libc/search/qsort.c index bf6285f5e..9a8e7fabe 100644 --- a/newlib/libc/search/qsort.c +++ b/newlib/libc/search/qsort.c @@ -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. diff --git a/newlib/libc/search/qsort_r.c b/newlib/libc/search/qsort_r.c index 9073061f0..c4b6fb7e2 100644 --- a/newlib/libc/search/qsort_r.c +++ b/newlib/libc/search/qsort_r.c @@ -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. |