=over 4
-=item 18
+=item Z<>18
Checks C<atime> and C<mtime> of C<stat()> - unfortunately, HPFS
provides only 2sec time granularity (for compatibility with FAT?).
-=item 25
+=item Z<>25
Checks C<truncate()> on a filehandle just opened for write - I do not
know why this should or should not work.
=head1 VERSION
-1.60
+1.61
=cut
-$VERSION = '1.60'; # <-- do not forget to update the POD section just above this line!
+$VERSION = '1.61'; # <-- do not forget to update the POD section just above this line!
$VERSION = eval $VERSION;
=pod
use it to install under. In all other cases of success returns $file.
On failure throws a fatal error.
-=back
-
=end _private
=cut
=pod
+=back
+
=head2 Functions
=begin _private
=pod
+=back
+
=end _private
+=over
+
=item B<install>
# deprecated forms
# This file is autogenerated by buildtoc from all the other pods.
# Edit those files and run $0 to effect changes.
+ =encoding UTF-8
+
=head1 NAME
perltoc - perl documentation table of contents
=over 4
-=item 0
+=item Z<>0
Start with the first letter in the string 'a'.
-=item 1
+=item Z<>1
Try the first alternative in the first group 'abd'.
-=item 2
+=item Z<>2
Match 'a' followed by 'b'. So far so good.
-=item 3
+=item Z<>3
'd' in the regexp doesn't match 'c' in the string - a dead
end. So backtrack two characters and pick the second alternative in
the first group 'abc'.
-=item 4
+=item Z<>4
Match 'a' followed by 'b' followed by 'c'. We are on a roll
and have satisfied the first group. Set $1 to 'abc'.
-=item 5
+=item Z<>5
Move on to the second group and pick the first alternative
'df'.
-=item 6
+=item Z<>6
Match the 'd'.
-=item 7
+=item Z<>7
'f' in the regexp doesn't match 'e' in the string, so a dead
end. Backtrack one character and pick the second alternative in the
second group 'd'.
-=item 8
+=item Z<>8
'd' matches. The second grouping is satisfied, so set $2 to
'd'.
-=item 9
+=item Z<>9
We are at the end of the regexp, so we are done! We have
matched 'abcd' out of the string "abcde".
=over 4
-=item 0
+=item Z<>0
Start with the first letter in the string 't'.
-=item 1
+=item Z<>1
The first quantifier '.*' starts out by matching the whole
string 'the cat in the hat'.
-=item 2
+=item Z<>2
'a' in the regexp element 'at' doesn't match the end of the
string. Backtrack one character.
-=item 3
+=item Z<>3
'a' in the regexp element 'at' still doesn't match the last
letter of the string 't', so backtrack one more character.
-=item 4
+=item Z<>4
Now we can match the 'a' and the 't'.
-=item 5
+=item Z<>5
Move on to the third element '.*'. Since we are at the end of
the string and '.*' can match 0 times, assign it the empty string.
-=item 6
+=item Z<>6
We are done!
=over 4
-=item 1.
+=item Z<>1.
A user-defined subroutine call or a method invocation.
-=item 2.
+=item Z<>2.
A regular expression match in the form of C</REGEX/>, C<$foo =~ /REGEX/>,
or C<$foo =~ EXPR>. Also, a negated regular expression match in
the form C<!/REGEX/>, C<$foo !~ /REGEX/>, or C<$foo !~ EXPR>.
-=item 3.
+=item Z<>3.
A smart match that uses an explicit C<~~> operator, such as C<EXPR ~~ EXPR>.
-=item 4.
+=item Z<>4.
A boolean comparison operator such as C<$_ E<lt> 10> or C<$x eq "abc">. The
relational operators that this applies to are the six numeric comparisons
the default case uses C<$_ ~~ $c> , which is frequently
the opposite of what you want.
-=item 5.
+=item Z<>5.
At least the three builtin functions C<defined(...)>, C<exists(...)>, and
C<eof(...)>. We might someday add more of these later if we think of them.
-=item 6.
+=item Z<>6.
A negated expression, whether C<!(EXPR)> or C<not(EXPR)>, or a logical
exclusive-or, C<(EXPR1) xor (EXPR2)>. The bitwise versions (C<~> and C<^>)
are not included.
-=item 7.
+=item Z<>7.
A filetest operator, with exactly 4 exceptions: C<-s>, C<-M>, C<-A>, and
C<-C>, as these return numerical values, not boolean ones. The C<-z>
filetest operator is not included in the exception list.
-=item 8.
+=item Z<>8.
The C<..> and C<...> flip-flop operators. Note that the C<...> flip-flop
operator is completely different from the C<...> elliptical statement
=over 4
-=item 9.
+=item Z<>9.
If EXPR is C<EXPR1 && EXPR2> or C<EXPR1 and EXPR2>, the test is applied
I<recursively> to both EXPR1 and EXPR2.
test, I<recursively>, will the expression be treated as boolean. Otherwise,
smartmatching is used.
-=item 10.
+=item Z<>10.
If EXPR is C<EXPR1 || EXPR2>, C<EXPR1 // EXPR2>, or C<EXPR1 or EXPR2>, the
test is applied I<recursively> to EXPR1 only (which might itself be a
projects / platform / upstream / perl.git / commitdiff