- Name: perl-List-BinarySearch-XS
- Version: 0.90.0
- Release: 4.mga6
- Epoch:
- Group: Development/Perl
- License: GPL+ or Artistic
- Url: http://search.cpan.org/dist/List-BinarySearch-XS
- Summary: Binary Search a sorted array with XS routines
- Architecture: i586
- Size: 36130
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: pterjan <pterjan>
Description:
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).
This module implements several Binary Search algorithms using XS code for
optimal performance. You are free to use this module directly, or as a
plugin for the more general the List::BinarySearch manpage.
The binary search algorithm implemented in this module is known as a
_Deferred Detection_ Binary Search. Deferred Detection provides *stable
searches*. Stable binary search algorithms have the following
characteristics, contrasted with their unstable binary search cousins:
- OptFlags: -O2 -g -pipe -Wformat -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -fstack-protector --param=ssp-buffer-size=4 -fomit-frame-pointer -march=i586 -mtune=generic -fasynchronous-unwind-tables
- Cookie: rabbit.mageia.org 1466304796
- Buildhost: rabbit.mageia.org
Sources packages:
Other version of this rpm:
