| Name : perl-Search-Binary
| |
| Version : 0.99
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.3.1
| Date : 2023-07-20 17:02:59
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Search-Binary-0.99-lp155.3.1.src.rpm
|
| Size : 0.03 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : generic binary search (DEPRECATED)
|
Description :
Instead of using \'Search:Binary\', for most cases the List::BinarySearch
manpage offers same functionality with simpler, more robust API and thus
the latter should be preferred and *this module should be considered
deprecated*.
\'binary_search\' subroutine (which is exported by default) implements a
generic binary search algorithm returning the _position_ of the first
_record_ which _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.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-S/15.5/noarch |
