Query: tie::array::sorted::lazy
OS: debian
Section: 3pm
Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar
Tie::Array::Sorted::Lazy(3pm) User Contributed Perl Documentation Tie::Array::Sorted::Lazy(3pm)NAMETie::Array::Sorted::Lazy - An array which is kept sortedSYNOPSISuse Tie::Array::Sorted::Lazy; tie @a, "Tie::Array::Sorted::Lazy", sub { $_[0] <=> $_[1] }; push @a, 10, 4, 7, 3, 4; print "@a"; # "3 4 4 7 10"DESCRIPTIONThis is a version Tie::Array::Sorted optimised for arrays which are stored to more often than fetching. In this case the array is resorted on retrieval, rather than insertion. (It only re-sorts if data has been modified since the last sort). tie @a, "Tie::Array::Sorted::Lazy", sub { -s $_[0] <=> -s $_[1] }; perl v5.8.8 2004-10-10 Tie::Array::Sorted::Lazy(3pm)
Related Man Pages |
---|
tie::refhash5.18(3pm) - mojave |
tie::array(3pm) - mojave |
tie::refhash(3pm) - centos |
mail::box::tie(3pm) - debian |
tie::array::sorted(3pm) - debian |
Similar Topics in the Unix Linux Community |
---|
Adding the individual columns of a matrix. |
How can I do this in VI editor? |
Is UNIX an open source OS ? |
Find columns in a file based on header and print to new file |
Weird 'find' results |