perl核心模块解析（二）List::Util

perl核心模块解析（二）    List::Util

详细文档链接如下

源自：http://blog.csdn.net/jonathanxqs

转自：http://perldoc.perl.org/List/Util.html

http://www.xker.com/page/e2015/06/193925.html

在Perl中有一些专门用于处理列表数据的模块，比如说List::Util模块，该模块包含在标准库中，能提供各种高效的常见列表处理工具。因其用C语言来实现，速度一般都挺快！

【例01】扫描符合条件的某个列表，并取出第一个符合条件的

常规做法:

代码如下:

use 5.010;

my @names  = qw(Wendy Jerry Betty Wendy Alice);

foreach  (@names) {

if (/\bWendy\b/i) {

$match = $_;

last;

}

}

say $match;

如果改用List::Util模块提供的first子程序，就要简单的多

代码如下:

use List::Util qw(first);

my $match = first {/\bWendy\b/i} @names;  #找到第一个Wendy即终止

如果换成数字的话，比如要求

【例02】求1到1000之间的和

常规做法:

代码如下:

use 5.010;

my $total = 0;

foreach (1..1000) {

$total += $_;

}

say $total;               #结果500500

如果改用List::Util模块提供的sum子程序，同样很简单:

代码如下:

use List::Util qw(sum);

my $total = sum(1..1000); #结果500500

【例03】求一组数字的最大值与最小值.

常规做法:

代码如下:

#! /usr/bin/perl;

use utf8;

sub max {

my($max_so_far) = shift @_; #数组中第一个值，暂时当成最大值。

foreach(@_){                #遍历数组@_

if($_>$max_so_far){         #看其它元素是否有比$max_so_far大的值。

$max_so_far = $_;}         #如果有话，更新最大值变量

}

$max_so_far;

}

my $_MaxData = &max(2,3,8,5,10);

print $_MaxData;               #结果为10

如果改用List::Util模块提供的max子程序，则非常简单:

代码如下:

use List::Util qw(max);

my $max = max(2, 3, 8, 5, 10);

print $max;                 #结果为10

同样道理，使用List::Util模块提供的min子程序，可求最小值:

代码如下:

use List::Util qw(min);

my $min = min(2, 3, 8, 5, 10);  #最小值为2

【例04】对一组字符串进行排序

如果用常规方法的话，必须按顺序一个个进行比较，用List::Util的maxstr子程序可以轻松实现:

代码如下:

use List::Util qw(maxstr);

my  $max_str = maxstr( qw/Jerry Betty Alice Fred Barney jerry/ );

print $max_str;

【例05】对列表中的元素随机排序

如果用常规方法的话，很难实现，而用List::Util中的shuffle子程序，则非常简单，一条命令搞定！

代码如下:

use List::Util qw(shuffle);

my @shuffled_nums = shuffle(1..10);   # 3 9 8 5 6 4 1 10 2 7

my @shuffled_name = shuffle(‘A‘..‘G‘);# F E G A B D

【例06】检查列表中是否没有某个元素，或者有任何元素，或者所有元素都符合条件。支持类似grep语法

如果用常规方法的话，很难实现，而用List::MoreUtils同样很容易实现，代码如下:

代码如下:

use List::MoreUtils qw(none any all);

my @numbers = qw(7 4 1 3 78);

if (none {$_ > 100} @numbers) {print "No elements over 100\n"; }

elsif (any {$_ > 50}@numbers) {print "Some elements over 50\n";}

elsif (all {$_ <10} @numbers) {print "All elements < 10\n";}

NOTE: List::MoreUtils非自带的模块，需要下载.

【例07】同时处理多个姓名列表，每次取出2位

代码如下:

use List::MoreUtils qw(natatime);

my @names_1 = qw(Alice Bob Carly);

my @names_2 = qw(David Edward Foo);

my $names   = natatime(2, @names_1, @names_2);  #natatim (N at a time:同时处理N组)有多个列表的话往里面放就好了

while (my @name = $names->()) {                 #遍历，方便后面输出

print "Got @name\n";

}

