1.\" Copyright (c) 1990, 1991, 1993, 1994 2.\" The Regents of the University of California. All rights reserved. 3.\" 4.\" This code is derived from software contributed to Berkeley by 5.\" the American National Standards Committee X3, on Information 6.\" Processing Systems. 7.\" 8.\" Redistribution and use in source and binary forms, with or without --- 16 unchanged lines hidden (view full) --- 25.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30.\" SUCH DAMAGE. 31.\" 32.\" @(#)bsearch.3 8.3 (Berkeley) 4/19/94 |
33.\" $FreeBSD: head/lib/libc/stdlib/bsearch.3 247189 2013-02-23 12:31:52Z keramida $ |
34.\" |
35.Dd February 22, 2013 |
36.Dt BSEARCH 3 37.Os 38.Sh NAME 39.Nm bsearch 40.Nd binary search of a sorted table 41.Sh LIBRARY 42.Lb libc 43.Sh SYNOPSIS --- 22 unchanged lines hidden (view full) --- 66is expected to have 67two arguments which point to the 68.Fa key 69object and to an array member, in that order, and should return an integer 70less than, equal to, or greater than zero if the 71.Fa key 72object is found, respectively, to be less than, to match, or be 73greater than the array member. |
74See the 75.Fa int_compare 76sample function in 77.Xr qsort 3 78for a comparison function that is also compatible with 79.Fn bsearch . |
80.Sh RETURN VALUES 81The 82.Fn bsearch 83function returns a pointer to a matching member of the array, or a null 84pointer if no match is found. 85If two members compare as equal, which member is matched is unspecified. 86.Sh SEE ALSO 87.Xr db 3 , 88.Xr lsearch 3 , 89.Xr qsort 3 90.\" .Xr tsearch 3 91.Sh STANDARDS 92The 93.Fn bsearch 94function conforms to 95.St -isoC . |