suppress bogus warning on C<sub x {} x()>

[p5sagit/p5-mst-13.2.git] / pod / perldsc.pod

diff --git a/pod/perldsc.pod b/pod/perldsc.pod
index 61c45b9..d0cc335 100644 (file)
--- a/pod/perldsc.pod
+++ b/pod/perldsc.pod
@@ -64,8 +64,8 @@ sections on each of the following:
 
 =back
 
-But for now, let's look at some of the general issues common to all
-of these types of data structures.
+But for now, let's look at general issues common to all
+these types of data structures.
 
 =head1 REFERENCES
 
@@ -134,7 +134,7 @@ might do well to consider being a tad more explicit about it, like this:
 
     for $i (1..10) {
        @list = somefunc($i);
-       $counts[$i] = scalar @list;     
+       $counts[$i] = scalar @list;
     }
 
 Here's the case of taking a reference to the same memory location
@@ -305,7 +305,7 @@ debugger includes several new features, including command line editing as
 well as the C<x> command to dump out complex data structures.  For
 example, given the assignment to $LoL above, here's the debugger output:
 
-    DB<1> X $LoL
+    DB<1> x $LoL
     $LoL = ARRAY(0x13b5a0)
        0  ARRAY(0x1f0a24)
          0  'fred'
@@ -324,11 +324,9 @@ example, given the assignment to $LoL above, here's the debugger output:
          2  'elroy'
          3  'judy'
 
-There's also a lowercase B<x> command which is nearly the same.
-
 =head1 CODE EXAMPLES
 
-Presented with little comment (these will get their own man pages someday)
+Presented with little comment (these will get their own manpages someday)
 here are short code examples illustrating access of various
 types of data structures.
 
@@ -457,13 +455,13 @@ types of data structures.
  }
 
  # print the whole thing sorted by number of members and name
- foreach $family ( sort { 
+ foreach $family ( sort {
                            @{$HoL{$b}} <=> @{$HoL{$a}}
                                        ||
                                    $a cmp $b
            } keys %HoL )
  {
-     print "$family: ", join(", ", sort @{ $HoL{$family}), "\n";
+     print "$family: ", join(", ", sort @{ $HoL{$family} }), "\n";
  }
 
 =head1 LISTS OF HASHES
@@ -616,7 +614,7 @@ types of data structures.
  # append new members to an existing family
  %new_folks = (
      wife => "wilma",
-     pet  => "dino";
+     pet  => "dino",
  );
 
  for $what (keys %new_folks) {
@@ -698,8 +696,8 @@ many different sorts:
      print $rec->{LOOKUP}{"key"};
      ($first_k, $first_v) = each %{ $rec->{LOOKUP} };
 
-     $answer = &{ $rec->{THATCODE} }($arg);
-     $answer = &{ $rec->{THISCODE} }($arg1, $arg2);
+     $answer = $rec->{THATCODE}->($arg);
+     $answer = $rec->{THISCODE}->($arg1, $arg2);
 
      # careful of extra block braces on fh ref
      print { $rec->{HANDLE} } "a string\n";
@@ -819,7 +817,7 @@ hashes) to a dbm file.  The first problem is that all but GDBM and
 Berkeley DB have size limitations, but beyond that, you also have problems
 with how references are to be represented on disk.  One experimental
 module that does partially attempt to address this need is the MLDBM
-module.  Check your nearest CPAN site as described in L<perlmod> for
+module.  Check your nearest CPAN site as described in L<perlmodlib> for
 source code to MLDBM.
 
 =head1 SEE ALSO