#输出结果

Got Alice Bob

Got Carly David

Got Edward Foo

【例08】合并多个列表为一个列表

代码如下:

use List::MoreUtils qw(mesh);

my @array_1 = ‘A‘ .. ‘D‘;

my @array_2 = 1 .. 4;

my @array_3 = qw( jerry alice wendy );

my @array_new = mesh(@array_1, @array_2, @array_3);

print @array_new;

#输出结果:

A=>1=>jerry=> B=>2=>alice=> C=>3=>wendy=> D=>4

第1次: 第一个列表中取A，第二个列表中取出1，第三个列表中取出jerry

第2次: 第一个列表中取B, 第二个列表中取出2，第三个列表中取出alice

......

依次类推！

【例09】往指定的字符串中加字符

可以用List::MoreUtils中的insert_after子程序

代码如下:

use v5.10;

use List::MoreUtils qw(:all);

my @list = qw/This is a list/;

insert_after {$_ eq ‘a‘} "longer" => @list;

print @list;  #This is a longer list

【例10】对两个列表进行操作，第一个列表平方后，和第二个列表求和

可以用List::MoreUtils中的pairwise子程序

代码如下:

use v5.10;

use List::MoreUtils qw(:all);

@m = (1..4);

@n = (100..103);

@x = pairwise { ($a*$a) + $b } @m, @n;  #101 105 111 119

【总结】

如果上面的方式用普通的方法实现，需要多次循环遍历，很麻烦，而将复杂的算法，数据结构用C来实现并封装在List模块中，则可以实现很多看似复杂的功能，从中也可以看出Perl的强大之处在于CPAN，有众多的模块支撑！

【Reference】

List::Util

NAME

List::Util - A selection of general-utility list subroutines

SYNOPSIS

    

  1. use List::Util qw(first max maxstr min minstr reduce shuffle sum);
    2.

DESCRIPTION

List::Util contains a selection of subroutines that people have expressed would be nice to have
in the perl core, but the usage would not really be high enough to warrant the use of a keyword, and the size so small such that being individual extensions would be wasteful.

By default List::Util does not export any subroutines.

LIST-REDUCTION FUNCTIONS

The following set of functions all reduce a list down to a single value.

$result = reduce { BLOCK } @list

Reduces @list by calling BLOCK in
a scalar context multiple times, setting $a and $b each
time. The first call will be with $a and $b set
to the first two elements of the list, subsequent calls will be done by setting $a to the
result of the previous call and $b to the next element in the list.

Returns the result of the last call to the BLOCK . If @list is
empty then undef is
returned. If @list only contains one element then that element is returned and BLOCK is
not executed.

The following examples all demonstrate how reduce could be used to implement the other list-reduction
functions in this module. (They are not in fact implemented like this, but instead in a more efficient manner in individual C functions).

    

  1. $foo = reduce { defined($a)            ? $a :
    2. 

  2. $code->(local $_ = $b) ? $b :
    3. 

  3. undef } undef, @list # first
    4. 

  4. $foo = reduce { $a > $b ? $a : $b } 1..10       # max
    5. 

  5. $foo = reduce { $a gt $b ? $a : $b } ‘A‘..‘Z‘   # maxstr
    6. 

  6. $foo = reduce { $a < $b ? $a : $b } 1..10       # min
    7. 

  7. $foo = reduce { $a lt $b ? $a : $b } ‘aa‘..‘zz‘ # minstr
    8. 

  8. $foo = reduce { $a + $b } 1 .. 10               # sum
    9. 

  9. $foo = reduce { $a . $b } @bar                  # concat
    10. 

  10. $foo = reduce { $a || $code->(local $_ = $b) } 0, @bar   # any
    11. 

  11. $foo = reduce { $a && $code->(local $_ = $b) } 1, @bar   # all
    12. 

  12. $foo = reduce { $a && !$code->(local $_ = $b) } 1, @bar  # none
    13. 

  13. $foo = reduce { $a || !$code->(local $_ = $b) } 0, @bar  # notall
    14. 

  14. # Note that these implementations do not fully short-circuit
    15.

