feat(partner): 升级创客平级收益支持两代级联机制与单元测试用例

这个提交包含在:
chen
2026-09-17 13:58:02 +08:00
父节点 9ee5e06e89
当前提交 f932442c1d
共有 9 个文件被更改,包括 1047 次插入 和 138 次删除

查看文件

@@ -3,7 +3,7 @@
namespace addons\shopro\service\partner;
/**
* 创客平级 10% / 被超越 5%,只一层
* 创客平级(支持两代级联:第1代10%,第2代上级收益10%)/ 被超越 5%(只一层)
*/
class MakerPeerReward
{
@@ -12,6 +12,7 @@ class MakerPeerReward
$bonus = PartnerConfig::makerBonus();
$peerRate = (float) PartnerConfig::get('partner_maker_peer_rate', 0.10);
$overRate = (float) PartnerConfig::get('partner_maker_overtaken_rate', 0.05);
$maxPeerGenerations = (int) PartnerConfig::get('partner_maker_peer_max_generations', 2);
$paid = $diffResult['paid'] ?? [];
$indexByUser = [];
foreach ($chain as $i => $node) {
@@ -23,26 +24,62 @@ class MakerPeerReward
if ($from < 0) {
continue;
}
$peer = $this->findUp($chain, $from + 1, function ($node) use ($item) {
return intval($node['level']) === intval($item['level']);
});
if (!$peer) {
continue;
}
$levelBonus = (float) ($bonus[$item['level']] ?? 0);
$amount = round($levelBonus * $peerRate, 2);
if (!$active->isActive($peer['agent'] ?? $peer)) {
PartnerRewardService::writeSkip($order, $buyerId, $peer['user_id'], 'maker_peer', 'maker', 'inactive_30d', '平级创客 30 日无自购');
continue;
$currentFrom = $from;
$currentBase = $levelBonus;
$sourceUserId = $item['user_id'];
for ($gen = 1; $gen <= $maxPeerGenerations; $gen++) {
$peerIdx = $this->findUpIndex($chain, $currentFrom + 1, function ($node) use ($item) {
return intval($node['level']) === intval($item['level']);
});
if ($peerIdx < 0) {
break;
}
$peer = $chain[$peerIdx];
$amount = round($currentBase * $peerRate, 2);
if (!$active->isActive($peer['agent'] ?? $peer)) {
PartnerRewardService::writeSkip(
$order,
$buyerId,
$peer['user_id'],
'maker_peer',
'maker',
'inactive_30d',
"平级创客(第{$gen}代) 30 日无自购"
);
} else {
if ($amount > 0) {
PartnerRewardService::account(
$order,
$buyerId,
$peer['user_id'],
'maker_peer',
'maker',
$amount,
$currentBase,
[
'generation' => $gen,
'formula' => "平级(第{$gen}代) {$currentBase} × " . ($peerRate * 100) . "% = {$amount}",
'from_user_id' => $sourceUserId,
'level' => $item['level'],
]
);
}
}
// 下一代平级的寻源起点与计算基数:以当前平级创客为基础,基数变为当前平级奖金(即 6.00)
$currentFrom = $peerIdx;
$currentBase = $amount;
$sourceUserId = $peer['user_id'];
if ($currentBase <= 0) {
break;
}
}
if ($amount <= 0) {
continue;
}
PartnerRewardService::account($order, $buyerId, $peer['user_id'], 'maker_peer', 'maker', $amount, $levelBonus, [
'formula' => "平级 {$levelBonus} × " . ($peerRate * 100) . "% = {$amount}",
'from_user_id' => $item['user_id'],
'level' => $item['level'],
]);
}
if (empty($paid)) {
@@ -70,13 +107,19 @@ class MakerPeerReward
]);
}
protected function findUp($chain, $start, $matcher)
protected function findUpIndex($chain, $start, $matcher)
{
for ($i = $start; $i < count($chain); $i++) {
if ($matcher($chain[$i])) {
return $chain[$i];
return $i;
}
}
return null;
return -1;
}
protected function findUp($chain, $start, $matcher)
{
$idx = $this->findUpIndex($chain, $start, $matcher);
return $idx >= 0 ? $chain[$idx] : null;
}
}