thecrypticace/lazy 问题修复 & 功能扩展

解决BUG、新增功能、兼容多环境部署,快速响应你的开发需求

邮箱:yvsm@zunyunkeji.com | QQ:316430983 | 微信:yvsm316

thecrypticace/lazy

Composer 安装命令:

composer require thecrypticace/lazy

包简介

Collection-like wrapper around Iterators

README 文档

README

Build Status Coverage Status Total Downloads Latest Stable Version License

What

Lazy is a Collection-like wrapper that can operate on iterators one item at a time (on-demand).

Some notes:

  1. Lazy works well for one-shot data sources (e.g. Generators)
  2. Lazy supports algorithms which run with minimal overhead. Functional algorithms are well suited to this.
  3. Lazy collections can convert the underlying data source into an array using ->eager(). Useful for reiterative purposes.
  4. Has convenience methods for simple lazy data generation (e.g. ranges)
  5. Has higher-order collection proxy which will allow code like this: $collection->map->people->map->count()->sum()

Why?

Let's say you have this code:

collect($oneMillionNumbers)->filter(function ($n) {
    return $n % 2 === 0;
})->map(function ($n) {
    return $n / 4;
})->filter(function ($n) {
    return $n >= 100;
})
->first()

For a small array $items the work performed here is trivial. If you take a large array containing 1 million numbers starting at one the work performed is large:

  • 1,000,000 iterations in filter
  • 500,000 iterations in map
  • 500,000 iterations in filter
  • one iteration in first

Total: 2,000,001 iterations Total: 2,000,001 function calls

Each one of these iterations also incurs the overhead of a function call.

If you replace that call to collect with lazy:

lazy($oneMillionNumbers)->filter(function ($n) {
    return $n % 2 === 0;
})->map(function ($n) {
    return $n / 4;
})->filter(function ($n) {
    return $n >= 100;
})
->first()

These are the stats:

  • 400 iterations in filter
  • 200 iterations in map
  • 200 iterations in filter
  • one iteration in first

Since these iterations happen on demand it's not 801 iterations. It's 400 for the entire set. Lazy Collections perform the minimal amount of work needed to get the result.

There are 801 function calls. One for each of the "virtual" iterations in each of the operations. Still, this number is far less than the 2,000,001 calls from the loop above.

Total: 400 iterations Total: 801 function calls

Lazy is effectively performing the same operation as this:

foreach ($oneMillionNumbers as $n) {
    if ($n % 2 === 0) {
        $n = $n / 4;
        if ($n >= 100) {
            return $n;
        }
    }
}

tip: lazy_range(1, 1000000) will generate a Collection with a range from one to one million.

thecrypticace/lazy 适用场景与选型建议

thecrypticace/lazy 是一款 基于 PHP 开发的 Composer 扩展包,目前已累计 252 次下载、GitHub Stars 达 6, 最近一次更新时间为 2017 年 03 月 14 日, 在 PHP 生态内属于活跃度较高的组件。

它主要适用于以下技术方向: 「collections」 「lazy」 「iterators」 等业务场景。在实际项目中,围绕这些方向常见需要落地的问题包括:接口对接、性能调优、并发安全、与既有框架(Laravel / ThinkPHP / Yii / Webman 等)的兼容适配,以及生产环境的日志埋点与稳定性保障。

我们在过去多个企业项目中使用过 thecrypticace/lazy 或与其功能相近的方案,如果你在选型或落地过程中遇到问题,例如 版本兼容、二次改造、私有化封装、与内部系统对接、生产 BUG 排查,欢迎联系我们协助评估。

围绕 thecrypticace/lazy 我们能提供哪些服务?
定制开发 / 二次开发

基于 thecrypticace/lazy 在你已有业务上做功能扩展、字段裁剪、UI 适配、与内部账号 / 权限 / 日志系统的深度对接。

BUG 修复 & 性能优化

线上偶发问题、内存泄漏、慢查询、并发异常等排查修复;针对高流量场景做缓存、队列、索引层面的调优。

项目外包 & 长期维护

承接完整的项目从需求 → 设计 → 开发 → 上线 → 长期运维;也可按月提供技术保姆服务。

yvsm@zunyunkeji.com QQ:316430983 微信:yvsm316 西安尊云信息科技 · 专注 PHP / Go / 分布式系统研发

统计信息

  • 总下载量: 252
  • 月度下载量: 0
  • 日度下载量: 0
  • 收藏数: 6
  • 点击次数: 12
  • 依赖项目数: 0
  • 推荐数: 0

GitHub 信息

  • Stars: 6
  • Watchers: 1
  • Forks: 0
  • 开发语言: PHP

其他信息

  • 授权协议: MIT
  • 更新时间: 2017-03-14