Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

tie::array::sorted(3pm) [debian man page]

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

NAME
Tie::Array::Sorted - An array which is kept sorted SYNOPSIS
use Tie::Array::Sorted; tie @a, "Tie::Array::Sorted", sub { $_[0] <=> $_[1] }; push @a, 10, 4, 7, 3, 4; print "@a"; # "3 4 4 7 10" DESCRIPTION
This presents an ordinary array, but is kept sorted. All pushes and unshifts cause the elements in question to be inserted in the appropri- ate 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 @a, "Tie::Array::Sorted", sub { $_[0] <=> $_[1] } Whereas to compare a list of files by their sizes, you'd so something like: tie @a, "Tie::Array::Sorted", sub { -s $_[0] <=> -s $_[1] } LAZY SORTING
If you do more stores than fetches, you may find Tie::Array::Sorted::Lazy more efficient. AUTHOR
Original author: Simon Cozens Current maintainer: Tony Bowden BUGS and QUERIES Please direct all correspondence regarding this module to: bug-Tie-Array-Sorted@rt.cpan.org This module was originall written as part of the Plucene project. However, as Plucene no longer uses this, it is effectively unmaintained. COPYRIGHT AND LICENSE
Copyright (C) 2003-2006 Simon Cozens and Tony Bowden. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. perl v5.8.8 2004-10-10 Tie::Array::Sorted(3pm)

Check Out this Related Man Page

Tie::RefHash(3pm)					 Perl Programmers Reference Guide					 Tie::RefHash(3pm)

NAME
Tie::RefHash - use references as hash keys SYNOPSIS
require 5.004; use Tie::RefHash; tie HASHVARIABLE, 'Tie::RefHash', LIST; tie HASHVARIABLE, 'Tie::RefHash::Nestable', LIST; untie HASHVARIABLE; DESCRIPTION
This module provides the ability to use references as hash keys if you first "tie" the hash variable to this module. Normally, only the keys of the tied hash itself are preserved as references; to use references as keys in hashes-of-hashes, use Tie::RefHash::Nestable, included as part of Tie::RefHash. It is implemented using the standard perl TIEHASH interface. Please see the "tie" entry in perlfunc(1) and perltie(1) for more information. The Nestable version works by looking for hash references being stored and converting them to tied hashes so that they too can have references as keys. This will happen without warning whenever you store a reference to one of your own hashes in the tied hash. EXAMPLE
use Tie::RefHash; tie %h, 'Tie::RefHash'; $a = []; $b = {}; $c = *main; $d = "gunk"; $e = sub { 'foo' }; %h = ($a => 1, $b => 2, $c => 3, $d => 4, $e => 5); $a->[0] = 'foo'; $b->{foo} = 'bar'; for (keys %h) { print ref($_), " "; } tie %h, 'Tie::RefHash::Nestable'; $h{$a}->{$b} = 1; for (keys %h, keys %{$h{$a}}) { print ref($_), " "; } THREAD SUPPORT
Tie::RefHash fully supports threading using the "CLONE" method. STORABLE SUPPORT
Storable hooks are provided for semantically correct serialization and cloning of tied refhashes. RELIC SUPPORT
This version of Tie::RefHash seems to no longer work with 5.004. This has not been throughly investigated. Patches welcome ;-) LICENSE
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself MAINTAINER
Yuval Kogman <nothingmuch@woobling.org> AUTHOR
Gurusamy Sarathy gsar@activestate.com 'Nestable' by Ed Avis ed@membled.com SEE ALSO
perl(1), perlfunc(1), perltie(1) perl v5.16.2 2012-10-11 Tie::RefHash(3pm)
Man Page