The solution is to create a list that contains the sort information, and generate the sort field information just once.
解决方案是创建一个包含排序信息的列表,并只生成一次排序域信息。
Instead of calling sprintf all those times, we call it just once for each item in the hash in order to generate a sort field in the hash, and then use that sort field directly during the sort.
现在不需要每次都调用sprintf,对hash表中的每一项,只需要调用一次该函数,就可以在hash表中生成一个排序字段,然后在排序时就可以使用这个排序字段了。
Instead of calling sprintf all those times, we call it just once for each item in the hash in order to generate a sort field in the hash, and then use that sort field directly during the sort.
现在不需要每次都调用sprintf,对hash表中的每一项,只需要调用一次该函数,就可以在hash表中生成一个排序字段,然后在排序时就可以使用这个排序字段了。
应用推荐