If your algorithm requires that reduce produce an identity value, then make sure that you always
pass that identity value as the first argument to prevent undef being
returned

    

  1. $foo = reduce { $a + $b } 0, @values;             # sum with 0 identity value
    2.

The remaining list-reduction functions are all specialisations of this generic idea.

any

    

  1. my $bool = any { BLOCK } @list;
    2.

Since version 1.33.

Similar to grep in
that it evaluates BLOCK setting $_ to
each element of @list in turn. any returns
true if any element makes the BLOCK return a true value. If BLOCK never
returns true or @list was empty then it returns false.

Many cases of using grep in
a conditional can be written using any instead, as it can short-circuit after the first true
result.

    

  1. if( any { length > 10 } @strings ) {
    2. 

  2. # at least one string has more than 10 characters
    3. 

  3. }
    4.

all

    

  1. my $bool = all { BLOCK } @list;
    2.

Since version 1.33.

Similar to any, except that it requires all elements of the @list to
make the BLOCK return true. If any element returns false, then it returns false. If the BLOCK never
returns false or the @list was empty then it returns true.

none

notall

    

  1. my $bool = none { BLOCK } @list;
    2. 

  2. my $bool = notall { BLOCK } @list;
    3.

Since version 1.33.

Similar to any and all, but with the return sense
inverted. none returns true only if no value in the @list causes
theBLOCK to return true, and notall returns
true only if not all of the values do.

first

    

  1. my $val = first { BLOCK } @list;
    2.

Similar to grep in
that it evaluates BLOCK setting $_ to
each element of @list in turn. first returns
the first element where the result from BLOCK is a true value. If BLOCK never
returns true or @list was empty then undef is
returned.

    

  1. $foo = first { defined($_) } @list    # first defined value in @list
    2. 

  2. $foo = first { $_ > $value } @list    # first value in @list which
    3. 

  3. # is greater than $value
    4.

max

    

  1. my $num = max @list;
    2.

Returns the entry in the list with the highest numerical value. If the list is empty then undef is
returned.

    

  1. $foo = max 1..10                # 10
    2. 

  2. $foo = max 3,9,12               # 12
    3. 

  3. $foo = max @bar, @baz           # whatever
    4.

maxstr

    

  1. my $str = maxstr @list;
    2.

Similar to max, but treats all the entries in the list as strings and returns the highest string as defined by the gtoperator.
If the list is empty then undef is
returned.

    

  1. $foo = maxstr ‘A‘..‘Z‘          # ‘Z‘
    2. 

  2. $foo = maxstr "hello","world"   # "world"
    3. 

  3. $foo = maxstr @bar, @baz        # whatever
    4.

min

    

  1. my $num = min @list;
    2.

Similar to max but returns the entry in the list with the lowest numerical value. If the list is empty then undef is
returned.

    

  1. $foo = min 1..10                # 1
    2. 

  2. $foo = min 3,9,12               # 3
    3. 

  3. $foo = min @bar, @baz           # whatever
    4.

minstr

    

  1. my $str = minstr @list;
    2.

Similar to min, but treats all the entries in the list as strings and returns the lowest string as defined by the ltoperator.
If the list is empty then undef is
returned.

    

  1. $foo = minstr ‘A‘..‘Z‘          # ‘A‘
    2. 

  2. $foo = minstr "hello","world"   # "hello"
    3. 

  3. $foo = minstr @bar, @baz        # whatever
    4.

product

    

  1. my $num = product @list;
    2.

Since version 1.35.

Returns the numerical product of all the elements in @list . If @list is
empty then 1 is returned.

    

  1. $foo = product 1..10            # 3628800
    2. 

  2. $foo = product 3,9,12           # 324
    3.

sum

    

  1. my $num_or_undef = sum @list;
    2.

Returns the numerical sum of all the elements in @list . For backwards compatibility, if @list is
empty then undef is
returned.

    

  1. $foo = sum 1..10                # 55
    2. 

  2. $foo = sum 3,9,12               # 24
    3. 

  3. $foo = sum @bar, @baz           # whatever
    4.

