Search by 
frcstc / luatree
lua and redis tree
v1.0
2020-06-08 09:07 UTC
Requires
- php: >=7.2
- ext-swoole: >=4.4
- hyperf/di: 1.1.*
- hyperf/framework: 1.1.*
Requires (Dev)
- friendsofphp/php-cs-fixer: ^2.14
- hyperf/testing: 1.1.*
- phpstan/phpstan: ^0.10.5
- swoft/swoole-ide-helper: dev-master
This package is auto-updated.
Last update: 2025-03-20 19:04:30 UTC
README
composer require frcstc/luatree
利用 redis + lua实现多层级递归查询
使用方法：
$addNode1 = new AddNode([
'userId' => 'test1', //用户标识
'inviteUserId' => 'test2',//上级或邀请人标识
'userLevelId' => 1, //用户等级
'childrenIds' => [],// 直属下级
]);
$addNode2 = new AddNode([
'userId' => 'test2',
'inviteUserId' => 'test3',
'userLevelId' => 2,
'childrenIds' => ['test1'],
]);
$addNode3 = new AddNode([
'userId' => 'test3',
'inviteUserId' => 'test4',
'userLevelId' => 3,
'childrenIds' => ['test2'],
]);
$addNode4 = new AddNode([
'userId' => 'test4',
'inviteUserId' => '',
'userLevelId' => 4,
'childrenIds' => ['test3'],
]);
//存入缓存
$hashKey = "userTestHash"; //redis hset的 key
$treeUtil = new TreeUtil();
$treeUtil->add($hashKey, $addNode1);
$treeUtil->add($hashKey, $addNode2);
$treeUtil->add($hashKey, $addNode3);
$treeUtil->add($hashKey, $addNode4);
// 获取所有父节点
$treeUtil->getParent($hashKey, 'test1');
// 获取所有子节点
$treeUtil->getChildrenList($hashKey, 'test4');