[newlib-cygwin] search: remove TRAD_SYNOPSIS

[Yaakov Selkowitz <yselkowitz@sourceware.org>]

https://sourceware.org/git/gitweb.cgi?p=newlib-cygwin.git;h=bf3a554bc65b563c437ee9b46c1b8b915e1a056b

commit bf3a554bc65b563c437ee9b46c1b8b915e1a056b
Author: Yaakov Selkowitz <yselkowi@redhat.com>
Date:   Thu Nov 30 01:41:48 2017 -0600

    search: remove TRAD_SYNOPSIS
    
    Signed-off-by: Yaakov Selkowitz <yselkowi@redhat.com>

Diff:
---
 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(-)

diff --git a/newlib/libc/search/bsearch.c b/newlib/libc/search/bsearch.c
index d874e79..579633c 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 bf6285f..9a8e7fa 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 9073061..c4b6fb7 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.