| | 1 | --- lsearch.3.bsdnew 2009-11-13 14:11:50.000000000 -0800 |
| | 2 | +++ lsearch.3 2009-11-13 14:11:50.000000000 -0800 |
| | 3 | @@ -12,21 +12,21 @@ |
| | 4 | .Dt LSEARCH 3 |
| | 5 | .Os |
| | 6 | .Sh NAME |
| | 7 | -.Nm lsearch , |
| | 8 | -.Nm lfind |
| | 9 | +.Nm lfind , |
| | 10 | +.Nm lsearch |
| | 11 | .Nd linear search and append |
| | 12 | .Sh LIBRARY |
| | 13 | .Lb libc |
| | 14 | .Sh SYNOPSIS |
| | 15 | .In search.h |
| | 16 | .Ft "void *" |
| | 17 | -.Fo lsearch |
| | 18 | -.Fa "const void *key" "void *base" "size_t *nelp" "size_t width" |
| | 19 | +.Fo lfind |
| | 20 | +.Fa "const void *key" "const void *base" "size_t *nelp" "size_t width" |
| | 21 | .Fa "int \*[lp]*compar\*[rp]\*[lp]const void *, const void *\*[rp]" |
| | 22 | .Fc |
| | 23 | .Ft "void *" |
| | 24 | -.Fo lfind |
| | 25 | -.Fa "const void *key" "const void *base" "size_t *nelp" "size_t width" |
| | 26 | +.Fo lsearch |
| | 27 | +.Fa "const void *key" "void *base" "size_t *nelp" "size_t width" |
| | 28 | .Fa "int \*[lp]*compar\*[rp]\*[lp]const void *, const void *\*[rp]" |
| | 29 | .Fc |
| | 30 | .Sh DESCRIPTION |
| | 31 | @@ -34,8 +34,8 @@ The |
| | 32 | .Fn lsearch |
| | 33 | and |
| | 34 | .Fn lfind |
| | 35 | -functions walk linearly through an array and compare each element with |
| | 36 | -the one to be sought using a supplied comparison function. |
| | 37 | +functions walk linearly through an array, comparing each element with |
| | 38 | +the one to be sought, by means of a supplied comparison function. |
| | 39 | .Pp |
| | 40 | The |
| | 41 | .Fa key |
projects / apple / libc.git / blame_incremental