{"id":7259,"date":"2022-12-20T19:36:01","date_gmt":"2022-12-20T22:36:01","guid":{"rendered":"http:\/\/lode.uno\/linux-man\/index.php\/2022\/12\/20\/listmoreutils-man3\/"},"modified":"2022-12-20T19:36:01","modified_gmt":"2022-12-20T22:36:01","slug":"listmoreutils-man3","status":"publish","type":"post","link":"https:\/\/lode.uno\/linux-man\/2022\/12\/20\/listmoreutils-man3\/","title":{"rendered":"List::MoreUtils (man3)"},"content":{"rendered":"

List::MoreUtils<\/h1>\n

NAME<\/a>
SYNOPSIS<\/a>
DESCRIPTION<\/a>
EXPORTS<\/a>
FUNCTIONS<\/a>
ENVIRONMENT<\/a>
MAINTENANCE<\/a>
CONTRIBUTING<\/a>
BUGS<\/a>
SUPPORT<\/a>
THANKS<\/a>
TODO<\/a>
SEE ALSO<\/a>
AUTHOR<\/a>
COPYRIGHT AND LICENSE<\/a> <\/p>\n

\n

NAME <\/a> <\/h2>\n

List::MoreUtils \u2212 Provide the stuff missing in List::Util<\/p>\n

SYNOPSIS <\/a> <\/h2>\n

# import specific functions
use List::MoreUtils qw(any uniq);
if ( any { \/foo\/ } uniq @has_duplicates ) {
# do stuff
}
# import everything
use List::MoreUtils ‘:all’;
# import by API
# has “original” any\/all\/none\/notall behavior
use List::MoreUtils ‘:like_0.22’;
# 0.22 + bsearch
use List::MoreUtils ‘:like_0.24’;
# has “simplified” any\/all\/none\/notall behavior + (n)sort_by
use List::MoreUtils ‘:like_0.33’;<\/p>\n

DESCRIPTION <\/a> <\/h2>\n

List::MoreUtils<\/b> provides some trivial but commonly needed functionality on lists which is not going to go into List::Util.<\/p>\n

All of the below functions are implementable in only a couple of lines of Perl code. Using the functions from this module however should give slightly better performance as everything is implemented in C. The pure-Perl implementation of these functions only serves as a fallback in case the C portions of this module couldn\u2019t be compiled on this machine.<\/p>\n

EXPORTS <\/a> <\/h2>\n

Default behavior<\/b>
Nothing by default. To import all of this module\u2019s symbols use the “:all” tag. Otherwise functions can be imported by name as usual:<\/p>\n

use List::MoreUtils ‘:all’;
use List::MoreUtils qw{ any firstidx };<\/p>\n

Because historical changes to the API<\/small> might make upgrading List::MoreUtils difficult for some projects, the legacy API<\/small> is available via special import tags.<\/p>\n

Like version 0.22 (last release with original API<\/small> )<\/b>
This API<\/small> was available from 2006 to 2009, returning undef for empty lists on “all”\/”any”\/”none”\/”notall”:<\/p>\n

use List::MoreUtils ‘:like_0.22’;<\/p>\n

This import tag will import all functions available as of version 0.22. However, it will import “any_u” as “any”, “all_u” as “all”, “none_u” as “none”, and “notall_u” as “notall”.<\/p>\n

Like version 0.24 (first incompatible change)<\/b>
This API<\/small> was available from 2010 to 2011. It changed the return value of “none” and added the “bsearch” function.<\/p>\n

use List::MoreUtils ‘:like_0.24’;<\/p>\n

This import tag will import all functions available as of version 0.24. However it will import “any_u” as “any”, “all_u” as “all”, and “notall_u” as “notall”. It will import “none” as described in the documentation below (true for empty list).<\/p>\n

Like version 0.33 (second incompatible change)<\/b>
This API<\/small> was available from 2011 to 2014. It is widely used in several CPAN<\/small> modules and thus it\u2019s closest to the current API.<\/small> It changed the return values of “any”, “all”, and “notall”. It added the “sort_by” and “nsort_by” functions and the “distinct” alias for “uniq”. It omitted “bsearch”.<\/p>\n

use List::MoreUtils ‘:like_0.33’;<\/p>\n

This import tag will import all functions available as of version 0.33. Note: it will not import “bsearch” for consistency with the 0.33 API.<\/small><\/p>\n

FUNCTIONS <\/a> <\/h2>\n

Junctions<\/b>
Treatment of an empty list<\/i><\/p>\n

There are two schools of thought for how to evaluate a junction on an empty list:<\/p>\n\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

Reduction to an identity (boolean)<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

Result is undefined (three-valued)<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

In the first case, the result of the junction applied to the empty list is determined by a mathematical reduction to an identity depending on whether the underlying comparison is “or” or “and”. Conceptually:<\/p>\n

“any are true” “all are true”
\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212 \u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212\u2212
2 elements: A || B || 0 A && B && 1
1 element: A || 0 A && 1
0 elements: 0 1<\/p>\n

In the second case, three-value logic is desired, in which a junction applied to an empty list returns “undef” rather than true or false<\/p>\n

Junctions with a “_u” suffix implement three-valued logic. Those without are boolean.<\/p>\n

all BLOCK LIST<\/small><\/i><\/p>\n

all_u BLOCK LIST<\/small><\/i><\/p>\n

Returns a true value if all items in LIST<\/small> meet the criterion given through BLOCK.<\/small> Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

print “All values are non\u2212negative”
if all { $_ >= 0 } ($x, $y, $z);<\/p>\n

For an empty LIST,<\/small> “all” returns true (i.e. no values failed the condition) and “all_u” returns “undef”.<\/p>\n

Thus, “all_u(@list)” is equivalent to “@list ? all(@list) : undef”.<\/p>\n

Note<\/b>: because Perl treats “undef” as false, you must check the return value of “all_u” with “defined” or you will get the opposite result of what you expect.<\/p>\n

any BLOCK LIST<\/small><\/i><\/p>\n

any_u BLOCK LIST<\/small><\/i><\/p>\n

Returns a true value if any item in LIST<\/small> meets the criterion given through BLOCK.<\/small> Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

print “At least one non\u2212negative value”
if any { $_ >= 0 } ($x, $y, $z);<\/p>\n

For an empty LIST,<\/small> “any” returns false and “any_u” returns “undef”.<\/p>\n

Thus, “any_u(@list)” is equivalent to “@list ? any(@list) : undef”.<\/p>\n

none BLOCK LIST<\/small><\/i><\/p>\n

none_u BLOCK LIST<\/small><\/i><\/p>\n

Logically the negation of “any”. Returns a true value if no item in LIST<\/small> meets the criterion given through BLOCK.<\/small> Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

print “No non\u2212negative values”
if none { $_ >= 0 } ($x, $y, $z);<\/p>\n

For an empty LIST,<\/small> “none” returns true (i.e. no values failed the condition) and “none_u” returns “undef”.<\/p>\n

Thus, “none_u(@list)” is equivalent to “@list ? none(@list) : undef”.<\/p>\n

Note<\/b>: because Perl treats “undef” as false, you must check the return value of “none_u” with “defined” or you will get the opposite result of what you expect.<\/p>\n

notall BLOCK LIST<\/small><\/i><\/p>\n

notall_u BLOCK LIST<\/small><\/i><\/p>\n

Logically the negation of “all”. Returns a true value if not all items in LIST<\/small> meet the criterion given through BLOCK.<\/small> Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

print “Not all values are non\u2212negative”
if notall { $_ >= 0 } ($x, $y, $z);<\/p>\n

For an empty LIST,<\/small> “notall” returns false and “notall_u” returns “undef”.<\/p>\n

Thus, “notall_u(@list)” is equivalent to “@list ? notall(@list) : undef”.<\/p>\n

one BLOCK LIST<\/small><\/i><\/p>\n

one_u BLOCK LIST<\/small><\/i><\/p>\n

Returns a true value if precisely one item in LIST<\/small> meets the criterion given through BLOCK.<\/small> Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

print “Precisely one value defined”
if one { defined($_) } @list;<\/p>\n

Returns false otherwise.<\/p>\n

For an empty LIST,<\/small> “one” returns false and “one_u” returns “undef”.<\/p>\n

The expression “one BLOCK LIST” is almost equivalent to “1 == true BLOCK LIST”, except for short-cutting. Evaluation of BLOCK<\/small> will immediately stop at the second true value.<\/p>\n

Transformation<\/b>
apply BLOCK LIST<\/small><\/i><\/p>\n

Applies BLOCK<\/small> to each item in LIST<\/small> and returns a list of the values after BLOCK<\/small> has been applied. In scalar context, the last element is returned. This function is similar to “map” but will not modify the elements of the input list:<\/p>\n

my @list = (1 .. 4);
my @mult = apply { $_ *= 2 } @list;
print “@list = @listn”;
print “@mult = @multn”;
__END__
@list = 1 2 3 4
@mult = 2 4 6 8<\/p>\n

Think of it as syntactic sugar for<\/p>\n

for (my @mult = @list) { $_ *= 2 }<\/p>\n

insert_after BLOCK VALUE LIST<\/small><\/i><\/p>\n

Inserts VALUE<\/small> after the first item in LIST<\/small> for which the criterion in BLOCK<\/small> is true. Sets $_ for each item in LIST<\/small> in turn.<\/p>\n

my @list = qw\/This is a list\/;
insert_after { $_ eq “a” } “longer” => @list;
print “@list”;
__END__
This is a longer list<\/p>\n

insert_after_string STRING VALUE LIST<\/small><\/i><\/p>\n

Inserts VALUE<\/small> after the first item in LIST<\/small> which is equal to STRING.<\/small><\/p>\n

my @list = qw\/This is a list\/;
insert_after_string “a”, “longer” => @list;
print “@list”;
__END__
This is a longer list<\/p>\n

pairwise BLOCK ARRAY1 ARRAY2<\/small><\/i><\/p>\n

Evaluates BLOCK<\/small> for each pair of elements in ARRAY1<\/small> and ARRAY2<\/small> and returns a new list consisting of BLOCK<\/small> \u2019s return values. The two elements are set to $a and $b. Note that those two are aliases to the original value so changing them will modify the input arrays.<\/p>\n

@a = (1 .. 5);
@b = (11 .. 15);
@x = pairwise { $a + $b } @a, @b; # returns 12, 14, 16, 18, 20
# mesh with pairwise
@a = qw\/a b c\/;
@b = qw\/1 2 3\/;
@x = pairwise { ($a, $b) } @a, @b; # returns a, 1, b, 2, c, 3<\/p>\n

mesh ARRAY1 ARRAY2<\/small> [ ARRAY3 …<\/small> ]<\/i><\/p>\n

zip ARRAY1 ARRAY2<\/small> [ ARRAY3 …<\/small> ]<\/i><\/p>\n

Returns a list consisting of the first elements of each array, then the second, then the third, etc, until all arrays are exhausted.<\/p>\n

Examples:<\/p>\n

@x = qw\/a b c d\/;
@y = qw\/1 2 3 4\/;
@z = mesh @x, @y; # returns a, 1, b, 2, c, 3, d, 4
@a = (‘x’);
@b = (‘1’, ‘2’);
@c = qw\/zip zap zot\/;
@d = mesh @a, @b, @c; # x, 1, zip, undef, 2, zap, undef, undef, zot<\/p>\n

“zip” is an alias for “mesh”.<\/p>\n

zip6<\/i><\/p>\n

zip_unflatten<\/i><\/p>\n

Returns a list of arrays consisting of the first elements of each array, then the second, then the third, etc, until all arrays are exhausted.<\/p>\n

@x = qw\/a b c d\/;
@y = qw\/1 2 3 4\/;
@z = zip6 @x, @y; # returns [a, 1], [b, 2], [c, 3], [d, 4]
@a = (‘x’);
@b = (‘1’, ‘2’);
@c = qw\/zip zap zot\/;
@d = zip6 @a, @b, @c; # [x, 1, zip], [undef, 2, zap], [undef, undef, zot]<\/p>\n

“zip_unflatten” is an alias for “zip6”.<\/p>\n

listcmp ARRAY0 ARRAY1<\/small> [ ARRAY2 …<\/small> ]<\/i><\/p>\n

Returns an associative list of elements and every id<\/i> of the list it was found in. Allows easy implementation of @a & @b, @a | @b, @a ^ @b and so on. Undefined entries in any given array are skipped.<\/p>\n

my @a = qw(one two three four five six seven eight nine ten eleven twelve thirteen);
my @b = qw(two three five seven eleven thirteen seventeen);
my @c = qw(one one two three five eight thirteen twentyone);
my %cmp = listcmp @a, @b, @c; # returns (one => [0, 2], two => [0, 1, 2], three => [0, 1, 2], four => [0], …)
my @seq = (1, 2, 3);
my @prim = (undef, 2, 3, 5);
my @fib = (1, 1, 2);
my %cmp = listcmp @seq, @prim, @fib;
# returns ( 1 => [0, 2], 2 => [0, 1, 2], 3 => [0, 1], 5 => [1] )<\/p>\n

arrayify LIST[,LIST[,LIST…]]<\/i><\/p>\n

Returns a list consisting of each element of given arrays. Recursive arrays are flattened, too.<\/p>\n

@a = (1, [[2], 3], 4, [5], 6, [7], 8, 9);
@l = arrayify @a; # returns 1, 2, 3, 4, 5, 6, 7, 8, 9<\/p>\n

uniq LIST<\/small><\/i><\/p>\n

distinct LIST<\/small><\/i><\/p>\n

Returns a new list by stripping duplicate values in LIST<\/small> by comparing the values as hash keys, except that undef is considered separate from \u2019\u2019. The order of elements in the returned list is the same as in LIST.<\/small> In scalar context, returns the number of unique elements in LIST.<\/small><\/p>\n

my @x = uniq 1, 1, 2, 2, 3, 5, 3, 4; # returns 1 2 3 5 4
my $x = uniq 1, 1, 2, 2, 3, 5, 3, 4; # returns 5
# returns “Mike”, “Michael”, “Richard”, “Rick”
my @n = distinct “Mike”, “Michael”, “Richard”, “Rick”, “Michael”, “Rick”
# returns “A8”, “”, undef, “A5”, “S1”
my @s = distinct “A8”, “”, undef, “A5”, “S1”, “A5”, “A8”
# returns “Giulia”, “Giulietta”, undef, “”, 156, “GTA”, “GTV”, 159, “Brera”, “4C”
my @w = uniq “Giulia”, “Giulietta”, undef, “”, 156, “GTA”, “GTV”, 159, “Brera”, “4C”, “Giulietta”, “Giulia”<\/p>\n

“distinct” is an alias for “uniq”.<\/p>\n

RT#49800<\/b> can be used to give feedback about this behavior.<\/p>\n

singleton LIST<\/small><\/i><\/p>\n

Returns a new list by stripping values in LIST<\/small> occurring more than once by comparing the values as hash keys, except that undef is considered separate from \u2019\u2019. The order of elements in the returned list is the same as in LIST.<\/small> In scalar context, returns the number of elements occurring only once in LIST.<\/small><\/p>\n

my @x = singleton 1,1,2,2,3,4,5 # returns 3 4 5<\/p>\n

duplicates LIST<\/small><\/i><\/p>\n

Returns a new list by stripping values in LIST<\/small> occurring less than twice by comparing the values as hash keys, except that undef is considered separate from \u2019\u2019. The order of elements in the returned list is the same as in LIST.<\/small> In scalar context, returns the number of elements occurring more than once in LIST.<\/small><\/p>\n

my @y = duplicates 1,1,2,4,7,2,3,4,6,9; #returns 1,2,4<\/p>\n

frequency LIST<\/small><\/i><\/p>\n

Returns an associative list of distinct values and the corresponding frequency.<\/p>\n

my @f = frequency values %radio_nrw; # returns (
# ‘Deutschlandfunk (DLF)’ => 9, ‘WDR 3’ => 10,
# ‘WDR 4’ => 11, ‘WDR 5’ => 14, ‘WDR Eins Live’ => 14,
# ‘Deutschlandradio Kultur’ => 8,…)<\/p>\n

occurrences LIST<\/small><\/i><\/p>\n

Returns a new list of frequencies and the corresponding values from LIST.<\/small><\/p>\n

my @o = occurrences ((1) x 3, (2) x 4, (3) x 2, (4) x 7, (5) x 2, (6) x 4);
# @o = (undef, undef, [3, 5], [1], [2, 6], undef, undef, [4]);<\/p>\n

mode LIST<\/small><\/i><\/p>\n

Returns the modal value of LIST.<\/small> In scalar context, just the modal value is returned, in list context all probes occurring modal<\/i> times are returned, too.<\/p>\n

my @m = mode ((1) x 3, (2) x 4, (3) x 2, (4) x 7, (5) x 2, (6) x 4, (7) x 3, (8) x 7);
# @m = (7, 4, 8) \u2212 bimodal LIST<\/p>\n

slide BLOCK LIST<\/small><\/i><\/p>\n

The function “slide” operates on pairs of list elements like:<\/p>\n

my @s = slide { “$a and $b” } (0..3);
# @s = (“0 and 1”, “1 and 2”, “2 and 3”)<\/p>\n

The idea behind this function is a kind of magnifying glass that is moved along a list and calls “BLOCK” every time the next list item is reached.<\/p>\n

Partitioning<\/b>
after BLOCK LIST<\/small><\/i><\/p>\n

Returns a list of the values of LIST<\/small> after (and not including) the point where BLOCK<\/small> returns a true value. Sets $_ for each element in LIST<\/small> in turn.<\/p>\n

@x = after { $_ % 5 == 0 } (1..9); # returns 6, 7, 8, 9<\/p>\n

after_incl BLOCK LIST<\/small><\/i><\/p>\n

Same as “after” but also includes the element for which BLOCK<\/small> is true.<\/p>\n

before BLOCK LIST<\/small><\/i><\/p>\n

Returns a list of values of LIST<\/small> up to (and not including) the point where BLOCK<\/small> returns a true value. Sets $_ for each element in LIST<\/small> in turn.<\/p>\n

before_incl BLOCK LIST<\/small><\/i><\/p>\n

Same as “before” but also includes the element for which BLOCK<\/small> is true.<\/p>\n

part BLOCK LIST<\/small><\/i><\/p>\n

Partitions LIST<\/small> based on the return value of BLOCK<\/small> which denotes into which partition the current value is put.<\/p>\n

Returns a list of the partitions thusly created. Each partition created is a reference to an array.<\/p>\n

my $i = 0;
my @part = part { $i++ % 2 } 1 .. 8; # returns [1, 3, 5, 7], [2, 4, 6, 8]<\/p>\n

You can have a sparse list of partitions as well where non-set partitions will be undef:<\/p>\n

my @part = part { 2 } 1 .. 10; # returns undef, undef, [ 1 .. 10 ]<\/p>\n

Be careful with negative values, though:<\/p>\n

my @part = part { \u22121 } 1 .. 10;
__END__
Modification of non\u2212creatable array value attempted, subscript \u22121 …<\/p>\n

Negative values are only ok when they refer to a partition previously created:<\/p>\n

my @idx = ( 0, 1, \u22121 );
my $i = 0;
my @part = part { $idx[$i++ % 3] } 1 .. 8; # [1, 4, 7], [2, 3, 5, 6, 8]<\/p>\n

samples COUNT LIST<\/small><\/i><\/p>\n

Returns a new list containing COUNT<\/small> random samples from LIST.<\/small> Is similar to “shuffle” in List::Util, but stops after COUNT.<\/small><\/p>\n

@r = samples 10, 1..10; # same as shuffle
@r2 = samples 5, 1..10; # gives 5 values from 1..10;<\/p>\n

Iteration<\/b>
each_array ARRAY1 ARRAY2 …<\/small><\/i><\/p>\n

Creates an array iterator to return the elements of the list of arrays ARRAY1, ARRAY2<\/small> throughout ARRAYn in turn. That is, the first time it is called, it returns the first element of each array. The next time, it returns the second elements. And so on, until all elements are exhausted.<\/p>\n

This is useful for looping over more than one array at once:<\/p>\n

my $ea = each_array(@a, @b, @c);
while ( my ($a, $b, $c) = $ea\u2212>() ) { …. }<\/p>\n

The iterator returns the empty list when it reached the end of all arrays.<\/p>\n

If the iterator is passed an argument of \u2019”index”\u2019, then it returns the index of the last fetched set of values, as a scalar.<\/p>\n

each_arrayref LIST<\/small><\/i><\/p>\n

Like each_array, but the arguments are references to arrays, not the plain arrays.<\/p>\n

natatime EXPR, LIST<\/small><\/i><\/p>\n

Creates an array iterator, for looping over an array in chunks of $n items at a time. (n at a time, get it?). An example is probably a better explanation than I could give in words.<\/p>\n

Example:<\/p>\n

my @x = (‘a’ .. ‘g’);
my $it = natatime 3, @x;
while (my @vals = $it\u2212>())
{
print “@valsn”;
}<\/p>\n

This prints<\/p>\n

a b c
d e f
g<\/p>\n

slideatatime STEP, WINDOW, LIST<\/small><\/i><\/p>\n

Creates an array iterator, for looping over an array in chunks of “$windows\u2212size” items at a time.<\/p>\n

The idea behind this function is a kind of magnifying glass (finer controllable compared to “slide”) that is moved along a list.<\/p>\n

Example:<\/p>\n

my @x = (‘a’ .. ‘g’);
my $it = slideatatime 2, 3, @x;
while (my @vals = $it\u2212>())
{
print “@valsn”;
}<\/p>\n

This prints<\/p>\n

a b c
c d e
e f g
g<\/p>\n

Searching<\/b>
firstval BLOCK LIST<\/small><\/i><\/p>\n

first_value BLOCK LIST<\/small><\/i><\/p>\n

Returns the first element in LIST<\/small> for which BLOCK<\/small> evaluates to true. Each element of LIST<\/small> is set to $_ in turn. Returns “undef” if no such element has been found.<\/p>\n

“first_value” is an alias for “firstval”.<\/p>\n

onlyval BLOCK LIST<\/small><\/i><\/p>\n

only_value BLOCK LIST<\/small><\/i><\/p>\n

Returns the only element in LIST<\/small> for which BLOCK<\/small> evaluates to true. Sets $_ for each item in LIST<\/small> in turn. Returns “undef” if no such element has been found.<\/p>\n

“only_value” is an alias for “onlyval”.<\/p>\n

lastval BLOCK LIST<\/small><\/i><\/p>\n

last_value BLOCK LIST<\/small><\/i><\/p>\n

Returns the last value in LIST<\/small> for which BLOCK<\/small> evaluates to true. Each element of LIST<\/small> is set to $_ in turn. Returns “undef” if no such element has been found.<\/p>\n

“last_value” is an alias for “lastval”.<\/p>\n

firstres BLOCK LIST<\/small><\/i><\/p>\n

first_result BLOCK LIST<\/small><\/i><\/p>\n

Returns the result of BLOCK<\/small> for the first element in LIST<\/small> for which BLOCK<\/small> evaluates to true. Each element of LIST<\/small> is set to $_ in turn. Returns “undef” if no such element has been found.<\/p>\n

“first_result” is an alias for “firstres”.<\/p>\n

onlyres BLOCK LIST<\/small><\/i><\/p>\n

only_result BLOCK LIST<\/small><\/i><\/p>\n

Returns the result of BLOCK<\/small> for the first element in LIST<\/small> for which BLOCK<\/small> evaluates to true. Sets $_ for each item in LIST<\/small> in turn. Returns “undef” if no such element has been found.<\/p>\n

“only_result” is an alias for “onlyres”.<\/p>\n

lastres BLOCK LIST<\/small><\/i><\/p>\n

last_result BLOCK LIST<\/small><\/i><\/p>\n

Returns the result of BLOCK<\/small> for the last element in LIST<\/small> for which BLOCK<\/small> evaluates to true. Each element of LIST<\/small> is set to $_ in turn. Returns “undef” if no such element has been found.<\/p>\n

“last_result” is an alias for “lastres”.<\/p>\n

indexes BLOCK LIST<\/small><\/i><\/p>\n

Evaluates BLOCK<\/small> for each element in LIST<\/small> (assigned to $_) and returns a list of the indices of those elements for which BLOCK<\/small> returned a true value. This is just like “grep” only that it returns indices instead of values:<\/p>\n

@x = indexes { $_ % 2 == 0 } (1..10); # returns 1, 3, 5, 7, 9<\/p>\n

firstidx BLOCK LIST<\/small><\/i><\/p>\n

first_index BLOCK LIST<\/small><\/i><\/p>\n

Returns the index of the first element in LIST<\/small> for which the criterion in BLOCK<\/small> is true. Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

my @list = (1, 4, 3, 2, 4, 6);
printf “item with index %i in list is 4”, firstidx { $_ == 4 } @list;
__END__
item with index 1 in list is 4<\/p>\n

Returns “\u22121” if no such item could be found.<\/p>\n

“first_index” is an alias for “firstidx”.<\/p>\n

onlyidx BLOCK LIST<\/small><\/i><\/p>\n

only_index BLOCK LIST<\/small><\/i><\/p>\n

Returns the index of the only element in LIST<\/small> for which the criterion in BLOCK<\/small> is true. Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

my @list = (1, 3, 4, 3, 2, 4);
printf “uniqe index of item 2 in list is %i”, onlyidx { $_ == 2 } @list;
__END__
unique index of item 2 in list is 4<\/p>\n

Returns “\u22121” if either no such item or more than one of these has been found.<\/p>\n

“only_index” is an alias for “onlyidx”.<\/p>\n

lastidx BLOCK LIST<\/small><\/i><\/p>\n

last_index BLOCK LIST<\/small><\/i><\/p>\n

Returns the index of the last element in LIST<\/small> for which the criterion in BLOCK<\/small> is true. Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

my @list = (1, 4, 3, 2, 4, 6);
printf “item with index %i in list is 4”, lastidx { $_ == 4 } @list;
__END__
item with index 4 in list is 4<\/p>\n

Returns “\u22121” if no such item could be found.<\/p>\n

“last_index” is an alias for “lastidx”.<\/p>\n

Sorting<\/b>
sort_by BLOCK LIST<\/small><\/i><\/p>\n

Returns the list of values sorted according to the string values returned by the KEYFUNC<\/small> block or function. A typical use of this may be to sort objects according to the string value of some accessor, such as<\/p>\n

sort_by { $_\u2212>name } @people<\/p>\n

The key function is called in scalar context, being passed each value in turn as both $_ and the only argument in the parameters, @_. The values are then sorted according to string comparisons on the values returned. This is equivalent to<\/p>\n

sort { $a\u2212>name cmp $b\u2212>name } @people<\/p>\n

except that it guarantees the name accessor will be executed only once per value. One interesting use-case is to sort strings which may have numbers embedded in them “naturally”, rather than lexically.<\/p>\n

sort_by { s\/(d+)\/sprintf “%09d”, $1\/eg; $_ } @strings<\/p>\n

This sorts strings by generating sort keys which zero-pad the embedded numbers to some level (9 digits in this case), helping to ensure the lexical sort puts them in the correct order.<\/p>\n

nsort_by BLOCK LIST<\/small><\/i><\/p>\n

Similar to sort_by but compares its key values numerically.<\/p>\n

qsort BLOCK ARRAY<\/small><\/i><\/p>\n

This sorts the given array in place<\/b> using the given compare code. Except for tiny compare code like “$a <=> $b”, qsort is much faster than Perl\u2019s “sort” depending on the version.<\/p>\n

Compared 5.8 and 5.26:<\/p>\n

my @rl;
for(my $i = 0; $i < 1E6; ++$i) { push @rl, rand(1E5) }
my $idx;
sub ext_cmp { $_[0] <=> $_[1] }
cmpthese( \u221260, {
‘qsort’ => sub {
my @qrl = @rl;
qsort { ext_cmp($a, $b) } @qrl;
$idx = bsearchidx { ext_cmp($_, $rl[0]) } @qrl
},
‘reverse qsort’ => sub {
my @qrl = @rl;
qsort { ext_cmp($b, $a) } @qrl;
$idx = bsearchidx { ext_cmp($rl[0], $_) } @qrl
},
‘sort’ => sub {
my @srl = @rl;
@srl = sort { ext_cmp($a, $b) } @srl;
$idx = bsearchidx { ext_cmp($_, $rl[0]) } @srl
},
‘reverse sort’ => sub {
my @srl = @rl;
@srl = sort { ext_cmp($b, $a) } @srl;
$idx = bsearchidx { ext_cmp($rl[0], $_) } @srl
},
});<\/p>\n

5.8 results<\/p>\n

s\/iter reverse sort sort reverse qsort qsort
reverse sort 6.21 \u2212\u2212 \u22120% \u22128% \u221210%
sort 6.19 0% \u2212\u2212 \u22127% \u221210%
reverse qsort 5.73 8% 8% \u2212\u2212 \u22122%
qsort 5.60 11% 11% 2% \u2212\u2212<\/p>\n

5.26 results<\/p>\n

s\/iter reverse sort sort reverse qsort qsort
reverse sort 4.54 \u2212\u2212 \u22120% \u221296% \u221296%
sort 4.52 0% \u2212\u2212 \u221296% \u221296%
reverse qsort 0.203 2139% 2131% \u2212\u2212 \u221219%
qsort 0.164 2666% 2656% 24% \u2212\u2212<\/p>\n

Use it where external data sources might have to be compared (think of Unix::Statgrab “tables”).<\/p>\n

“qsort” is available from List::MoreUtils::XS only. It\u2019s insane to maintain a wrapper around Perl\u2019s sort nor having a pure Perl implementation. One could create a flip-book in same speed as PP<\/small> runs a qsort.<\/p>\n

Searching in sorted Lists<\/b>
bsearch BLOCK LIST<\/small><\/i><\/p>\n

Performs a binary search on LIST<\/small> which must be a sorted list of values. BLOCK<\/small> must return a negative value if the current element (stored in $_) is smaller, a positive value if it is bigger and zero if it matches.<\/p>\n

Returns a boolean value in scalar context. In list context, it returns the element if it was found, otherwise the empty list.<\/p>\n

bsearchidx BLOCK LIST<\/small><\/i><\/p>\n

bsearch_index BLOCK LIST<\/small><\/i><\/p>\n

Performs a binary search on LIST<\/small> which must be a sorted list of values. BLOCK<\/small> must return a negative value if the current element (stored in $_) is smaller, a positive value if it is bigger and zero if it matches.<\/p>\n

Returns the index of found element, otherwise “\u22121”.<\/p>\n

“bsearch_index” is an alias for “bsearchidx”.<\/p>\n

lower_bound BLOCK LIST<\/small><\/i><\/p>\n

Returns the index of the first element in LIST<\/small> which does not compare less than val<\/i>. Technically it\u2019s the first element in LIST<\/small> which does not return a value below zero when passed to BLOCK.<\/small><\/p>\n

@ids = (1, 1, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 6, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 11, 13, 13, 13, 17);
$lb = lower_bound { $_ <=> 2 } @ids; # returns 2
$lb = lower_bound { $_ <=> 4 } @ids; # returns 10<\/p>\n

lower_bound has a complexity of O(log n).<\/p>\n

upper_bound BLOCK LIST<\/small><\/i><\/p>\n

Returns the index of the first element in LIST<\/small> which does not compare greater than val<\/i>. Technically it\u2019s the first element in LIST<\/small> which does not return a value below or equal to zero when passed to BLOCK.<\/small><\/p>\n

@ids = (1, 1, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 6, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 11, 13, 13, 13, 17);
$lb = upper_bound { $_ <=> 2 } @ids; # returns 4
$lb = upper_bound { $_ <=> 4 } @ids; # returns 14<\/p>\n

upper_bound has a complexity of O(log n).<\/p>\n

equal_range BLOCK LIST<\/small><\/i><\/p>\n

Returns a pair of indices containing the lower_bound and the upper_bound.<\/p>\n

Operations on sorted Lists<\/b>
binsert BLOCK ITEM LIST<\/small><\/i><\/p>\n

bsearch_insert BLOCK ITEM LIST<\/small><\/i><\/p>\n

Performs a binary search on LIST<\/small> which must be a sorted list of values. BLOCK<\/small> must return a negative value if the current element (stored in $_) is smaller, a positive value if it is bigger and zero if it matches.<\/p>\n

ITEM<\/small> is inserted at the index where the ITEM<\/small> should be placed (based on above search). That means, it\u2019s inserted before the next bigger element.<\/p>\n

@l = (2,3,5,7);
binsert { $_ <=> 4 } 4, @l; # @l = (2,3,4,5,7)
binsert { $_ <=> 6 } 42, @l; # @l = (2,3,4,42,7)<\/p>\n

You take care that the inserted element matches the compare result.<\/p>\n

bremove BLOCK LIST<\/small><\/i><\/p>\n

bsearch_remove BLOCK LIST<\/small><\/i><\/p>\n

Performs a binary search on LIST<\/small> which must be a sorted list of values. BLOCK<\/small> must return a negative value if the current element (stored in $_) is smaller, a positive value if it is bigger and zero if it matches.<\/p>\n

The item at the found position is removed and returned.<\/p>\n

@l = (2,3,4,5,7);
bremove { $_ <=> 4 }, @l; # @l = (2,3,5,7);<\/p>\n

Counting and calculation<\/b>
true BLOCK LIST<\/small><\/i><\/p>\n

Counts the number of elements in LIST<\/small> for which the criterion in BLOCK<\/small> is true. Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

printf “%i item(s) are defined”, true { defined($_) } @list;<\/p>\n

false BLOCK LIST<\/small><\/i><\/p>\n

Counts the number of elements in LIST<\/small> for which the criterion in BLOCK<\/small> is false. Sets $_ for each item in LIST<\/small> in turn:<\/p>\n

printf “%i item(s) are not defined”, false { defined($_) } @list;<\/p>\n

reduce_0 BLOCK LIST<\/small><\/i><\/p>\n

Reduce LIST<\/small> by calling BLOCK<\/small> in scalar context for each element of LIST.<\/small> $a contains the progressional result and is initialized with 0. $b contains the current processed element of LIST<\/small> and $_ contains the index of the element in $b.<\/p>\n

The idea behind reduce_0 is summation<\/b> (addition of a sequence of numbers).<\/p>\n

reduce_1 BLOCK LIST<\/small><\/i><\/p>\n

Reduce LIST<\/small> by calling BLOCK<\/small> in scalar context for each element of LIST.<\/small> $a contains the progressional result and is initialized with 1. $b contains the current processed element of LIST<\/small> and $_ contains the index of the element in $b.<\/p>\n

The idea behind reduce_1 is product of a sequence of numbers.<\/p>\n

reduce_u BLOCK LIST<\/small><\/i><\/p>\n

Reduce LIST<\/small> by calling BLOCK<\/small> in scalar context for each element of LIST.<\/small> $a contains the progressional result and is uninitialized. $b contains the current processed element of LIST<\/small> and $_ contains the index of the element in $b.<\/p>\n

This function has been added if one might need the extra of the index value but need an individual initialization.<\/p>\n

Use with caution<\/b>: In most cases “reduce” in List::Util will do the job better.<\/p>\n

minmax LIST<\/small><\/i><\/p>\n

Calculates the minimum and maximum of LIST<\/small> and returns a two element list with the first element being the minimum and the second the maximum. Returns the empty list if LIST<\/small> was empty.<\/p>\n

The “minmax” algorithm differs from a naive iteration over the list where each element is compared to two values being the so far calculated min and max value in that it only requires 3n\/2 \u2212 2 comparisons. Thus it is the most efficient possible algorithm.<\/p>\n

However, the Perl implementation of it has some overhead simply due to the fact that there are more lines of Perl code involved. Therefore, LIST<\/small> needs to be fairly big in order for “minmax” to win over a naive implementation. This limitation does not apply to the XS<\/small> version.<\/p>\n

minmaxstr LIST<\/small><\/i><\/p>\n

Computes the minimum and maximum of LIST<\/small> using string compare and returns a two element list with the first element being the minimum and the second the maximum. Returns the empty list if LIST<\/small> was empty.<\/p>\n

The implementation is similar to “minmax”.<\/p>\n

ENVIRONMENT <\/a> <\/h2>\n

When “LIST_MOREUTILS_PP” is set, the module will always use the pure-Perl implementation and not the XS<\/small> one. This environment variable is really just there for the test-suite to force testing the Perl implementation, and possibly for reporting of bugs. I don\u2019t see any reason to use it in a production environment.<\/p>\n

MAINTENANCE <\/a> <\/h2>\n

The maintenance goal is to preserve the documented semantics of the API<\/small> ; bug fixes that bring actual behavior in line with semantics are allowed. New API<\/small> functions may be added over time. If a backwards incompatible change is unavoidable, we will attempt to provide support for the legacy API<\/small> using the same export tag mechanism currently in place.<\/p>\n

This module attempts to use few non-core dependencies. Non-core configuration and testing modules will be bundled when reasonable; run-time dependencies will be added only if they deliver substantial benefit.<\/p>\n

CONTRIBUTING <\/a> <\/h2>\n

While contributions are appreciated, a contribution should not cause more effort for the maintainer than the contribution itself saves (see Open Source Contribution Etiquette ).<\/p>\n

To get more familiar where help could be needed \u2212 see List::MoreUtils::Contributing.<\/p>\n

BUGS <\/a> <\/h2>\n

There is a problem with a bug in 5.6.x perls. It is a syntax error to write things like:<\/p>\n

my @x = apply { s\/foo\/bar\/ } qw{ foo bar baz };<\/p>\n

It has to be written as either<\/p>\n

my @x = apply { s\/foo\/bar\/ } ‘foo’, ‘bar’, ‘baz’;<\/p>\n

or<\/p>\n

my @x = apply { s\/foo\/bar\/ } my @dummy = qw\/foo bar baz\/;<\/p>\n

Perl 5.5.x and Perl 5.8.x don\u2019t suffer from this limitation.<\/p>\n

If you have a functionality that you could imagine being in this module, please drop me a line. This module\u2019s policy will be less strict than List::Util\u2019s when it comes to additions as it isn\u2019t a core module.<\/p>\n

When you report bugs, it would be nice if you could additionally give me the output of your program with the environment variable “LIST_MOREUTILS_PP” set to a true value. That way I know where to look for the problem (in XS,<\/small> pure-Perl or possibly both).<\/p>\n

SUPPORT <\/a> <\/h2>\n

Bugs should always be submitted via the CPAN<\/small> bug tracker.<\/p>\n

You can find documentation for this module with the perldoc command.<\/p>\n

perldoc List::MoreUtils<\/p>\n

You can also look for information at:<\/p>\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

RT: CPAN<\/small> \u2019s request tracker<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

<\/p>\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

AnnoCPAN: Annotated CPAN<\/small> documentation<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

<\/p>\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

CPAN<\/small> Ratings<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

<\/p>\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

MetaCPAN<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

<\/p>\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

CPAN<\/small> Search<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

<\/p>\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

Git Repository<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

<\/p>\n

Where can I go for help?<\/b>
If you have a bug report, a patch or a suggestion, please open a new report ticket at CPAN<\/small> (but please check previous reports first in case your issue has already been addressed) or open an issue on GitHub.<\/p>\n

Report tickets should contain a detailed description of the bug or enhancement request and at least an easily verifiable way of reproducing the issue or fix. Patches are always welcome, too \u2212 and it\u2019s cheap to send pull-requests on GitHub. Please keep in mind that code changes are more likely accepted when they\u2019re bundled with an approving test.<\/p>\n

If you think you\u2019ve found a bug then please read “How to Report Bugs Effectively” by Simon Tatham: .<\/p>\n

Where can I go for help with a concrete version?<\/b>
Bugs and feature requests are accepted against the latest version only. To get patches for earlier versions, you need to get an agreement with a developer of your choice \u2212 who may or not report the issue and a suggested fix upstream (depends on the license you have chosen).<\/p>\n

Business support and maintenance<\/b>
Generally, in volunteered projects, there is no right for support. While every maintainer is happy to improve the provided software, spare time is limited.<\/p>\n

For those who have a use case which requires guaranteed support, one of the maintainers should be hired or contracted. For business support you can contact Jens via his CPAN<\/small> email address rehsackATcpan.org. Please keep in mind that business support is neither available for free nor are you eligible to receive any support based on the license distributed with this package.<\/p>\n

THANKS <\/a> <\/h2>\n

Tassilo von Parseval<\/b>
Credits go to a number of people: Steve Purkis for giving me namespace advice and James Keenan and Terrence Branno for their effort of keeping the CPAN<\/small> tidier by making List::Utils obsolete.<\/p>\n

Brian McCauley suggested the inclusion of apply()<\/b> and provided the pure-Perl implementation for it.<\/p>\n

Eric J. Roode asked me to add all functions from his module “List::MoreUtil” into this one. With minor modifications, the pure-Perl implementations of those are by him.<\/p>\n

The bunch of people who almost immediately pointed out the many problems with the glitchy 0.07 release (Slaven Rezic, Ron Savage, CPAN<\/small> testers).<\/p>\n

A particularly nasty memory leak was spotted by Thomas A. Lowery.<\/p>\n

Lars Thegler made me aware of problems with older Perl versions.<\/p>\n

Anno Siegel de-orphaned each_arrayref()<\/b>.<\/p>\n

David Filmer made me aware of a problem in each_arrayref that could ultimately lead to a segfault.<\/p>\n

Ricardo Signes suggested the inclusion of part()<\/b> and provided the Perl-implementation.<\/p>\n

Robin Huston kindly fixed a bug in perl\u2019s MULTICALL API<\/small> to make the XS-implementation of part()<\/b> work.<\/p>\n

Jens Rehsack<\/b>
Credits goes to all people contributing feedback during the v0.400 development releases.<\/p>\n

Special thanks goes to David Golden who spent a lot of effort to develop a design to support current state of CPAN<\/small> as well as ancient software somewhere in the dark. He also contributed a lot of patches to refactor the API<\/small> frontend to welcome any user of List::MoreUtils \u2212 from ancient past to recently last used.<\/p>\n

Toby Inkster provided a lot of useful feedback for sane importer code and was a nice sounding board for API<\/small> discussions.<\/p>\n

Peter Rabbitson provided a sane git repository setup containing entire package history.<\/p>\n

TODO <\/a> <\/h2>\n

A pile of requests from other people is still pending further processing in my mailbox. This includes:<\/p>\n\n\n\n\n\n\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

delete_index<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

random_item<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

random_item_delete_index<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

list_diff_hash<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

list_diff_inboth<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

list_diff_infirst<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

list_diff_insecond<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

These were all suggested by Dan Muey.<\/p>\n\n\n
<\/td>\n\n

\u2022<\/p>\n<\/td>\n

<\/td>\n\n

listify<\/p>\n<\/td>\n

 <\/td>\n<\/tr>\n<\/table>\n

Always return a flat list when either a simple scalar value was passed or an array-reference. Suggested by Mark Summersault.<\/p>\n

SEE ALSO <\/a> <\/h2>\n

List::Util, List::AllUtils, List::UtilsBy<\/p>\n

AUTHOR <\/a> <\/h2>\n

Jens Rehsack AT<\/small> cpan.org><\/p>\n

Adam Kennedy <\/p>\n

Tassilo von Parseval <\/p>\n

COPYRIGHT AND LICENSE <\/a> <\/h2>\n

Some parts copyright 2011 Aaron Crane.<\/p>\n

Copyright 2004 \u2212 2010 by Tassilo von Parseval<\/p>\n

Copyright 2013 \u2212 2017 by Jens Rehsack<\/p>\n

All code added with 0.417 or later is licensed under the Apache License, Version 2.0 (the “License”); you may not use this file except in compliance with the License. You may obtain a copy of the License at<\/p>\n

http:\/\/www.apache.org\/licenses\/LICENSE\u22122.0<\/p>\n

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an ” AS IS” BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,<\/small> either express or implied. See the License for the specific language governing permissions and limitations under the License.<\/p>\n

All code until 0.416 is licensed under the same terms as Perl itself, either Perl version 5.8.4 or, at your option, any later version of Perl 5 you may have available.<\/p>\n

\n","protected":false},"excerpt":{"rendered":"

List::MoreUtils \u2212 Provide the stuff missing in List::Util <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[3584,3007],"class_list":["post-7259","post","type-post","status-publish","format-standard","hentry","category-sin-categoria","tag-listmoreutils","tag-man3"],"gutentor_comment":0,"_links":{"self":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/posts\/7259","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/comments?post=7259"}],"version-history":[{"count":0,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/posts\/7259\/revisions"}],"wp:attachment":[{"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/media?parent=7259"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/categories?post=7259"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lode.uno\/linux-man\/wp-json\/wp\/v2\/tags?post=7259"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}