Skip to content

List::Util: fix internal section links #140

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Grinnz wants to merge 1 commit into
base: master
Choose a base branch
from
Open

List::Util: fix internal section links #140

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions lib/List/Util.pm
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -680,7 +680,7 @@ C<List::MoreUtils::zip_unflatten>. This function does not apply a prototype,
so make sure to invoke it with references to arrays.

For a function similar to the C<zip> function from C<List::MoreUtils>, see
L<mesh>.
L</mesh>.

my @result = zip_shortest ...

Expand All @@ -707,7 +707,7 @@ at the corresponding position from each of the given input arrays. If any
input arrays run out of elements before others, then C<undef> will be inserted
into the result to fill in the gaps.

This is similar to L<zip>, except that all of the ranges in the result are
This is similar to L</zip>, except that all of the ranges in the result are
returned in one long flattened list, instead of being bundled into separate
arrays.

Expand All @@ -727,7 +727,7 @@ to invoke it with references to arrays.

my @result = mesh_longest ...

These variations are similar to those of L<zip>, in that they differ in
These variations are similar to those of L</zip>, in that they differ in
behaviour when one of the input lists runs out of elements before the others.

=head1 CONFIGURATION VARIABLES
Expand Down