List::Flat is a module with functions to flatten a deep structure of array references into a single flat list....

This module provides functions for slicing lists. This is helpful when you want to do a chain of manipulations on a list (map, grep, sort) and then slice, without the cumbersome "(...)[x]" syntax....

List::ToHash provides fast conversion list to hash by using lightweight callback API. "map" is so simple and good for readability. I usually use this in this situation. my $x = +{map { ($_->{id} => $_) } @users}; "List::Util::reduce" is a little tric...

This module provides a number of list utility functions, all of which take an initial code block to control their behaviour. They are variations on similar core perl or "List::Util" functions of similar names, but which use the block to control their...

A data domain is a description of a set of values, either scalar or structured (arrays or hashes). The description can include many constraints, like minimal or maximal values, regular expressions, required fields, forbidden fields, and also contextu...

List::MapMulti provides shortcuts for looping through several lists in a nested fashion. Think about all the times you've needed to do something like: foreach my $x (@exes) { foreach my $y (@whys) { # do something with $x and $y } } There are two dif...

This module provides MODS (http://www.loc.gov/standards/mods/) parsing and creation for MODS Schema 3.5....

OK, so you might ask yourself, why would you want to do this: my \@array = $arrayref; When you can just do this: my @array = @{ $arrayref }; Well, in that simple case List::AssignRef is overkill. However, what about cases when you have a function tha...

A binary search searches sorted lists using a divide and conquer technique. On each iteration the search domain is cut in half, until the result is found. The computational complexity of a binary search is O(log n). The binary search algorithm implem...

This package provides for creating a list of files (from different sources) and performing arithmetic and other applicable operations on said lists....

There are no user-facing parts here. See List::SomeUtils for API details. You shouldn't have to install this module directly. When you install List::SomeUtils, it checks whether your system has a compiler. If it does, then it adds a dependency on thi...

List::MoreUtils::XS is a backend for List::MoreUtils. Even if it's possible (because of user wishes) to have it practically independent from List::MoreUtils, it technically depend on "List::MoreUtils". Since it's only a backend, the API is not public...

A binary search searches *sorted* lists using a divide and conquer technique. On each iteration the search domain is cut in half, until the result is found. The computational complexity of a binary search is O(log n). This module implements several B...

A set of roles and classes defining an object-oriented interface to Perl hashes and arrays with useful utility methods, junctions, type-checking ability, and optional autoboxing. Originally derived from Data::Perl. Uses The included objects are usefu...