sum0

    

  1. my $num = sum0 @list;
    2.

Since version 1.26.

Similar to sum, except this returns 0 when given an empty list, rather than undef.

KEY/VALUE PAIR LIST FUNCTIONS

The following set of functions, all inspired by List::Pairwise, consume an even-sized list of pairs. The pairs may be key/value associations from a hash,
or just a list of values. The functions will all preserve the original ordering of the pairs, and will not be confused by multiple pairs having the same "key" value - nor even do they require that the first of each pair be a plain string.

pairgrep

    

  1. my @kvlist = pairgrep { BLOCK } @kvlist;
    2. 

  2. my $count = pairgrep { BLOCK } @kvlist;
    3.

Since version 1.29.

Similar to perl‘s grep keyword,
but interprets the given list as an even-sized list of pairs. It invokes the BLOCK multiple
times, in scalar context, with $a and $b set
to successive pairs of values from the @kvlist .

Returns an even-sized list of those pairs for which the BLOCK returned true in list context,
or the count of the number of pairs in scalar context. (Note, therefore, in scalar context that it returns a number half the size of the count of items it would have returned in list context).

    

  1. @subset = pairgrep { $a =~ m/^[[:upper:]]+$/ } @kvlist
    2.

As with grep aliasing $_ to
list elements, pairgrep aliases $a and $b to
elements of the given list. Any modifications of it by the code block will be visible to the caller.

pairfirst

    

  1. my ( $key, $val ) = pairfirst { BLOCK } @kvlist;
    2. 

  2. my $found = pairfirst { BLOCK } @kvlist;
    3.

Since version 1.30.

Similar to the first function, but interprets the given list as an even-sized list of pairs. It invokes the BLOCK multiple
times, in scalar context, with $a and $b set
to successive pairs of values from the @kvlist .

Returns the first pair of values from the list for which the BLOCK returned true in list context,
or an empty list of no such pair was found. In scalar context it returns a simple boolean value, rather than either the key or the value found.

    

  1. ( $key, $value ) = pairfirst { $a =~ m/^[[:upper:]]+$/ } @kvlist
    2.

As with grep aliasing $_ to
list elements, pairfirst aliases $a and $b to
elements of the given list. Any modifications of it by the code block will be visible to the caller.

pairmap

    

  1. my @list = pairmap { BLOCK } @kvlist;
    2. 

  2. my $count = pairmap { BLOCK } @kvlist;
    3.

Since version 1.29.

Similar to perl‘s map keyword,
but interprets the given list as an even-sized list of pairs. It invokes the BLOCK multiple
times, in list context, with $a and $b set
to successive pairs of values from the @kvlist .

Returns the concatenation of all the values returned by the BLOCK in list context, or the count
of the number of items that would have been returned in scalar context.

    

  1. @result = pairmap { "The key $a has value $b" } @kvlist
    2.

As with map aliasing $_ to
list elements, pairmap aliases $a and $b to
elements of the given list. Any modifications of it by the code block will be visible to the caller.

See KNOWN BUGS for a known-bug with pairmap ,
and a workaround.

pairs

    

  1. my @pairs = pairs @kvlist;
    2.

Since version 1.29.

A convenient shortcut to operating on even-sized lists of pairs, this function returns a list of ARRAY references, each containing two items from the given list. It is a more efficient version of

    

  1. @pairs = pairmap { [ $a, $b ] } @kvlist
    2.

It is most convenient to use in a foreach loop, for example:

    

  1. foreach my $pair ( pairs @KVLIST ) {
    2. 

  2. my ( $key, $value ) = @$pair;
    3. 

  3. ...
    4. 

  4. }
    5.

Since version 1.39 these ARRAY references are blessed objects, recognising the two methods key and value .
The following code is equivalent:

    

  1. foreach my $pair ( pairs @KVLIST ) {
    2. 

  2. my $key   = $pair->key;
    3. 

  3. my $value = $pair->value;
    4. 

  4. ...
    5. 

  5. }
    6.

