| Name : perl-Tie-Array-Sorted
| |
| Version : 1.41
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp155.381.1
| Date : 2023-07-20 19:13:23
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Tie-Array-Sorted-1.41-lp155.381.1.src.rpm
|
| Size : 0.01 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : An array which is kept sorted
|
Description :
This presents an ordinary array, but is kept sorted. All pushes and
unshifts cause the elements in question to be inserted in the appropriate
location to maintain order.
Direct stores (\'$a[10] = \"wibble\"\') effectively splice out the original
value and insert the new element. It\'s not clear why you\'d want to use
direct stores like that, but this module does the right thing if you do.
If you don\'t like the ordinary lexical comparator, you can provide your
own; it should compare the two elements it is given. For instance, a
numeric comparator would look like this:
tie AATTa, \"Tie::Array::Sorted\", sub { $_[0] < => $_[1] }
Whereas to compare a list of files by their sizes, you\'d so something like:
tie AATTa, \"Tie::Array::Sorted\", sub { -s $_[0] < => -s $_[1] }
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-T/15.5/noarch |
