定制 lambert/tree-shape 二次开发

按需修改功能、优化性能、对接业务系统,提供一站式技术支持

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

lambert/tree-shape

Composer 安装命令:

composer require lambert/tree-shape

包简介

A simple way to generate a tree structure.

README 文档

README

生成树形结构的简单方式

Feature

有Relation_key的关系数据,都可以生成树状的结构

Install

$ composer require lambert/tree-shape

RequireMent

  • PHP >= 5.6

Usage

use Lambert\TreeShape\Manager;
 
$category = [
    ['id' => 1, 'name' => '节点1', 'pid' => 0],
    ['id' => 2, 'name' => '节点2', 'pid' => 0],
    ['id' => 3, 'name' => '节点3', 'pid' => 1],
    ['id' => 4, 'name' => '节点4', 'pid' => 1],
];
 
// Start build
$manager = Manager::buildTree($category, 'pid');
$tree = $manager->all();

生成后:

Array
(
    [1] => Lambert\TreeShape\Tree Object
        (
            [childrenIds:protected] => Array
                (
                    [0] => 3
                    [1] => 4
                )

            [recursionChildrenIds:protected] =>
            [currentNode:protected] => Lambert\TreeShape\Node Object
                (
                    [data:protected] => Array
                        (
                            [id] => 1
                            [name] => 节点1
                            [pid] => 0
                        )

                )

            [leftTree:protected] =>
            [rightTree:protected] => Array
                (
                    [3] => Lambert\TreeShape\Tree Object
                        (
                            [childrenIds:protected] =>
                            [recursionChildrenIds:protected] =>
                            [currentNode:protected] => Lambert\TreeShape\Node Object
                                (
                                    [data:protected] => Array
                                        (
                                            [id] => 3
                                            [name] => 节点3
                                            [pid] => 1
                                        )

                                )

                            [leftTree:protected] => Lambert\TreeShape\Tree Object
 *RECURSION*
                            [rightTree:protected] =>
                        )

                    [4] => Lambert\TreeShape\Tree Object
                        (
                            [childrenIds:protected] =>
                            [recursionChildrenIds:protected] =>
                            [currentNode:protected] => Lambert\TreeShape\Node Object
                                (
                                    [data:protected] => Array
                                        (
                                            [id] => 4
                                            [name] => 节点4
                                            [pid] => 1
                                        )

                                )

                            [leftTree:protected] => Lambert\TreeShape\Tree Object
 *RECURSION*
                            [rightTree:protected] =>
                        )

                )

        )

    [2] => Lambert\TreeShape\Tree Object
        (
            [childrenIds:protected] =>
            [recursionChildrenIds:protected] =>
            [currentNode:protected] => Lambert\TreeShape\Node Object
                (
                    [data:protected] => Array
                        (
                            [id] => 2
                            [name] => 节点2
                            [pid] => 0
                        )

                )

            [leftTree:protected] =>
            [rightTree:protected] =>
        )

)

Methods

  • 查找某个Tree
$tree = $manager->findTree('name', '子节点1');
 
Lambert\TreeShape\Tree Object
(
    [childrenIds:protected] => Array
        (
            [0] => 3
            [1] => 4
        )

    [recursionChildrenIds:protected] =>
    [currentNode:protected] => Lambert\TreeShape\Node Object
        (
            [data:protected] => Array
                (
                    [id] => 1
                    [name] => 节点1
                    [pid] => 0
                )

        )

    [leftTree:protected] =>
    [rightTree:protected] => Array
        (
            [3] => Lambert\TreeShape\Tree Object
                (
                    [childrenIds:protected] =>
                    [recursionChildrenIds:protected] =>
                    [currentNode:protected] => Lambert\TreeShape\Node Object
                        (
                            [data:protected] => Array
                                (
                                    [id] => 3
                                    [name] => 节点3
                                    [pid] => 1
                                )

                        )

                    [leftTree:protected] => Lambert\TreeShape\Tree Object
*RECURSION*
                    [rightTree:protected] =>
                )

            [4] => Lambert\TreeShape\Tree Object
                (
                    [childrenIds:protected] =>
                    [recursionChildrenIds:protected] =>
                    [currentNode:protected] => Lambert\TreeShape\Node Object
                        (
                            [data:protected] => Array
                                (
                                    [id] => 4
                                    [name] => 节点4
                                    [pid] => 1
                                )

                        )

                    [leftTree:protected] => Lambert\TreeShape\Tree Object
*RECURSION*
                    [rightTree:protected] =>
                )

        )

)
  • 获取当前树的左、右子树
$leftTree = $tree->getLeftTree();
$rightTree = $tree->getRightTree();
Lambert\TreeShape\Tree Object
(
    [childrenIds:protected] => Array
        (
            [0] => 3
            [1] => 4
        )

    [recursionChildrenIds:protected] =>
    [currentNode:protected] => Lambert\TreeShape\Node Object
        (
            [data:protected] => Array
                (
                    [id] => 1
                    [name] => 节点1
                    [pid] => 0
                )

        )

    [leftTree:protected] =>
    [rightTree:protected] =>
)

**注意:获取右子树时,根据自己数据类型的关系,多个右子树的话,会返回Array**
  • 获取节点属性
继承了SPL的ArrayAccess,可以使用数组或属性的方式访问
 
$node = $tree->getCurrentNode();
 
$node['name'] or $node->name;   // 节点1
 
$node['id'] or $node->id;   // 1
...

License

MIT

lambert/tree-shape 适用场景与选型建议

lambert/tree-shape 是一款 基于 PHP 开发的 Composer 扩展包,目前已累计 6.54k 次下载、GitHub Stars 达 18, 最近一次更新时间为 2018 年 01 月 10 日, 在 PHP 生态内属于活跃度较高的组件。

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

围绕 lambert/tree-shape 我们能提供哪些服务?
定制开发 / 二次开发

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

BUG 修复 & 性能优化

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

项目外包 & 长期维护

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

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

统计信息

  • 总下载量: 6.54k
  • 月度下载量: 0
  • 日度下载量: 0
  • 收藏数: 19
  • 点击次数: 11
  • 依赖项目数: 0
  • 推荐数: 0

GitHub 信息

  • Stars: 18
  • Watchers: 1
  • Forks: 2
  • 开发语言: PHP

其他信息

  • 授权协议: MIT
  • 更新时间: 2018-01-10