dlopen.3: tfix

[thirdparty/man-pages.git] / man3 / bsearch.3

diff --git a/man3/bsearch.3 b/man3/bsearch.3
index 22c2ee3d0e1b54ee483d7c8cacae5cb0d38f9a20..b10a4dda2e89d129eaebf984b886cbb637aa0f71 100644 (file)
--- a/man3/bsearch.3
+++ b/man3/bsearch.3
@@ -28,13 +28,13 @@
 .\"     386BSD man pages
 .\" Modified Mon Mar 29 22:41:16 1993, David Metcalfe
 .\" Modified Sat Jul 24 21:35:16 1993, Rik Faith (faith@cs.unc.edu)
-.TH BSEARCH 3  2003-11-01 "" "Linux Programmer's Manual"
+.TH BSEARCH 3  2017-09-15 "" "Linux Programmer's Manual"
 .SH NAME
 bsearch \- binary search of a sorted array
 .SH SYNOPSIS
 .nf
 .B #include <stdlib.h>
-.sp
+.PP
 .BI "void *bsearch(const void *" key ", const void *" base ,
 .BI "              size_t " nmemb ", size_t " size ,
 .BI "              int (*" compar ")(const void *, const void *));"
@@ -74,15 +74,28 @@ function returns a pointer to a matching member of the
 array, or NULL if no match is found.
 If there are multiple elements that
 match the key, the element returned is unspecified.
+.SH ATTRIBUTES
+For an explanation of the terms used in this section, see
+.BR attributes (7).
+.TS
+allbox;
+lb lb lb
+l l l.
+Interface      Attribute       Value
+T{
+.BR bsearch ()
+T}     Thread safety   MT-Safe
+.TE
+.sp 1
 .SH CONFORMING TO
-SVr4, 4.3BSD, POSIX.1-2001, C89, C99.
+POSIX.1-2001, POSIX.1-2008, C89, C99, SVr4, 4.3BSD.
 .SH EXAMPLE
 The example below first sorts an array of structures using
 .BR qsort (3),
 then retrieves desired elements using
 .BR bsearch ().
-.sp
-.nf
+.PP
+.EX
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
@@ -124,7 +137,7 @@ main(int argc, char **argv)
     }
     exit(EXIT_SUCCESS);
 }
-.fi
+.EE
 .\" this example referred to in qsort.3
 .SH SEE ALSO
 .BR hsearch (3),