NAME<\/a> MDK::Common::Func \u2212 miscellaneous functions<\/p>\n use MDK::Common::Func qw(:all);<\/p>\n may_apply( CODE REF, SCALAR<\/small> )<\/p>\n “may_apply($f, $v)” is “$f ? $f\u2212>($v) : $v”<\/p>\n may_apply( CODE REF, SCALAR, SCALAR<\/small> )<\/p>\n “may_apply($f, $v, $otherwise)” is “$f ? $f\u2212>($v) : $otherwise”<\/p>\n if_( BOOL, LIST<\/small> )<\/p>\n special constructs to workaround a missing perl feature: “if_($b, “a”, “b”)” is “$b ? (“a”, “b”) : ()”<\/p>\n example of use: “f(“a”, if_(arch() =~ \/i.86\/, “b”), “c”)” which is not the same as “f(“a”, arch()=~ \/i.86\/ && “b”, “c”)”<\/p>\n if__( SCALAR, LIST<\/small> )<\/p>\n if_ alike. Test if the value is defined<\/p>\n fold_left { CODE<\/small> } LIST<\/small><\/p>\n if you don\u2019t know fold_left (aka foldl), don\u2019t use it ;p<\/p>\n fold_left { $::a + $::b } 1, 3, 6<\/p>\n gives 10 (aka 1+3+6)<\/p>\n mapn { CODE<\/small> } ARRAY REF, ARRAY REF, …<\/small><\/p>\n map lists in parallel:<\/p>\n mapn { $_[0] + $_[1] } [1, 2], [2, 4] # gives 3, 6 mapn_ { CODE<\/small> } ARRAY REF, ARRAY REF, …<\/small><\/p>\n mapn alike. The difference is what to do when the lists have not the same length: mapn takes the minimum common elements, mapn_ takes the maximum list length and extend the lists with undef values<\/p>\n find { CODE<\/small> } LIST<\/small><\/p>\n returns the first element where CODE<\/small> returns true (or returns undef)<\/p>\n find { \/foo\/ } “fo”, “fob”, “foobar”, “foobir”<\/p>\n gives “foobar”<\/p>\n any { CODE<\/small> } LIST<\/small><\/p>\n returns 1 if CODE<\/small> returns true for an element in LIST<\/small> (otherwise returns 0)<\/p>\n any { \/foo\/ } “fo”, “fob”, “foobar”, “foobir”<\/p>\n gives 1<\/p>\n every { CODE<\/small> } LIST<\/small><\/p>\n returns 1 if CODE<\/small> returns true for every<\/b> element in LIST<\/small> (otherwise returns 0)<\/p>\n every { \/foo\/ } “fo”, “fob”, “foobar”, “foobir”<\/p>\n gives 0<\/p>\n map_index { CODE<\/small> } LIST<\/small><\/p>\n just like “map”, but set $::i to the current index in the list:<\/p>\n map_index { “$::i $_” } “a”, “b”<\/p>\n gives “0 a”, “1 b”<\/p>\n each_index { CODE<\/small> } LIST<\/small><\/p>\n just like “map_index”, but doesn\u2019t return anything<\/p>\n each_index { print “$::i $_n” } “a”, “b”<\/p>\n prints “0 a”, “1 b”<\/p>\n grep_index { CODE<\/small> } LIST<\/small><\/p>\n just like “grep”, but set $::i to the current index in the list:<\/p>\n grep_index { $::i == $_ } 0, 2, 2, 3<\/p>\n gives (0, 2, 3)<\/p>\n find_index { CODE<\/small> } LIST<\/small><\/p>\n returns the index of the first element where CODE<\/small> returns true (or throws an exception)<\/p>\n find_index { \/foo\/ } “fo”, “fob”, “foobar”, “foobir”<\/p>\n gives 2<\/p>\n map_each { CODE<\/small> } HASH<\/small><\/p>\n returns the list of results of CODE<\/small> applied with $::a (key) and $::b (value)<\/p>\n map_each { “$::a is $::b” } 1=>2, 3=>4<\/p>\n gives “1 is 2”, “3 is 4”<\/p>\n grep_each { CODE<\/small> } HASH<\/small><\/p>\n returns the hash key\/value for which CODE<\/small> applied with $::a (key) and $::b (value) is true:<\/p>\n grep_each { $::b == 2 } 1=>2, 3=>4, 4=>2<\/p>\n gives 1=>2, 4=>2<\/p>\n partition { CODE<\/small> } LIST<\/small><\/p>\n alike “grep”, but returns both the list of matching elements and non matching elements<\/p>\n my ($greater, $lower) = partition { $_ > 3 } 4, 2, 8, 0, 1<\/p>\n gives $greater = [ 4, 8 ] and $lower = [ 2, 0, 1 ]<\/p>\n before_leaving { CODE<\/small> }<\/p>\n the code will be executed when the current block is finished<\/p>\n # create $tmp_file cdie( SCALAR<\/small> )<\/p>\n aka conditional die<\/i>. If a “cdie” is catched, the execution continues after<\/b> the cdie, not where it was catched (as happens with die & eval)<\/p>\n If a “cdie” is not catched, it mutates in real exception that can be catched with “eval”<\/p>\n cdie is useful when you want to warn about something weird, but when you can go on. In that case, you cdie “something weird happened”, and the caller decide wether to go on or not. Especially nice for libraries.<\/p>\n catch_cdie { CODE1<\/small> } sub { CODE2<\/small> }<\/p>\n
SYNOPSIS<\/a>
EXPORTS<\/a>
SEE ALSO<\/a> <\/p>\n
\nNAME <\/a> <\/h2>\n
SYNOPSIS <\/a> <\/h2>\n
EXPORTS <\/a> <\/h2>\n
mapn { $_[0] + $_[1] + $_[2] } [1, 2], [2, 4], [3, 6] gives 6, 12<\/p>\n
my $b = before_leaving { unlink $tmp_file };
# some code that may throw an exception, the “before_leaving” ensures the
# $tmp_file will be removed<\/p>\n