tie::array::sorted::lazy(3pm) debian man page | unix.com

Man Page: tie::array::sorted::lazy

Operating Environment: debian

Section: 3pm

Tie::Array::Sorted::Lazy(3pm)				User Contributed Perl Documentation			     Tie::Array::Sorted::Lazy(3pm)

NAME
Tie::Array::Sorted::Lazy - An array which is kept sorted
SYNOPSIS
use 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"
DESCRIPTION
This 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::array5.18(3pm) - mojave
tie::refhash5.18(3pm) - mojave
tie::refhash(3pm) - mojave
tie::array(3pm) - centos
tie::array(3pm) - suse
Similar Topics in the Unix Linux Community
Introduction
Detecting unused variables...
One instance of comparing grep and awk
New UNIX and Linux History Sections
My first PERL incarnation... Audio Oscillograph