Add built local::lib

[catagits/Gitalist.git] / local-lib5 / man / man3 / Template::Manual::VMethods.3pm

.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.3
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sh \" Subsection heading
.br
.if t .Sp
.ne 5
.PP
\fB\\$1\fR
.PP
..
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  | will give a
.\" real vertical bar.  \*(C+ will give a nicer C++.  Capital omega is used to
.\" do unbreakable dashes and therefore won't be available.  \*(C` and \*(C'
.\" expand to `' in nroff, nothing in troff, for use with C<>.
.tr \(*W-|\(bv\*(Tr
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
'br\}
.\"
.\" If the F register is turned on, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.if \nF \{\
.    de IX
.    tm Index:\\$1\t\\n%\t"\\$2"
..
.    nr % 0
.    rr F
.\}
.\"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.hy 0
.if n .na
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "Template::Manual::VMethods 3"
.TH Template::Manual::VMethods 3 "2009-07-04" "perl v5.8.7" "User Contributed Perl Documentation"
.SH "NAME"
Template::Manual::VMethods \- Virtual Methods
.SH "Scalar Virtual Methods"
.IX Header "Scalar Virtual Methods"
.Sh "defined"
.IX Subsection "defined"
Returns true if the value is defined.
.PP
.Vb 1
\&    [% user = get_user(uid) IF uid.defined %]
.Ve
.Sh "length"
.IX Subsection "length"
Returns the length of the string representation of the item:
.PP
.Vb 3
\&    [% IF password.length < 8 %]
\&       Password too short, dumbass!
\&    [% END %]
.Ve
.Sh "repeat(n)"
.IX Subsection "repeat(n)"
Repeat the string a specified number of times.
.PP
.Vb 2
\&    [% name = 'foo' %]
\&    [% name.repeat(3) %]                # foofoofoo
.Ve
.Sh "replace(search, replace)"
.IX Subsection "replace(search, replace)"
Outputs the string with all instances of the first argument (specified
as a Perl regular expression) with the second.
.PP
.Vb 2
\&    [% name = 'foo, bar & baz' %]
\&    [% name.replace('\eW+', '_') %]        # foo_bar_baz
.Ve
.PP
You can use \f(CW$1\fR, \f(CW$2\fR, etc., to reference captured parts (in parentheses)
in the regular expression.  Just be careful to \fIsingle\fR quote the replacement
string.  If you use \fIdouble\fR quotes then \s-1TT\s0 will try and interpolate the
variables before passing the string to the \f(CW\*(C`replace\*(C'\fR vmethod.
.PP
.Vb 2
\&    [% name = 'FooBarBaz' %]
\&    [% name.replace('([A\-Z])', ' $1') %]  # Foo Bar Baz
.Ve
.Sh "remove(pattern)"
.IX Subsection "remove(pattern)"
Outputs the string with all instances of the pattern (specified
as a Perl regular expression) removed.
.PP
.Vb 2
\&    [% name = 'foo, bar & baz' %]
\&    [% name.remove('\eW+') %]    # foobarbaz
.Ve
.Sh "match(pattern, global)"
.IX Subsection "match(pattern, global)"
Performs a regular expression match on the string using the pattern
passed as an argument.  If the pattern matches the string then the
method returns a reference to a list of any strings captured within
parenthesis in the pattern.
.PP
.Vb 3
\&    [% name = 'Larry Wall' %]
\&    [% matches = name.match('(\ew+) (\ew+)') %]
\&    [% matches.1 %], [% matches.0 %]            # Wall, Larry
.Ve
.PP
If the pattern does not match then the method returns false, rather
than returning an empty list which Perl and the Template Toolkit both
consider to be a true value.  This allows you to write expression like
this.
.PP
.Vb 1
\&    [% "We're not worthy!" IF name.match('Larry Wall') %]
.Ve
.PP
.Vb 5
\&    [% IF (matches = name.match('(\ew+) (\ew+)')) %]
\&       pattern matches: [% matches.join(', ') %]
\&    [% ELSE %]
\&       pattern does not match
\&    [% END %]
.Ve
.PP
Any regex modifiers, like \f(CW\*(C`/s\*(C'\fR, should be added in the regex using
the \f(CW\*(C`(?s)\*(C'\fR syntax.  For example, to modify the regex to disregard
whitespace (the \f(CW\*(C`/x\*(C'\fR switch), use:
.PP
.Vb 7
\&    [% re = '(?x)
\&               (\ew+)
\&               [ ]
\&               (\ew+)
\&             ';
\&      matches = name.match(re);
\&    %]
.Ve
.PP
To perform a global search to match the pattern as many times as it
appears in the source string, provide a true value for the \f(CW\*(C`global\*(C'\fR 
argument following the pattern.
.PP
.Vb 3
\&    [% text = 'bandanna';
\&       text.match('an+', 1).join(', )      # an, ann
\&    %]
.Ve
.Sh "search(pattern)"
.IX Subsection "search(pattern)"
Performs a similar function to match but simply returns true if the 
string matches the regular expression pattern passed as an argument.
.PP
.Vb 2
\&    [% name = 'foo bar baz' %]
\&    [% name.search('bar') ? 'bar' : 'no bar' %]     # bar
.Ve
.PP
This virtual method is now deprecated in favour of match.  Move along
now, there's nothing more to see here.
.Sh "split(pattern)"
.IX Subsection "split(pattern)"
Calls Perl's \f(CW\*(C`split()\*(C'\fR function to split a string into a list of
strings.
.PP
.Vb 3
\&    [% FOREACH dir IN mypath.split(':') %]
\&       [% dir %]
\&    [% END %]
.Ve
.Sh "chunk(size)"
.IX Subsection "chunk(size)"
Splits the value into a list of chunks of a certain size.
.PP
.Vb 3
\&    [% ccard_no = "1234567824683579";
\&       ccard_no.chunk(4).join
\&    %]
.Ve
.PP
Output:
.PP
.Vb 1
\&    1234 5678 2468 3579
.Ve
.PP
If the size is specified as a negative number then the text will
be chunked from right\-to\-left.  This gives the correct grouping 
for numbers, for example.
.PP
.Vb 3
\&    [% number = 1234567;
\&       number.chunk(\-3).join(',')
\&    %]
.Ve
.PP
Output:
.PP
.Vb 1
\&    1,234,567
.Ve
.Sh "substr(offset, length, replacement)"
.IX Subsection "substr(offset, length, replacement)"
Returns a substring starting at \f(CW\*(C`offset\*(C'\fR, for \f(CW\*(C`length\*(C'\fR characters.
.PP
.Vb 2
\&    [% str 'foo bar baz wiz waz woz') %]
\&    [% str.substr(4, 3) %]    # bar
.Ve
.PP
If \f(CW\*(C`length\*(C'\fR is not specified then it returns everything from the
\&\f(CW\*(C`offset\*(C'\fR to the end of the string.
.PP
.Vb 1
\&    [% str.substr(12) %]      # wiz waz woz
.Ve
.PP
If both \f(CW\*(C`length\*(C'\fR and \f(CW\*(C`replacement\*(C'\fR are specified, then the method
replaces everything from \f(CW\*(C`offset\*(C'\fR for \f(CW\*(C`length\*(C'\fR characters with
\&\f(CW$replacement\fR.  The substring removed from the string is then returned.
.PP
.Vb 2
\&    [% str.substr(0, 11, 'FOO') %]   # foo bar baz
\&    [% str %]                        # FOO wiz waz woz
.Ve
.Sh "list"
.IX Subsection "list"
Return the value as a single element list.  This can be useful if you
have a variable which may contain a single item or a list and you want
to treat them equally.  The \f(CW\*(C`list\*(C'\fR method can be called against a list
reference and will simply return the original reference, effectively
a no\-op.
.PP
.Vb 1
\&    [% thing.list.size %]  # thing can be a scalar or a list
.Ve
.Sh "hash"
.IX Subsection "hash"
Return the value as a hash reference containing a single entry with
the key \f(CW\*(C`value\*(C'\fR indicating the original scalar value.  As with the 
\&\f(CW\*(C`list\*(C'\fR virtual method, this is generally used to help massage data
into different formats.
.Sh "size"
.IX Subsection "size"
Always returns 1 for scalar values.  This method is provided for 
consistency with the hash and list size methods.
.SH "Hash Virtual Methods"
.IX Header "Hash Virtual Methods"
.Sh "keys"
.IX Subsection "keys"
Returns a list of keys in the hash.  They are not returned in any 
particular order, but the order is the same as for the corresponding
values method.
.PP
.Vb 3
\&    [% FOREACH key IN hash.keys %]
\&       * [% key %]
\&    [% END %]
.Ve
.PP
If you want the keys in sorted order, use the list \f(CW\*(C`sort\*(C'\fR method.
.PP
.Vb 3
\&    [% FOREACH key IN hash.keys.sort %]
\&       * [% key %]
\&    [% END %]
.Ve
.PP
Having got the keys in sorted order, you can then use variable
interpolation to fetch the value.  This is shown in the following 
example by the use of \f(CW$key\fR to fetch the item from \f(CW\*(C`hash\*(C'\fR whose
key is stored in the \f(CW\*(C`key\*(C'\fR variable.
.PP
.Vb 3
\&    [% FOREACH key IN hash.keys.sort %]
\&       * [% key %] = [% hash.$key %]
\&    [% END %]
.Ve
.PP
Alternately, you can use the \f(CW\*(C`pairs\*(C'\fR method to get a list of 
key/value pairs in sorted order.
.Sh "values"
.IX Subsection "values"
Returns a list of the values in the hash.  As with the \f(CW\*(C`keys\*(C'\fR method, 
they are not returned in any particular order, although it is the same
order that the keys are returned in.
.PP
.Vb 1
\&    [% hash.values.join(', ') %]
.Ve
.Sh "items"
.IX Subsection "items"
Returns a list of both the keys and the values expanded into a single list.
.PP
.Vb 4
\&    [% hash = {
\&          a = 10
\&          b = 20
\&       };
.Ve
.PP
.Vb 2
\&       hash.items.join(', ')    # a, 10, b, 20
\&    %]
.Ve
.Sh "each"
.IX Subsection "each"
This method currently returns the same thing as the \f(CW\*(C`items\*(C'\fR method.
.PP
However, please note that this method will change in the next major
version of the Template Toolkit (v3) to return the same thing as the
\&\f(CW\*(C`pairs\*(C'\fR method.  This will be done in an effort to make these virtual
method more consistent with each other and how Perl works.
.PP
In anticipation of this, we recommend that you stop using \f(CW\*(C`hash.each\*(C'\fR
and instead use \f(CW\*(C`hash.items\*(C'\fR.
.Sh "pairs"
.IX Subsection "pairs"
This method returns a list of key/value pairs.  They are returned in
sorted order according to the keys.
.PP
.Vb 3
\&    [% FOREACH pair IN product.pairs %]
\&       * [% pair.key %] is [% pair.value %]
\&    [% END %]
.Ve
.Sh "list"
.IX Subsection "list"
Returns the contents of the hash in list form.  An argument can be
passed to indicate the desired items required in the list: \f(CW\*(C`keys\*(C'\fR to
return a list of the keys (same as \f(CW\*(C`hash.keys\*(C'\fR), \f(CW\*(C`values\*(C'\fR to return a
list of the values (same as \f(CW\*(C`hash.values\*(C'\fR), \f(CW\*(C`each\*(C'\fR to return as list
of key and values (same as \f(CW\*(C`hash.each\*(C'\fR), or \f(CW\*(C`pairs\*(C'\fR to return a list
of key/value pairs (same as \f(CW\*(C`hash.pairs\*(C'\fR).
.PP
.Vb 4
\&    [% keys   = hash.list('keys') %]
\&    [% values = hash.list('values') %]
\&    [% items  = hash.list('each') %]
\&    [% pairs  = hash.list('pairs') %]
.Ve
.PP
When called without an argument it currently returns the same thing as
the \f(CW\*(C`pairs\*(C'\fR method.  However, please note that this method will change
in the next major version of the Template Toolkit (v3) to return a
reference to a list containing the single hash reference (as per the
scalar list method).
.PP
In anticipation of this, we recommend that you stop using \f(CW\*(C`hash.list\*(C'\fR
and instead use \f(CW\*(C`hash.pairs\*(C'\fR.
.Sh "sort, nsort"
.IX Subsection "sort, nsort"
Return a list of the keys, sorted alphabetically (\f(CW\*(C`sort\*(C'\fR) or numerically
(\f(CW\*(C`nsort\*(C'\fR) according to the corresponding values in the hash.
.PP
.Vb 3
\&    [% FOREACH n IN phones.sort %]
\&       [% phones.$n %] is [% n %],
\&    [% END %]
.Ve
.Sh "import"
.IX Subsection "import"
The \f(CW\*(C`import\*(C'\fR method can be called on a hash array to import the contents
of another hash array.
.PP
.Vb 9
\&    [% hash1 = {
\&         foo = 'Foo'
\&         bar = 'Bar'
\&       }
\&       hash2 = {
\&           wiz = 'Wiz'
\&           woz = 'Woz'
\&       }
\&    %]
.Ve
.PP
.Vb 2
\&    [% hash1.import(hash2) %]
\&    [% hash1.wiz %]             # Wiz
.Ve
.PP
You can also call the \f(CW\*(C`import()\*(C'\fR method by itself to import a hash array
into the current namespace hash.
.PP
.Vb 3
\&    [% user = { id => 'lwall', name => 'Larry Wall' } %]
\&    [% import(user) %]
\&    [% id %]: [% name %]        # lwall: Larry Wall
.Ve
.Sh "defined, exists"
.IX Subsection "defined, exists"
Returns a true or false value if an item in the hash denoted by the key
passed as an argument is defined or exists, respectively.
.PP
.Vb 2
\&    [% hash.defined('somekey') ? 'yes' : 'no' %]
\&    [% hash.exists('somekey') ? 'yes' : 'no' %]
.Ve
.PP
When called without any argument, \f(CW\*(C`hash.defined\*(C'\fR returns true if the hash
itself is defined (e.g. the same effect as \f(CW\*(C`scalar.defined\*(C'\fR).
.Sh "delete"
.IX Subsection "delete"
Delete one or more items from the hash.
.PP
.Vb 1
\&    [% hash.delete('foo', 'bar') %]
.Ve
.Sh "size"
.IX Subsection "size"
Returns the number of key/value pairs in the hash.
.Sh "item"
.IX Subsection "item"
Returns an item from the hash using a key passed as an argument.
.PP
.Vb 1
\&    [% hash.item('foo') %]  # same as hash.foo
.Ve
.SH "List Virtual Methods"
.IX Header "List Virtual Methods"
.Sh "first, last"
.IX Subsection "first, last"
Returns the first/last item in the list.  The item is not removed from the 
list.
.PP
.Vb 1
\&    [% results.first %] to [% results.last %]
.Ve
.PP
If either is given a numeric argument \f(CW\*(C`n\*(C'\fR, they return the first or
last \f(CW\*(C`n\*(C'\fR elements:
.PP
.Vb 1
\&    The first 5 results are [% results.first(5).join(", ") %].
.Ve
.Sh "size, max"
.IX Subsection "size, max"
Returns the size of a list (number of elements) and the maximum 
index number (size \- 1), respectively.
.PP
.Vb 1
\&    [% results.size %] search results matched your query
.Ve
.Sh "defined"
.IX Subsection "defined"
Returns a true or false value if the item in the list denoted by the
argument is defined.
.PP
.Vb 1
\&    [% list.defined(3) ? 'yes' : 'no' %]
.Ve
.PP
When called without any argument, \f(CW\*(C`list.defined\*(C'\fR returns true if the list
itself is defined (e.g. the same effect as \f(CW\*(C`scalar.defined\*(C'\fR).
.Sh "reverse"
.IX Subsection "reverse"
Returns the items of the list in reverse order.
.PP
.Vb 3
\&    [% FOREACH s IN scores.reverse %]
\&       ...
\&    [% END %]
.Ve
.Sh "join"
.IX Subsection "join"
Joins the items in the list into a single string, using Perl's \f(CW\*(C`join()\*(C'\fR
function.
.PP
.Vb 1
\&    [% items.join(', ') %]
.Ve
.Sh "grep"
.IX Subsection "grep"
Returns a list of the items in the list that match a regular expression
pattern.
.PP
.Vb 3
\&    [% FOREACH directory.files.grep('\e.txt$') %]
\&       ...
\&    [% END %]
.Ve
.Sh "sort, nsort"
.IX Subsection "sort, nsort"
Returns the items in alpha (\f(CW\*(C`sort\*(C'\fR) or numerical (\f(CW\*(C`nsort\*(C'\fR) order.
.PP
.Vb 1
\&    [% library = books.sort %]
.Ve
.PP
An argument can be provided to specify a search key.  Where an item in 
the list is a hash reference, the search key will be used to retrieve a 
value from the hash which will then be used as the comparison value.
Where an item is an object which implements a method of that name, the
method will be called to return a comparison value.
.PP
.Vb 1
\&    [% library = books.sort('author') %]
.Ve
.PP
In the example, the \f(CW\*(C`books\*(C'\fR list can contains hash references with 
an \f(CW\*(C`author\*(C'\fR key or objects with an \f(CW\*(C`author\*(C'\fR method.
.PP
You can also specify multiple sort keys.
.PP
.Vb 1
\&    [% library = books.sort('author', 'title') %]
.Ve
.PP
In this case the books will be sorted primarily by author.  If two or more
books have authors with the same name then they will be sorted by title.
.Sh "unshift(item), push(item)"
.IX Subsection "unshift(item), push(item)"
The \f(CW\*(C`push()\*(C'\fR method adds an item or items to the end of list.
.PP
.Vb 2
\&    [% mylist.push(foo) %]
\&    [% mylist.push(foo, bar) %]
.Ve
.PP
The \f(CW\*(C`unshift()\*(C'\fR method adds an item or items to the start of a list.
.PP
.Vb 2
\&    [% mylist.unshift(foo) %]
\&    [% mylist.push(foo, bar)    %]
.Ve
.Sh "shift, pop"
.IX Subsection "shift, pop"
Removes the first/last item from the list and returns it.
.PP
.Vb 2
\&    [% first = mylist.shift %]
\&    [% last  = mylist.pop   %]
.Ve
.Sh "unique"
.IX Subsection "unique"
Returns a list of the unique elements in a list, in the same order
as in the list itself.
.PP
.Vb 2
\&    [% mylist = [ 1, 2, 3, 2, 3, 4, 1, 4, 3, 4, 5 ] %]
\&    [% numbers = mylist.unique %]
.Ve
.PP
While this can be explicitly sorted, it is not required that the list
be sorted before the unique elements are pulled out (unlike the Unix
command line utility).
.PP
.Vb 1
\&    [% numbers = mylist.unique.sort %]
.Ve
.Sh "import"
.IX Subsection "import"
Appends the contents of one or more other lists to the end of the
current list.
.PP
.Vb 6
\&    [% one   = [ 1 2 3 ];
\&       two   = [ 4 5 6 ];
\&       three = [ 7 8 9 ];
\&       one.import(two, three);
\&       one.join(', );     # 1, 2, 3, 4, 5, 6, 7, 8, 9       
\&    %]
.Ve
.Sh "merge"
.IX Subsection "merge"
Returns a list composed of zero or more other lists:
.PP
.Vb 5
\&    [% list_one = [ 1 2 3 ];
\&       list_two = [ 4 5 6 ];
\&       list_three = [ 7 8 9 ];
\&       list_four = list_one.merge(list_two, list_three);
\&    %]
.Ve
.PP
The original lists are not modified.
.Sh "slice(from, to)"
.IX Subsection "slice(from, to)"
Returns a slice of items in the list between the bounds passed as
arguments.  If the second argument, \f(CW\*(C`to\*(C'\fR, isn't specified, then it
defaults to the last item in the list.  The original list is not 
modified.
.PP
.Vb 2
\&    [% first_three = list.slice(0,2) %]
\&    [% last_three  = list.slice(\-3, \-1) %]
.Ve
.Sh "splice(offset, length, list)"
.IX Subsection "splice(offset, length, list)"
Behaves just like Perl's \f(CW\*(C`splice()\*(C'\fR function allowing you to selectively
remove and/or replace elements in a list.  It removes \f(CW\*(C`length\*(C'\fR items
from the list, starting at \f(CW\*(C`offset\*(C'\fR and replaces them with the items
in \f(CW\*(C`list\*(C'\fR.
.PP
.Vb 6
\&    [% play_game = [ 'play', 'scrabble' ];
\&       ping_pong = [ 'ping', 'pong' ];
\&       redundant = play_game.splice(1, 1, ping_pong);
\&       redundant.join;     # scrabble
\&       play_game.join;     # play ping pong
\&    %]
.Ve
.PP
The method returns a list of the items removed by the splice.
You can use the \f(CW\*(C`CALL\*(C'\fR directive to ignore the output if you're
not planning to do anything with it.
.PP
.Vb 1
\&    [% CALL play_game.splice(1, 1, ping_pong) %]
.Ve
.PP
As well as providing a reference to a list of replacement values,
you can pass in a list of items.
.PP
.Vb 1
\&    [% CALL list.splice(\-1, 0, 'foo', 'bar') %]
.Ve
.PP
Be careful about passing just one item in as a replacement value.
If it is a reference to a list then the contents of the list will
be used.  If it's not a list, then it will be treated as a single 
value.  You can use square brackets around a single item if you 
need to be explicit:
.PP
.Vb 2
\&    [% # push a single item, an_item
\&       CALL list.splice(\-1, 0, an_item);
.Ve
.PP
.Vb 2
\&       # push the items from another_list
\&       CALL list.splice(\-1, 0, another_list);
.Ve
.PP
.Vb 3
\&       # push a reference to another_list
\&       CALL list.splice(\-1, 0, [ another_list ]);
\&    %]
.Ve
.Sh "hash"
.IX Subsection "hash"
Returns a reference to a hash array comprised of the elements in the
list.  The even-numbered elements (0, 2, 4, etc) become the keys and
the odd-numbered elements (1, 3, 5, etc) the values.
.PP
.Vb 4
\&    [% list = ['pi', 3.14, 'e', 2.718] %]
\&    [% hash = list.hash %]
\&    [% hash.pi %]               # 3.14
\&    [% hash.e  %]               # 2.718
.Ve
.PP
If a numerical argument is provided then the hash returned will have
keys generated for each item starting at the number specified.
.PP
.Vb 4
\&    [% list = ['beer', 'peanuts'] %]
\&    [% hash = list.hash(1) %]
\&    [% hash.1  %]               # beer          
\&    [% hash.2  %]               # peanuts
.Ve
.SH "Automagic Promotion of Scalar to List for Virtual Methods"
.IX Header "Automagic Promotion of Scalar to List for Virtual Methods"
In addition to the scalar virtual methods listed in the previous
section, you can also call any list virtual method against a scalar.
The item will be automagically promoted to a single element list and
the appropriate list virtual method will be called.  
.PP
One particular benefit of this comes when calling subroutines or
object methods that return a list of items, rather than the 
preferred reference to a list of items.  In this case, the 
Template Toolkit automatically folds the items returned into
a list.
.PP
The upshot is that you can continue to use existing Perl modules or
code that returns lists of items, without having to refactor it
just to keep the Template Toolkit happy (by returning references
to list).  \f(CW\*(C`Class::DBI\*(C'\fR module is just one example of a particularly 
useful module which returns values this way.
.PP
If only a single item is returned from a subroutine then the 
Template Toolkit assumes it meant to return a single item (rather
than a list of 1 item) and leaves it well alone, returning the
single value as it is.  If you're executing a database query, 
for example, you might get 1 item returned, or perhaps many 
items which are then folded into a list.
.PP
The \f(CW\*(C`FOREACH\*(C'\fR directive will happily accept either a list or a single item
which it will treat as a list. So it's safe to write directives like this,
where we assume that the \f(CW\*(C`something\*(C'\fR variable is bound to a subroutine which
may return one or more items:
.PP
.Vb 3
\&    [% FOREACH item IN something %]
\&       ...
\&    [% END %]
.Ve
.PP
The automagic promotion of scalars to single item lists means 
that you can also use list virtual methods safely, even if you
only get one item returned.  For example:
.PP
.Vb 3
\&    [% something.first   %]
\&    [% something.join    %]
\&    [% something.reverse.join(', ') %]
.Ve
.PP
Note that this is very much a last-ditch behaviour.  If the single
item return is an object with a \f(CW\*(C`first\*(C'\fR method, for example, then that
will be called, as expected, in preference to the list virtual method.
.SH "Defining Custom Virtual Methods"
.IX Header "Defining Custom Virtual Methods"
You can define your own virtual methods for scalars, lists and hash arrays.
The Template::Stash package variables \f(CW$SCALAR_OPS\fR, \f(CW$LIST_OPS\fR and
\&\f(CW$HASH_OPS\fR are references to hash arrays that define these virtual methods.
\&\f(CW\*(C`HASH_OPS\*(C'\fR and \f(CW\*(C`LIST_OPS\*(C'\fR methods are subroutines that accept a hash/list
reference as the first item. \f(CW\*(C`SCALAR_OPS\*(C'\fR are subroutines that accept a scalar
value as the first item. Any other arguments specified when the method is
called will be passed to the subroutine.
.PP
.Vb 2
\&    # load Template::Stash to make method tables visible
\&    use Template::Stash;
.Ve
.PP
.Vb 5
\&    # define list method to return new list of odd numbers only
\&    $Template::Stash::LIST_OPS\->{ odd } = sub {
\&        my $list = shift;
\&        return [ grep { $_ % 2 } @$list ];
\&    };
.Ve
.PP
Example template:
.PP
.Vb 2
\&    [% primes = [ 2, 3, 5, 7, 9 ] %]
\&    [% primes.odd.join(', ') %]         # 3, 5, 7, 9
.Ve
.PP
\&\s-1TODO:\s0 document the \fIdefine_vmethod()\fR method which makes this even easier