| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: perl-Search-Binary | Distribution: Mageia |
| Version: 0.990.0 | Vendor: Mageia.Org |
| Release: 6.mga9 | Build date: Sun Mar 20 13:22:15 2022 |
| Group: Development/Perl | Build host: localhost |
| Size: 31593 | Source RPM: perl-Search-Binary-0.990.0-6.mga9.src.rpm |
| Packager: umeabot <umeabot> | |
| Url: https://metacpan.org/release/Search-Binary | |
| Summary: Generic binary search | |
'binary_search' implements a generic binary search algorithm returning the _position_ of the first _record_ whose _index value_ is greater than or equal to '$val'. The search routine does not define any of the terms _position_, _record_ or _index value_, but leaves their interpretation and implementation to the user supplied function '&$read()'. The only restriction is that positions must be integer scalars. During the search the read function will be called with three arguments: the input parameters '$handle' and '$val', and a position. If the position is not 'undef', the read function should read the first whole record starting at or after the position; otherwise, the read function should read the record immediately following the last record it read. The search algorithm will guarantee that the first call to the read function will not be with a position of 'undef'. The read function needs to return a two element array consisting of the result of comparing '$val' with the index value of the read record and the position of the read record. The comparison value must be positive if '$val' is strictly greater than the index value of the read record, '0' if equal, and negative if strictly less. Furthermore, the returned position value must be greater than or equal to the position the read function was called with. The input parameters '$min' and '$max' are positions and represents the extent of the search. Only records which begin at positions within this range (inclusive) will be searched. Moreover, '$min' must be the starting position of a record. If present '$size' is a difference between positions and determines when the algorithms switches to a sequential search. '$val' is an index value. The value of '$handle' is of no consequence to the binary search algorithm; it is merely passed as a convenience to the read function.
GPL+ or Artistic
* Sun Mar 20 2022 umeabot <umeabot> 0.990.0-6.mga9 + Revision: 1805646 - Mageia 9 Mass Rebuild
/usr/share/doc/perl-Search-Binary /usr/share/doc/perl-Search-Binary/Changes /usr/share/doc/perl-Search-Binary/LICENSE /usr/share/doc/perl-Search-Binary/META.json /usr/share/doc/perl-Search-Binary/META.yml /usr/share/doc/perl-Search-Binary/MYMETA.yml /usr/share/doc/perl-Search-Binary/README /usr/share/man/man3/Search::Binary.3pm.xz /usr/share/perl5/vendor_perl/Search /usr/share/perl5/vendor_perl/Search/Binary.pm
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Jan 14 11:19:51 2025