Acme-CPANModules-DataStructureWalker
view release on metacpan - search on metacpan
view release on metacpan or search on metacpan
{
"abstract" : "List of modules that traverse your data structure",
"author" : [
"perlancar <perlancar@cpan.org>"
],
"dynamic_config" : 0,
"generated_by" : "Dist::Zilla version 6.030, CPAN::Meta::Converter version 2.150010",
"license" : [
"perl_5"
],
"meta-spec" : {
"url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec",
NAME
Acme::CPANModules::DataStructureWalker - List of modules that traverse
your data structure
VERSION
This document describes version 0.003 of
Acme::CPANModules::DataStructureWalker (from Perl distribution
Acme-CPANModules-DataStructureWalker), released on 2023-10-29.
DESCRIPTION
This list catalogs modules that let you traverse your data structure by
visiting each node/item: each element of an array, each key/value pair
of a hash, recursively. Sort of like File::Find for your data instead of
filesystem. These modules can be used for searching or modifying your
data.
Many modules in this list mimic Perl's "map" interface, for example:
Data::Rmap, Data::Dmap, Data::Traverse. The difference among these
modules lies in the details: in how you specify option to skip
unsupported types of references, or whether some let you control the
recursion (e.g. Data::Rmap's and Data::Dmap's "cut"),
Data::Walk models its interface on File::Find. It lets you choose
whether you want to go depth-first or breadth-first.
Benchmarks for these modules coming soon.
Related modules:
Data::Clean can be used to clean/sanitize your data structure more
performantly compared to your manual walking (e.g. using Data::Rmap). It
works by generating Perl code specifically for your cleaning needs.
ACME::CPANMODULES ENTRIES
Data::Rmap
Author: BOWMANBS <https://metacpan.org/author/BOWMANBS>
Data::Dmap
Author: MADZ <https://metacpan.org/author/MADZ>
lib/Acme/CPANModules/DataStructureWalker.pm view on Meta::CPAN
package Acme::CPANModules::DataStructureWalker;
use strict;
our $AUTHORITY = 'cpan:PERLANCAR'; # AUTHORITY
our $DATE = '2023-10-29'; # DATE
our $DIST = 'Acme-CPANModules-DataStructureWalker'; # DIST
our $VERSION = '0.003'; # VERSION
our $LIST = {
summary => "List of modules that traverse your data structure",
description => <<'_',
This list catalogs modules that let you traverse your data structure by visiting
each node/item: each element of an array, each key/value pair of a hash,
recursively. Sort of like <pm:File::Find> for your data instead of filesystem.
These modules can be used for searching or modifying your data.
Many modules in this list mimic Perl's `map` interface, for example:
<pm:Data::Rmap>, <pm:Data::Dmap>, <pm:Data::Traverse>. The difference among
these modules lies in the details: in how you specify option to skip unsupported
types of references, or whether some let you control the recursion (e.g.
Data::Rmap's and Data::Dmap's `cut`),
<pm:Data::Walk> models its interface on File::Find. It lets you choose whether
you want to go depth-first or breadth-first.
Benchmarks for these modules coming soon.
Related modules:
<pm:Data::Clean> can be used to clean/sanitize your data structure more
performantly compared to your manual walking (e.g. using Data::Rmap). It works
by generating Perl code specifically for your cleaning needs.
_
entries => [
{module => 'Data::Rmap'},
{module => 'Data::Dmap'},
{module => 'Data::Visitor'},
{module => 'Data::Transformer'},
{module => 'Data::Traverse'},
{module => 'Data::Leaf::Walker'},
{module => 'Data::Walk'},
{module => 'Data::Clean'},
],
};
1;
# ABSTRACT: List of modules that traverse your data structure
__END__
=pod
=encoding UTF-8
=head1 NAME
Acme::CPANModules::DataStructureWalker - List of modules that traverse your data structure
=head1 VERSION
This document describes version 0.003 of Acme::CPANModules::DataStructureWalker (from Perl distribution Acme-CPANModules-DataStructureWalker), released on 2023-10-29.
=head1 DESCRIPTION
This list catalogs modules that let you traverse your data structure by visiting
each node/item: each element of an array, each key/value pair of a hash,
recursively. Sort of like L<File::Find> for your data instead of filesystem.
These modules can be used for searching or modifying your data.
Many modules in this list mimic Perl's C<map> interface, for example:
L<Data::Rmap>, L<Data::Dmap>, L<Data::Traverse>. The difference among
these modules lies in the details: in how you specify option to skip unsupported
types of references, or whether some let you control the recursion (e.g.
Data::Rmap's and Data::Dmap's C<cut>),
L<Data::Walk> models its interface on File::Find. It lets you choose whether
you want to go depth-first or breadth-first.
Benchmarks for these modules coming soon.
Related modules:
L<Data::Clean> can be used to clean/sanitize your data structure more
performantly compared to your manual walking (e.g. using Data::Rmap). It works
by generating Perl code specifically for your cleaning needs.
=head1 ACME::CPANMODULES ENTRIES
=over
=item L<Data::Rmap>
Author: L<BOWMANBS|https://metacpan.org/author/BOWMANBS>
view all matches for this distributionview release on metacpan - search on metacpan
( run in 1.435 second using v1.00-cache-2.02-grep-82fe00e-cpan-4673cadbf75 )