pairkeys

    

  1. my @keys = pairkeys @kvlist;
    2.

Since version 1.29.

A convenient shortcut to operating on even-sized lists of pairs, this function returns a list of the the first values of each of the pairs in the given list. It is a more efficient version of

    

  1. @keys = pairmap { $a } @kvlist
    2.

pairvalues

    

  1. my @values = pairvalues @kvlist;
    2.

Since version 1.29.

A convenient shortcut to operating on even-sized lists of pairs, this function returns a list of the the second values of each of the pairs in the given list. It is a more efficient version of

    

  1. @values = pairmap { $b } @kvlist
    2.

OTHER FUNCTIONS

shuffle

    

  1. my @values = shuffle @values;
    2.

Returns the values of the input in a random order

    

  1. @cards = shuffle 0..51      # 0..51 in a random order
    2.

KNOWN BUGS

RT #95409

https://rt.cpan.org/Ticket/Display.html?id=95409

If the block of code given to pairmap contains lexical variables that are captured by a returned closure, and the closure is executed after the block
has been re-used for the next iteration, these lexicals will not see the correct values. For example:

    

  1. my @subs = pairmap {
    2. 

  2. my $var = "$a is $b";
    3. 

  3. sub { print "$var\n" };
    4. 

  4. } one => 1, two => 2, three => 3;
    5. 

  5. $_->() for @subs;
    6.

Will incorrectly print

    

  1. three is 3
    2. 

  2. three is 3
    3. 

  3. three is 3
    4.

This is due to the performance optimisation of using MULTICALL for the code block, which means
that fresh SVs do not get allocated for each call to the block. Instead, the same SV is re-assigned for each iteration, and all the closures will share the value seen on the final iteration.

To work around this bug, surround the code with a second set of braces. This creates an inner block that defeats theMULTICALL logic,
and does get fresh SVs allocated each time:

    

  1. my @subs = pairmap {
    2. 

  2. {
    3. 

  3. my $var = "$a is $b";
    4. 

  4. sub { print "$var\n"; }
    5. 

  5. }
    6. 

  6. } one => 1, two => 2, three => 3;
    7.

This bug only affects closures that are generated by the block but used afterwards. Lexical variables that are only used during the lifetime of the block‘s execution will take their individual values for each invocation, as normal.

SUGGESTED ADDITIONS

The following are additions that have been requested, but I have been reluctant to add due to them being very simple to implement in perl

    

  1. # How many elements are true
    2. 

  2. sub true { scalar grep { $_ } @_ }
    3. 

  3. # How many elements are false
    4. 

  4. sub false { scalar grep { !$_ } @_ }
    5.

SEE ALSO

Scalar::Util, List::MoreUtils

COPYRIGHT

Copyright (c) 1997-2007 Graham Barr <[email protected]>. All rights reserved. This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

Recent additions and current maintenance by Paul Evans, <[email protected]>.

时间： 2024-08-02 04:57:20

perl核心模块解析（二）List::Util的相关文章

perl核心模块解析（一）POSIX

perl核心模块解析(一)    POSIX 详细文档链接如下 源自:http://blog.csdn.net/jonathanxqs 转自:http://perldoc.perl.org/POSIX.html POSIX/?p?z?ks/, 是可移植操作系统接口(Portable Operating System Interface ),POSIX标准定义了操作系统应该为应用程序提供的接口标准,是IEEE为要在各种UNIX操作系统上运行的软件而定义的一系列API标准的总称,其正式称呼为IEEE

Spring核心模块解析

Spring框架是一个轻量级的集成式开发框架,可以和任何一种框架集成在一起使用,可以说是一个大的全家桶.Spring从1.x发展到现在的5.x可以说是越来越强大,下面来看看Spring都包含哪些核心的模块吧. Spring图中的这些模块,都至少由一个以上的jar包组成. 1.Core Container - 核心容器 spring-core:Spring中的核心工具类包. spring-beans:Spring中定义bean的组件. spring-context:Spring的运行容器. spr

