返回介绍

reduceRight

发布于 2019-05-31 13:12:59 字数 1799 浏览 1063 评论 0 收藏 0

Aggregates a sequence, from the tail, into a single value according to some accumulator function.

Signature

Sequence.reduceRight = function(aggregator, memo) { /*...*/ }
Sequence.reduceRight = function reduceRight(aggregator, memo) {
  if (arguments.length < 2) {
return this.initial(1).reduceRight(aggregator, this.last());
  }

  // This bothers me... but frankly, calling reverse().reduce() is potentially
  // going to eagerly evaluate the sequence anyway; so it's really not an issue.
  var indexed = this.getIndex(),
  i = indexed.length() - 1;
  return indexed.reverse().reduce(function(m, e) {
return aggregator(m, e, i--);
  }, memo);
}
NameType(s)Description
aggregatorFunction

The function through which to pass every element in the sequence. For every element, the function will be passed the total aggregated result thus far and the element itself, and should return a new aggregated result.

memo*

The starting value to use for the aggregated result.

returns*

The result of the aggregation.

Examples

function append(s1, s2) {
  return s1 + s2;
}

function isVowel(str) {
  return "aeiou".indexOf(str) !== -1;
}

Lazy("abcde").reduceRight(append)                 // => "edcba"
Lazy("abcde").filter(isVowel).reduceRight(append) // => "ea"

如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

扫码二维码加入Web技术交流群

发布评论

需要 登录 才能够评论, 你可以免费 注册 一个本站的账号。
列表为空,暂无数据
    我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
    原文