1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
.\" Copyright 1993 David Metcalfe (david@prism.demon.co.uk)
.\"
.\" Permission is granted to make and distribute verbatim copies of this
.\" manual provided the copyright notice and this permission notice are
.\" preserved on all copies.
.\"
.\" Permission is granted to copy and distribute modified versions of this
.\" manual under the conditions for verbatim copying, provided that the
.\" entire resulting derived work is distributed under the terms of a
.\" permission notice identical to this one
.\"
.\" Since the Linux kernel and libraries are constantly changing, this
.\" manual page may be incorrect or out-of-date. The author(s) assume no
.\" responsibility for errors or omissions, or for damages resulting from
.\" the use of the information contained herein. The author(s) may not
.\" have taken the same level of care in the production of this manual,
.\" which is licensed free of charge, as they might when working
.\" professionally.
.\"
.\" Formatted or processed versions of this manual, if unaccompanied by
.\" the source, must acknowledge the copyright and authors of this work.
.\"
.\" References consulted:
.\" Linux libc source code
.\" Lewine's _POSIX Programmer's Guide_ (O'Reilly & Associates, 1991)
.\" 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 "March 29, 1993" "GNU" "Linux Programmer's Manual"
.SH NOME
bsearch \- busca binria em um array ordenado.
.SH SYNOPSIS
.nf
.B #include <stdlib.h>
.sp
.BI "void *bsearch(const void *" key ", const void *" base ", size_t " nmemb ,
.RS
.BI "size_t " size ", int (*" compar ")(const void *, const void *));
.RE
.fi
.SH DESCRIO
A funo \fBbsearch()\fP busca um item semelhante ao indicado por \fIkey\fP
num array com \fInmemb\fP itens iniciado no endereo indicado por \fIbase\fP.
Os itens tm tamanho \fIsize\fP.
.PP
O contedo do array dever estar em ordem crescente segundo o critrio definido
pela funo \fIcompar\fP. Esta funo recebe dois argumentos, que so o objeto
\fIkey\fP e um item do array (nesta ordem), e retorna um inteiro menor, igual ou
maior que zero conforme \fIkey\fP seja menor, igual ou maior que o item do array.
.SH "VALOR REOTRNADO"
Retorna um ponteiro para um item igual no array, ou NULL se no houver um.
Se houver mais de um elemento igual, qualquer um pode ser retornado.
.SH "DE ACORDO COM"
SVID 3, BSD 4.3, ISO 9899
.SH "VER TAMBM"
.BR qsort (3)
.SH TRADUZIDO POR LDP-BR em 21/08/2000.
\&\fR\&\f(CWPaulo Csar Mendes <drpc@ism.com.br> (traduo)\fR
\&\fR\&\f(CWxxxxxxxxxxxxxxxxxxxxxxxxx <xxx@xxxxxx.xxx.xx> (reviso)\fR
|