纯手工搭建kubernetes(k8s)1.9集群 - (二)核心模块部署

1. 部署ETCD(主节点) 1.1 简介 ??kubernetes需要存储很多东西,像它本身的节点信息,组件信息,还有通过kubernetes运行的pod,deployment,service等等.都需要持久化.etcd就是它的数据中心.生产环境中为了保证数据中心的高可用和数据的一致性,一般会部署最少三个节点.我们这里以学习为主就只在主节点部署一个实例. 如果你的环境已经有了etcd服务(不管是单点还是集群),可以忽略这一步.前提是你在生成配置的时候填写了自己的etcd endpoint哦~

Magento(社区版)自带模块解析以及在国内的使用建议二

11.CatalogIndex 跟商品相关的几种索引(价格.属性等等)的处理模块,商品是系统的核心组件,处理商品索引相关的模块自然也是核心模块,必须是开启状态. 12.CatalogInventory 核心模块之一的"库存"模块,管理者Magento的商品库存相关的功能. Magento的库存逻辑,主要通过两个字段来控制:库存数量(Qty)和库存状态(Stock Availability),理论上只有该商品库存数量大于0并且库存状态是In Stock时,这个商品才是前台真正可以售卖的.

node.js学习笔记5——核心模块1

Node.js核心模块主要内容包括:(1)全局对象 (2)常用工具 (3)事件机制 (4)文件系统访问 (5)HTTP服务器与客户端 一: 全局对象 Node.js中的全局对象是global,所有的全局变量(除了global本身以外)都是global的属性. global 最根本的作用是作为全局变量的宿主. 全局变量的条件: (1)在最外层定义的变量; (2)全局对象的属性: (3)隐式定义的变量(未定义直接赋值的变量(strict模式下不可以)) 在Node.js中不可能在最外层定义变量,因为

nginx源码分析--nginx模块解析

nginx的模块非常之多,可以认为所有代码都是以模块的形式组织,这包括核心模块和功能模块,针对不同的应用场合,并非所有的功能模块都要被用到,附录A给出的是默认configure(即简单的http服务器应用)下被连接的模块,这里虽说是模块连接,但nginx不会像apache或lighttpd那样在编译时生成so动态库而在程序执行时再进行动态加载,nginx模块源文件会在生成nginx时就直接被编译到其二进制执行文件中,所以如果要选用不同的功能模块,必须对nginx做重新配置和编译.对于功能模块的选

Spring 源码解析之HandlerAdapter源码解析(二)

Spring 源码解析之HandlerAdapter源码解析(二) 前言 看这篇之前需要有Spring 源码解析之HandlerMapping源码解析(一)这篇的基础,这篇主要是把请求流程中的调用controller流程单独拿出来了 解决上篇文章遗留的问题 getHandler(processedRequest) 这个方法是如何查找到对应处理的HandlerExecutionChain和HandlerMapping的,比如说静态资源的处理和请求的处理肯定是不同的HandlerMapping ge

Node.js【5】核心模块

笔记来自<Node.js开发指南>BYVoid编著 第4章 Node.js核心模块 4.1.全局对象 Node.js中的全局对象是global,所有全局变量(除了global本身以外)都是global对象的属性.我们在Node.js中能够直接访问到对象通常都是global的属性,如console.process等. 永远使用var定义变量以避免引入全局变量,因为全局变量会污染命名空间,提高代码的耦合风险. process用于描述当前Node.js进程状态的对象,提供了一个与操作系统的简单接口.

Android Bitmap 全面解析(二)加载多张图片的缓存处理

一般少量图片是很少出现OOM异常的,除非单张图片过~大~ 那么就可以用教程一里面的方法了通常应用场景是listview列表加载多张图片,为了提高效率一般要缓存一部分图片,这样方便再次查看时能快速显示~不用重新下载图片但是手机内存是很有限的~当缓存的图片越来越多,即使单张图片不是很大,不过数量太多时仍然会出现OOM的情况了~本篇则是讨论多张图片的处理问题-----------------------------------------------------------------------图片