summaryrefslogtreecommitdiffstats
path: root/man3/bsearch.3
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--man3/bsearch.39
1 files changed, 4 insertions, 5 deletions
diff --git a/man3/bsearch.3 b/man3/bsearch.3
index f73b939..38a4ac3 100644
--- a/man3/bsearch.3
+++ b/man3/bsearch.3
@@ -9,7 +9,7 @@
.\" 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 2023-07-20 "Linux man-pages 6.05.01"
+.TH bsearch 3 2023-10-31 "Linux man-pages 6.7"
.SH NAME
bsearch \- binary search of a sorted array
.SH LIBRARY
@@ -18,7 +18,7 @@ Standard C library
.SH SYNOPSIS
.nf
.B #include <stdlib.h>
-.PP
+.P
.BI "void *bsearch(const void " key [. size "], \
const void " base [. size " * ." nmemb ],
.BI " size_t " nmemb ", size_t " size ,
@@ -39,7 +39,7 @@ that matches the object pointed to by
The size of each member
of the array is specified by
.IR size .
-.PP
+.P
The contents of the array should be in ascending sorted order according
to the comparison function referenced by
.IR compar .
@@ -74,7 +74,6 @@ T{
.BR bsearch ()
T} Thread safety MT-Safe
.TE
-.sp 1
.SH STANDARDS
C11, POSIX.1-2008.
.SH HISTORY
@@ -84,7 +83,7 @@ The example below first sorts an array of structures using
.BR qsort (3),
then retrieves desired elements using
.BR bsearch ().
-.PP
+.P
.\" SRC BEGIN (bsearch.c)
.EX
#include <stdio.h>