Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: perl-List-BinarySearch | Distribution: Mageia |
Version: 0.250.0 | Vendor: Mageia.Org |
Release: 6.mga9 | Build date: Sun Mar 20 09:54:13 2022 |
Group: Development/Perl | Build host: localhost |
Size: 47838 | Source RPM: perl-List-BinarySearch-0.250.0-6.mga9.src.rpm |
Packager: umeabot <umeabot> | |
Url: https://metacpan.org/release/List-BinarySearch | |
Summary: Pure-Perl Binary Search functions |
A binary search searches *sorted* lists using a divide and conquer technique. On each iteration the search domain is cut in half, until the result is found. The computational complexity of a binary search is O(log n). The binary search algorithm implemented in this module is known as a _Deferred Detection_ variant on the traditional Binary Search. Deferred Detection provides *stable searches*. Stable binary search algorithms have the following characteristics, contrasted with their unstable binary search cousins: * * In the case of non-unique keys, a stable binary search will always return the lowest-indexed matching element. An unstable binary search would return the first one found, which may not be the chronological first.
GPL+ or Artistic
* Sun Mar 20 2022 umeabot <umeabot> 0.250.0-6.mga9 + Revision: 1804246 - Mageia 9 Mass Rebuild
/usr/share/doc/perl-List-BinarySearch /usr/share/doc/perl-List-BinarySearch/Changes /usr/share/doc/perl-List-BinarySearch/META.json /usr/share/doc/perl-List-BinarySearch/META.yml /usr/share/doc/perl-List-BinarySearch/README /usr/share/man/man3/List::BinarySearch.3pm.xz /usr/share/man/man3/List::BinarySearch::PP.3pm.xz /usr/share/perl5/vendor_perl/List /usr/share/perl5/vendor_perl/List/BinarySearch /usr/share/perl5/vendor_perl/List/BinarySearch.pm /usr/share/perl5/vendor_perl/List/BinarySearch/PP.pm
Generated by rpm2html 1.8.1
Fabrice Bellet, Sun Nov 17 08:05:05 2024