.\" Automatically generated by Pod::Man 2.28 (Pod::Simple 3.28) .\" .\" Standard preamble: .\" ======================================================================== .de Sp \" Vertical space (when we can't use .PP) .if t .sp .5v .if n .sp .. .de Vb \" Begin verbatim text .ft CW .nf .ne \\$1 .. .de Ve \" End verbatim text .ft R .fi .. .\" Set up some character translations and predefined strings. \*(-- will .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left .\" double quote, and \*(R" will give a right double quote. \*(C+ will .\" give a nicer C++. Capital omega is used to do unbreakable dashes and .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff, .\" nothing in troff, for use with C<>. .tr \(*W- .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p' .ie n \{\ . ds -- \(*W- . ds PI pi . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch . ds L" "" . ds R" "" . ds C` "" . ds C' "" 'br\} .el\{\ . ds -- \|\(em\| . ds PI \(*p . ds L" `` . ds R" '' . ds C` . ds C' 'br\} .\" .\" Escape single quotes in literal strings from groff's Unicode transform. .ie \n(.g .ds Aq \(aq .el .ds Aq ' .\" .\" If the F register is turned on, we'll generate index entries on stderr for .\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index .\" entries marked with X<> in POD. Of course, you'll have to process the .\" output yourself in some meaningful fashion. .\" .\" Avoid warning from groff about undefined register 'F'. .de IX .. .nr rF 0 .if \n(.g .if rF .nr rF 1 .if (\n(rF:(\n(.g==0)) \{ . if \nF \{ . de IX . tm Index:\\$1\t\\n%\t"\\$2" .. . if !\nF==2 \{ . nr % 0 . nr F 2 . \} . \} .\} .rr rF .\" .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2). .\" Fear. Run. Save yourself. No user-serviceable parts. . \" fudge factors for nroff and troff .if n \{\ . ds #H 0 . ds #V .8m . ds #F .3m . ds #[ \f1 . ds #] \fP .\} .if t \{\ . ds #H ((1u-(\\\\n(.fu%2u))*.13m) . ds #V .6m . ds #F 0 . ds #[ \& . ds #] \& .\} . \" simple accents for nroff and troff .if n \{\ . ds ' \& . ds ` \& . ds ^ \& . ds , \& . ds ~ ~ . ds / .\} .if t \{\ . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u" . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u' . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u' . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u' . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u' . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u' .\} . \" troff and (daisy-wheel) nroff accents .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V' .ds 8 \h'\*(#H'\(*b\h'-\*(#H' .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#] .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H' .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u' .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#] .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#] .ds ae a\h'-(\w'a'u*4/10)'e .ds Ae A\h'-(\w'A'u*4/10)'E . \" corrections for vroff .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u' .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u' . \" for low resolution devices (crt and lpr) .if \n(.H>23 .if \n(.V>19 \ \{\ . ds : e . ds 8 ss . ds o a . ds d- d\h'-1'\(ga . ds D- D\h'-1'\(hy . ds th \o'bp' . ds Th \o'LP' . ds ae ae . ds Ae AE .\} .rm #[ #] #H #V #F C .\" ======================================================================== .\" .IX Title "SHARYANTO::List::Util 3pm" .TH SHARYANTO::List::Util 3pm "2015-09-04" "perl v5.20.2" "User Contributed Perl Documentation" .\" For nroff, turn off justification. Always turn off hyphenation; it makes .\" way too many mistakes in technical documents. .if n .ad l .nh .SH "NAME" SHARYANTO::List::Util \- List utilities .SH "VERSION" .IX Header "VERSION" This document describes version 0.77 of SHARYANTO::List::Util (from Perl distribution SHARYANTO-Utils), released on 2015\-09\-04. .SH "FUNCTIONS" .IX Header "FUNCTIONS" Not exported by default but exportable. .SS "uniq_adj(@list) => \s-1LIST\s0" .IX Subsection "uniq_adj(@list) => LIST" Remove \fIadjacent\fR duplicates from list, i.e. behave more like Unix utility's \&\fBuniq\fR instead of List::MoreUtils's \f(CW\*(C`uniq\*(C'\fR function, e.g. .PP .Vb 1 \& my @res = uniq(1, 4, 4, 3, 1, 1, 2); # 1, 4, 3, 1, 2 .Ve .SS "uniq_adj_ci(@list) => \s-1LIST\s0" .IX Subsection "uniq_adj_ci(@list) => LIST" Like \f(CW\*(C`uniq_adj\*(C'\fR except case-insensitive. .SS "uniq_ci(@list) => \s-1LIST\s0" .IX Subsection "uniq_ci(@list) => LIST" Like \f(CW\*(C`List::MoreUtils\*(C'\fR' \f(CW\*(C`uniq\*(C'\fR except case-insensitive. .SS "find_missing_nums_in_seq(\s-1LIST\s0) => \s-1LIST\s0" .IX Subsection "find_missing_nums_in_seq(LIST) => LIST" Given a list of integers, return number(s) missing in the sequence, e.g.: .PP .Vb 1 \& find_missing_nums_in_seq(1, 2, 3, 4, 7, 8); # (5, 6) .Ve .SS "find_missing_strs_in_seq(\s-1LIST\s0) => \s-1LIST\s0" .IX Subsection "find_missing_strs_in_seq(LIST) => LIST" Like \f(CW\*(C`find_missing_nums_in_seq\*(C'\fR, but for strings/letters \*(L"a\*(R"..\*(L"z\*(R". .PP .Vb 2 \& find_missing_strs_in_seq("a", "e", "b"); # ("c", "d") \& find_missing_strs_in_seq("aa".."zu", "zz"); # ("zv", "zw", "zx", "zy") .Ve .ie n .SS "min_in_range($lower, $upper, @list) => $num" .el .SS "min_in_range($lower, \f(CW$upper\fP, \f(CW@list\fP) => \f(CW$num\fP" .IX Subsection "min_in_range($lower, $upper, @list) => $num" Find lowest number \f(CW$num\fR in \f(CW@list\fR which still satisfies \f(CW\*(C`$lower <= $num <= $upper\*(C'\fR. \f(CW$lower\fR and/or \f(CW$upper\fR can be undef to express no limit. .ie n .SS "minstr_in_range($lower, $upper, @list) => $str" .el .SS "minstr_in_range($lower, \f(CW$upper\fP, \f(CW@list\fP) => \f(CW$str\fP" .IX Subsection "minstr_in_range($lower, $upper, @list) => $str" Find lowest string \f(CW$str\fR in \f(CW@list\fR which still satisfies \f(CW\*(C`$lower le $x le $upper\*(C'\fR. \f(CW$lower\fR and/or \f(CW$upper\fR can be undef to express no limit. .ie n .SS "max_in_range($lower, $upper, @list) => $num" .el .SS "max_in_range($lower, \f(CW$upper\fP, \f(CW@list\fP) => \f(CW$num\fP" .IX Subsection "max_in_range($lower, $upper, @list) => $num" Find highest number \f(CW$num\fR in \f(CW@list\fR which still satisfies \f(CW\*(C`$lower <= $num <= $upper\*(C'\fR. \f(CW$lower\fR and/or \f(CW$upper\fR can be undef to express no limit. .ie n .SS "maxstr_in_range($lower, $upper, @list) => $str" .el .SS "maxstr_in_range($lower, \f(CW$upper\fP, \f(CW@list\fP) => \f(CW$str\fP" .IX Subsection "maxstr_in_range($lower, $upper, @list) => $str" Find highest string \f(CW$str\fR in \f(CW@list\fR which still satisfies \f(CW\*(C`$lower le $x le $upper\*(C'\fR. \f(CW$lower\fR and/or \f(CW$upper\fR can be undef to express no limit. .ie n .SS "pick(@list) => $item" .el .SS "pick(@list) => \f(CW$item\fP" .IX Subsection "pick(@list) => $item" Randomly pick an item from list. It is actually simply done as: .PP .Vb 1 \& $_[@_ * rand] .Ve .PP Example: .PP .Vb 2 \& pick(1, 2, 3); # => 2 \& pick(1, 2, 3); # => 1 .Ve .ie n .SS "pick_n($n, @list) => @picked" .el .SS "pick_n($n, \f(CW@list\fP) => \f(CW@picked\fP" .IX Subsection "pick_n($n, @list) => @picked" Randomly pick \f(CW\*(C`n\*(C'\fR different items from list. Note that there might still be duplicate values in the result if the original list contains duplicates. .PP .Vb 4 \& pick_n(3, 1,2,3,4,5); # => (3,2,5) \& pick_n(2, 1,2,3,4,5); # => (3,1) \& pick_n(2, 1,1,1,1); # => (1,1) \& pick_n(4, 1,2,3); # => (3,1,2) .Ve .SH "SEE ALSO" .IX Header "SEE ALSO" \&\s-1SHARYANTO\s0 .SH "HOMEPAGE" .IX Header "HOMEPAGE" Please visit the project's homepage at . .SH "SOURCE" .IX Header "SOURCE" Source repository is at . .SH "BUGS" .IX Header "BUGS" Please report any bugs or feature requests on the bugtracker website .PP When submitting a bug or request, please include a test-file or a patch to an existing test-file that illustrates the bug or desired feature. .SH "AUTHOR" .IX Header "AUTHOR" perlancar .SH "COPYRIGHT AND LICENSE" .IX Header "COPYRIGHT AND LICENSE" This software is copyright (c) 2015 by perlancar@cpan.org. .PP This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself.