X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=pod%2Fperltie.pod;h=8f3a6774aeb18fd76fcee8e0cb1da2856f28b52b;hb=a8476e91ee770bd8b0c7183fe1314d9effd435ad;hp=72288a08a23af2cfccc583fda49538054b3fc24e;hpb=6f12eb6d2a1dfaf441504d869b27d2e40ef4966a;p=p5sagit%2Fp5-mst-13.2.git diff --git a/pod/perltie.pod b/pod/perltie.pod index 72288a0..8f3a677 100644 --- a/pod/perltie.pod +++ b/pod/perltie.pod @@ -361,7 +361,7 @@ C<$self-E{ELEMSIZE}> spaces only, it does not exist: Delete the element at index I from the tied array I. -In our example, a deleted item is C<$self->{ELEMSIZE}> spaces: +In our example, a deleted item is C<$self-E{ELEMSIZE}> spaces: sub DELETE { my $self = shift; @@ -794,9 +794,16 @@ READ, and possibly CLOSE, UNTIE and DESTROY. The class can also provide: BINMOD OPEN, EOF, FILENO, SEEK, TELL - if the corresponding perl operators are used on the handle. -It is especially useful when perl is embedded in some other program, -where output to STDOUT and STDERR may have to be redirected in some -special way. See nvi and the Apache module for examples. +When STDERR is tied, its PRINT method will be called to issue warnings +and error messages. This feature is temporarily disabled during the call, +which means you can use C inside PRINT without starting a recursive +loop. And just like C<__WARN__> and C<__DIE__> handlers, STDERR's PRINT +method may be called to report parser errors, so the caveats mentioned under +L apply. + +All of this is especially useful when perl is embedded in some other +program, where output to STDOUT and STDERR may have to be redirected +in some special way. See nvi and the Apache module for examples. In our example we're going to create a shouting handle. @@ -1076,6 +1083,14 @@ source code to MLDBM. Tied filehandles are still incomplete. sysopen(), truncate(), flock(), fcntl(), stat() and -X can't currently be trapped. +The bucket usage information provided by C is not +available. If C<%hash> is tied, this will currently result in a +fatal error. + +Counting the number of entries in a hash via C or +C) is inefficient since it needs to iterate +through all the entries with FIRSTKEY/NEXTKEY. + =head1 AUTHOR Tom Christiansen