StoreOrderSuccessServices.php 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655
  1. <?php
  2. // +----------------------------------------------------------------------
  3. // | CRMEB [ CRMEB赋能开发者,助力企业发展 ]
  4. // +----------------------------------------------------------------------
  5. // | Copyright (c) 2016~2023 https://www.crmeb.com All rights reserved.
  6. // +----------------------------------------------------------------------
  7. // | Licensed CRMEB并不是自由软件,未经许可不能去掉CRMEB相关版权
  8. // +----------------------------------------------------------------------
  9. // | Author: CRMEB Team <admin@crmeb.com>
  10. // +----------------------------------------------------------------------
  11. namespace app\services\order;
  12. use app\dao\order\StoreOrderDao;
  13. use app\services\activity\lottery\LuckLotteryServices;
  14. use app\services\activity\combination\StorePinkServices;
  15. use app\services\BaseServices;
  16. use app\services\pay\PayServices;
  17. use app\services\user\UserServices;
  18. use app\services\product\product\StoreProductGiftGroupService;
  19. use app\services\user\UserBrokerageServices;
  20. use crmeb\exceptions\ApiException;
  21. /**
  22. * Class StoreOrderSuccessServices
  23. * @package app\services\order
  24. * @method getOne(array $where, ?string $field = '*', array $with = []) 获取去一条数据
  25. */
  26. class StoreOrderSuccessServices extends BaseServices
  27. {
  28. /**
  29. *
  30. * StoreOrderSuccessServices constructor.
  31. * @param StoreOrderDao $dao
  32. */
  33. public function __construct(StoreOrderDao $dao)
  34. {
  35. $this->dao = $dao;
  36. }
  37. /**
  38. * 0元支付
  39. * @param array $orderInfo
  40. * @param int $uid
  41. * @return bool
  42. * @throws \think\Exception
  43. * @throws \think\db\exception\DataNotFoundException
  44. * @throws \think\db\exception\ModelNotFoundException
  45. * @throws \think\exception\DbException
  46. */
  47. public function zeroYuanPayment(array $orderInfo, int $uid, string $payType = PayServices::YUE_PAY)
  48. {
  49. if ($orderInfo['paid']) {
  50. throw new ApiException(410265);
  51. }
  52. return $this->paySuccess($orderInfo, $payType);//余额支付成功
  53. }
  54. /**
  55. * 支付成功
  56. * @param array $orderInfo
  57. * @param string $paytype
  58. * @param array $other
  59. * @return bool
  60. * @throws \Psr\SimpleCache\InvalidArgumentException
  61. * @throws \think\db\exception\DataNotFoundException
  62. * @throws \think\db\exception\DbException
  63. * @throws \think\db\exception\ModelNotFoundException
  64. */
  65. public function paySuccess(array $orderInfo, string $paytype = PayServices::WEIXIN_PAY, array $other = [])
  66. {
  67. $updata = ['paid' => 1, 'pay_type' => $paytype, 'pay_time' => time()];
  68. $orderInfo['pay_time'] = $updata['pay_time'];
  69. $orderInfo['pay_type'] = $paytype;
  70. if ($other && isset($other['trade_no'])) {
  71. $updata['trade_no'] = $other['trade_no'];
  72. }
  73. /** @var StoreOrderCartInfoServices $orderInfoServices */
  74. $orderInfoServices = app()->make(StoreOrderCartInfoServices::class);
  75. $orderInfo['storeName'] = $orderInfoServices->getCarIdByProductTitle((int)$orderInfo['id']);
  76. $res1 = $this->dao->update($orderInfo['id'], $updata);
  77. $resPink = true;
  78. if ($orderInfo['combination_id'] && $res1 && !$orderInfo['refund_status']) {
  79. /** @var StorePinkServices $pinkServices */
  80. $pinkServices = app()->make(StorePinkServices::class);
  81. /** @var StoreOrderServices $orderServices */
  82. $orderServices = app()->make(StoreOrderServices::class);
  83. $resPink = $pinkServices->createPink($orderServices->tidyOrder($orderInfo, true));//创建拼团
  84. }
  85. //缓存抽奖次数 除过线下支付
  86. if (isset($orderInfo['pay_type']) && $orderInfo['pay_type'] != 'offline') {
  87. /** @var LuckLotteryServices $luckLotteryServices */
  88. $luckLotteryServices = app()->make(LuckLotteryServices::class);
  89. $luckLotteryServices->setCacheLotteryNum((int)$orderInfo['uid'], 'order');
  90. }
  91. $orderInfo['send_name'] = $orderInfo['real_name'];
  92. //订单支付成功后置事件
  93. event('OrderPaySuccessListener', [$orderInfo]);
  94. //用户推送消息事件
  95. event('NoticeListener', [$orderInfo, 'order_pay_success']);
  96. //支付成功给客服发送消息
  97. event('NoticeListener', [$orderInfo, 'admin_pay_success_code']);
  98. // 推送订单
  99. event('OutPushListener', ['order_pay_push', ['order_id' => (int)$orderInfo['id']]]);
  100. //自定义消息-订单支付成功
  101. $orderInfo['time'] = date('Y-m-d H:i:s');
  102. $orderInfo['phone'] = $orderInfo['user_phone'];
  103. event('CustomNoticeListener', [$orderInfo['uid'], $orderInfo, 'order_pay_success']);
  104. //自定义事件-订单支付
  105. event('CustomEventListener', ['order_pay', [
  106. 'uid' => $orderInfo['uid'],
  107. 'id' => (int)$orderInfo['id'],
  108. 'order_id' => $orderInfo['order_id'],
  109. 'real_name' => $orderInfo['real_name'],
  110. 'user_phone' => $orderInfo['user_phone'],
  111. 'user_address' => $orderInfo['user_address'],
  112. 'total_num' => $orderInfo['total_num'],
  113. 'pay_price' => $orderInfo['pay_price'],
  114. 'pay_postage' => $orderInfo['pay_postage'],
  115. 'deduction_price' => $orderInfo['deduction_price'],
  116. 'coupon_price' => $orderInfo['coupon_price'],
  117. 'store_name' => $orderInfo['storeName'],
  118. 'add_time' => date('Y-m-d H:i:s', $orderInfo['add_time']),
  119. ]]);
  120. // 获取购物车信息
  121. $orderCartInfo = $orderInfoServices->getCartColunm(
  122. ['oid' => $orderInfo['id']],
  123. 'cart_info',
  124. 'unique'
  125. );
  126. $orderInfo['cart_info'] = [];
  127. foreach ($orderCartInfo as $k => $v) {
  128. $cart_info = is_string($v) ? json_decode($v, true) : $v;
  129. $orderInfo['cart_info'][] = $cart_info;
  130. }
  131. if ($orderInfo['is_lb'] == 1) {
  132. @file_put_contents('quanju.txt', $orderInfo['lb_spread_uid'] . "-礼包推荐人2\r\n", 8);
  133. self::createGiftRecommendationRelationship($orderInfo); //建立礼包推荐关系
  134. self::giftRecommendationBonus($orderInfo); //礼包升级分红
  135. }
  136. // if ($orderInfo['is_lb'] == 1) { //赠送礼包推荐奖金
  137. // @file_put_contents('quanju.txt', $orderInfo['is_lb'] . "-礼包订单2\r\n", 8);
  138. //
  139. // }
  140. $res = $res1 && $resPink;
  141. return false !== $res;
  142. }
  143. // 礼包商品分额度
  144. public function giftQuota($order){
  145. }
  146. // 创建礼包推荐关系
  147. public function createGiftRecommendationRelationship($order)
  148. {
  149. // @file_put_contents('quanju.txt', json_encode($order) . "-创建礼包推荐关系\r\n", 8);
  150. try {
  151. // 获取用户信息
  152. $userServices = app()->make(UserServices::class);
  153. $user = $userServices->getUserInfo($order['uid']);
  154. @file_put_contents('quanju.txt', $user['spread_uid'] . "-创建礼包推荐关系\r\n", 8);
  155. if ($user['spread_uid'] > 0) {
  156. // 如果用户有推广人,说明是通过推广链接支付的,需要创建礼包推荐关系,关系表是store_product_gift_group,需要保存product_id,uid,group_pid(小组上级),pid(真直推上级),fake_pid(假直推上级(直推上级的下级小组满人下放下来的人)),一个商品加一个pid推荐上级会形成一个小组,第一个加进小组的会是第二个加入的小组上级(group_pid),当一个小组满10人后,就会让第十人作为fake_pid直推上级建立新的10人小组,但pid还是真正的直推上级
  157. // 获取商品ID
  158. $product_id = $order['cart_info'][0]['product_id'] ?? 0;
  159. if (!$product_id) return false;
  160. // 获取推广人UID
  161. $spread_uid = $user['spread_uid'];
  162. // 获取礼包服务
  163. $giftGroupService = app()->make(StoreProductGiftGroupService::class);
  164. // 检查是否已有该商品的推荐关系
  165. $existRelation = $giftGroupService->getOne([
  166. 'product_id' => $product_id,
  167. 'uid' => $order['uid']
  168. ]);
  169. if ($existRelation) return true;
  170. // 检查推广人是否是自己的下级团队成员(防止循环推荐)
  171. if ($this->isSubordinate($order['uid'], $spread_uid, $product_id, $giftGroupService)) {
  172. return false;
  173. }
  174. // 获取直推上级的推荐关系
  175. $parentRelation = $giftGroupService->getOne([
  176. 'product_id' => $product_id,
  177. 'uid' => $spread_uid
  178. ]);
  179. // 设置关系数据
  180. $data = [
  181. 'product_id' => $product_id,
  182. 'uid' => $order['uid'],
  183. 'pid' => $spread_uid, // 真直推上级
  184. 'create_time' => time()
  185. ];
  186. // 处理小组关系
  187. // 获取小组人数上限配置
  188. $groupMaxNum = sys_config('gift_group_num', 10);
  189. // 判断直推上级在该商品下是否有小组成员(包括真直推下级和滑落的假直推下级)
  190. // 查找 fake_id=spread_uid 的小组成员
  191. $spreadFakeIdGroup = $giftGroupService->getList([
  192. 'product_id' => $product_id,
  193. 'fake_pid' => $spread_uid
  194. ], '*', 0, 0, 'create_time ASC');
  195. @file_put_contents('quanju4.txt', count($spreadFakeIdGroup) . "-fake_id=" . $spread_uid . "的小组人数\r\n", 8);
  196. if (count($spreadFakeIdGroup) > 0) {
  197. // 直推上级已有小组成员,需要判断是否需要加入该小组
  198. // 判断该小组是否满人
  199. if (count($spreadFakeIdGroup) < $groupMaxNum) {
  200. // 小组未满,新成员加入该小组,group_pid是该小组的最后一人
  201. $lastMember = end($spreadFakeIdGroup);
  202. $data['group_pid'] = $lastMember['uid'];
  203. $data['fake_pid'] = $spread_uid;
  204. @file_put_contents('quanju4.txt', $lastMember['uid'] . "-小组最后一人,新成员group_pid\r\n", 8);
  205. } else {
  206. // 小组已满,需要滑落到该小组最后一人的直推下级小组
  207. // 最后一人的直推下级小组 = 最后一人的uid作为fake_id的小组
  208. $lastMember = end($spreadFakeIdGroup);
  209. @file_put_contents('quanju4.txt', $lastMember['uid'] . "-小组最后一人uid\r\n", 8);
  210. // 查找最后一人的uid作为fake_id的小组
  211. $lastMemberUidFakeIdGroup = $giftGroupService->getList([
  212. 'product_id' => $product_id,
  213. 'fake_pid' => $lastMember['uid']
  214. ], '*', 0, 0, 'create_time ASC');
  215. @file_put_contents('quanju4.txt', count($lastMemberUidFakeIdGroup) . "-fake_id=" . $lastMember['uid'] . "的小组人数\r\n", 8);
  216. if (count($lastMemberUidFakeIdGroup) < $groupMaxNum) {
  217. // 该小组未满,新成员加入该小组
  218. if (count($lastMemberUidFakeIdGroup) > 0) {
  219. // 该小组已有成员,新成员的group_pid是该小组的最后一人
  220. $lastSubMember = end($lastMemberUidFakeIdGroup);
  221. $data['group_pid'] = $lastSubMember['uid'];
  222. $data['fake_pid'] = $lastMember['uid'];
  223. @file_put_contents('quanju4.txt', $lastSubMember['uid'] . "-fake_id小组最后一人,新成员group_pid,fake_pid=" . $lastMember['uid'] . "\r\n", 8);
  224. } else {
  225. // 该小组没有成员,新成员成为第一人
  226. $data['group_pid'] = 0;
  227. $data['fake_pid'] = $lastMember['uid'];
  228. @file_put_contents('quanju4.txt', '最后一人的uid作为fake_id小组没有成员,新成员成为第一人,fake_pid='. $lastMember['uid'] . "\r\n", 8);
  229. }
  230. } else {
  231. // 该小组也满了,从37的直推小组倒数第二人开始找
  232. // 从后往前遍历37的直推小组,找到第一个未满的uid作为fake_id的小组
  233. $foundGroup = false;
  234. for ($i = count($spreadFakeIdGroup) - 2; $i >= 0; $i--) {
  235. $prevMember = $spreadFakeIdGroup[$i];
  236. @file_put_contents('quanju4.txt', $prevMember['uid'] . "-检查倒数第" . (count($spreadFakeIdGroup) - $i) . "人的uid\r\n", 8);
  237. // 查找该人的uid作为fake_id的小组
  238. $prevMemberUidFakeIdGroup = $giftGroupService->getList([
  239. 'product_id' => $product_id,
  240. 'fake_pid' => $prevMember['uid']
  241. ], '*', 0, 0, 'create_time ASC');
  242. @file_put_contents('quanju4.txt', count($prevMemberUidFakeIdGroup) . "-fake_id=" . $prevMember['uid'] . "的小组人数\r\n", 8);
  243. if (count($prevMemberUidFakeIdGroup) < $groupMaxNum) {
  244. // 该小组未满,新成员加入该小组
  245. if (count($prevMemberUidFakeIdGroup) > 0) {
  246. $lastSubMember = end($prevMemberUidFakeIdGroup);
  247. $data['group_pid'] = $lastSubMember['uid'];
  248. $data['fake_pid'] = $prevMember['uid'];
  249. @file_put_contents('quanju4.txt', $lastSubMember['uid'] . "-fake_id小组最后一人,新成员group_pid,fake_pid=" . $prevMember['uid'] . "\r\n", 8);
  250. } else {
  251. $data['group_pid'] = 0;
  252. $data['fake_pid'] = $prevMember['uid'];
  253. @file_put_contents('quanju4.txt', '倒数人的uid作为fake_id小组没有成员,新成员成为第一人,fake_pid=' . $prevMember['uid'] . "\r\n", 8);
  254. }
  255. $foundGroup = true;
  256. break;
  257. }
  258. }
  259. // 如果所有倒数人的小组都满了,新成员以最后一个倒数人的uid作为fake_id,group_pid=0
  260. if (!$foundGroup) {
  261. $firstPrevMember = $spreadFakeIdGroup[0];
  262. $data['group_pid'] = 0;
  263. $data['fake_pid'] = $firstPrevMember['uid'];
  264. @file_put_contents('quanju4.txt', '所有倒数人的小组都满了,新成员fake_pid=' . $firstPrevMember['uid'] . "\r\n", 8);
  265. }
  266. }
  267. }
  268. } else {
  269. // 直推上级没有下级,这是该推广人的第一个下级,建立新小组
  270. $data['group_pid'] = 0;
  271. $data['fake_pid'] = $spread_uid;
  272. }
  273. // 保存推荐关系
  274. return $giftGroupService->save($data);
  275. }
  276. return false;
  277. } catch (\Exception $e) {
  278. @file_put_contents('quanju4.txt', $e->getMessage() . "-创建订单报错内容\r\n", 8);
  279. @file_put_contents('quanju4.txt', $e->getFile() . "-文件\r\n", 8);
  280. @file_put_contents('quanju4.txt', $e->getLine() . "-位置\r\n", 8);
  281. @file_put_contents('quanju4.txt', $e->getTraceAsString() . "-堆栈\r\n", 8);
  282. }
  283. }
  284. // 礼包上级分红
  285. public function giftRecommendationBonus($order)
  286. {
  287. try {
  288. @file_put_contents('quanju.txt', json_encode($order) . "-礼包上级分红\r\n", 8);
  289. // 获取礼包服务
  290. $giftGroupService = app()->make(StoreProductGiftGroupService::class);
  291. $userServices = app()->make(UserServices::class);
  292. // 检查 cart_info 是否存在且非空
  293. @file_put_contents('quanju4.txt', '开始检查cart_info' . "\r\n", 8);
  294. if (!isset($order['cart_info']) || empty($order['cart_info'])) {
  295. @file_put_contents('quanju4.txt', 'cart_info不存在或为空' . "\r\n", 8);
  296. return false;
  297. }
  298. // 获取商品ID和商品价格作为佣金计算基数
  299. $product_id = $order['cart_info'][0]['product_id'] ?? 0;
  300. $brokerage_price = $order['cart_info'][0]['truePrice'] ?? 0;
  301. @file_put_contents('quanju4.txt', 'product_id=' . $product_id . ', brokerage_price=' . $brokerage_price . "\r\n", 8);
  302. if (!$product_id || !$brokerage_price) {
  303. @file_put_contents('quanju4.txt', 'product_id或brokerage_price为0,返回false' . "\r\n", 8);
  304. return false;
  305. }
  306. @file_put_contents('quanju4.txt', $product_id . "-商品id\r\n", 8);
  307. // 获取用户的推荐关系
  308. $userRelation = $giftGroupService->getOne([
  309. 'product_id' => $product_id,
  310. 'uid' => $order['uid']
  311. ]);
  312. if (!$userRelation) return false;
  313. $userInfo = $userServices->getOne(['uid' => $order['uid']]);
  314. // 获取佣金服务(一次性创建,复用)
  315. /** @var UserBrokerageServices $userBrokerageServices */
  316. $userBrokerageServices = app()->make(UserBrokerageServices::class);
  317. //冻结时间
  318. $frozenTime = time() + intval(sys_config('extract_time')) * 86400;
  319. // 直推上级分成(全部给真直推上级)
  320. $directBrokerage = $brokerage_price * (sys_config('gift_direct_referral', 10) / 100);
  321. @file_put_contents('quanju4.txt', json_encode($userRelation) . "-礼包推荐关系表\r\n", 8);
  322. // 直推奖全部给真直推上级
  323. $pid_brokerage = $userServices->getOne(['uid' => $userRelation['pid']]);
  324. $userServices->bcInc($userRelation['pid'], 'brokerage_price', $directBrokerage, 'uid');
  325. @file_put_contents('quanju4.txt', $directBrokerage . "-直推奖励\r\n", 8);
  326. $balance = bcadd($pid_brokerage['brokerage_price'], $directBrokerage, 2);
  327. $userBrokerageServices->income('get_direct_referral_brokerage', $userRelation['pid'], [
  328. 'nickname' => $userInfo['nickname'],
  329. 'pay_price' => floatval($order['pay_price']),
  330. 'number' => $directBrokerage,
  331. 'frozen_time' => $frozenTime
  332. ], $balance, $order['id']);
  333. // 见点奖处理
  334. $spotBrokerage = $brokerage_price * (sys_config('gift_spot_bonus', 2.5) / 100);
  335. // 1. 向上查找:先找小组上级,没有就找假直推上级
  336. $spotUpLimit = sys_config('gift_spot_bonus_up', 15);
  337. $currentUid = $order['uid']; // 从当前用户开始
  338. $currentRelation = $userRelation; // 当前用户的推荐关系
  339. $originalPid = $userRelation['pid']; // 记录原始用户的真直推上级
  340. $originalFakePid = $userRelation['fake_pid']; // 记录原始用户的假直推上级
  341. $splitRatio = sys_config('gift_fake_pid_split_ratio', 50); // 假直推上级分成比例(给真直推上级的比例)
  342. // 判断原始用户是否是滑落的直推下级(pid != fake_pid)
  343. $isSlippedMember = ($originalPid != $originalFakePid);
  344. $hasGivenToFakePid = false; // 是否已经给fake_id发放过见点奖
  345. // 获取购买用户直推上级的推荐关系,用于判断是否需要分成
  346. $directParentRelation = null;
  347. if ($originalPid > 0) {
  348. $directParentRelation = $giftGroupService->getOne([
  349. 'product_id' => $product_id,
  350. 'uid' => $originalPid
  351. ]);
  352. }
  353. for ($i = 0; $i < $spotUpLimit; $i++) {
  354. $nextUid = null;
  355. // 优先查找小组上级
  356. if (!empty($currentRelation['group_pid'])) {
  357. $nextUid = $currentRelation['group_pid'];
  358. } else if (!empty($currentRelation['fake_pid'])) {
  359. // 没有小组上级,查找假直推上级
  360. $nextUid = $currentRelation['fake_pid'];
  361. }
  362. // 找不到上级,退出循环
  363. if (!$nextUid) break;
  364. // 判断是否需要分成
  365. $needSplit = false;
  366. $splitTargetPid = null; // 分成的目标pid(真直推上级)
  367. @file_put_contents('quanju4.txt', '分成判断检查: i=' . $i . ', currentUid=' . $currentUid . ', nextUid=' . $nextUid . ', currentRelation[fake_pid]=' . ($currentRelation['fake_pid'] ?? 'null') . ', currentRelation[pid]=' . ($currentRelation['pid'] ?? 'null') . "\r\n", 8);
  368. // 情况1:购买用户是滑落的,且第一次给fake_id发放
  369. if ($isSlippedMember && !$hasGivenToFakePid && $nextUid == $originalFakePid && $originalFakePid != $originalPid) {
  370. $needSplit = true;
  371. $splitTargetPid = $originalPid;
  372. $hasGivenToFakePid = true;
  373. @file_put_contents('quanju4.txt', '分成原因:购买用户是滑落的,第一次给fake_id发放' . "\r\n", 8);
  374. }
  375. // 情况2:购买用户的直推上级是滑落的,且第一次给该直推上级的fake_id发放
  376. // 判断条件:nextUid 是购买用户直推上级的 fake_id,且直推上级是滑落的
  377. else if (!$hasGivenToFakePid && $directParentRelation && !empty($directParentRelation['fake_pid']) && $nextUid == $directParentRelation['fake_pid'] && $directParentRelation['pid'] != $directParentRelation['fake_pid']) {
  378. $needSplit = true;
  379. $splitTargetPid = $directParentRelation['pid'];
  380. $hasGivenToFakePid = true;
  381. @file_put_contents('quanju4.txt', '分成原因:购买用户的直推上级是滑落的,第一次给该直推上级的fake_id发放' . "\r\n", 8);
  382. }
  383. @file_put_contents('quanju4.txt', '分成判断结果: needSplit=' . ($needSplit ? 'true' : 'false') . ($needSplit ? ', splitTargetPid=' . $splitTargetPid : '') . "\r\n", 8);
  384. if ($needSplit && $splitTargetPid) {
  385. // 需要分成:给真直推上级和假直推上级分别发放
  386. $splitAmount = $spotBrokerage * ($splitRatio / 100); // 给真直推上级的份额
  387. $remainderAmount = $spotBrokerage - $splitAmount; // 给假直推上级的份额
  388. // 给真直推上级发放
  389. $pidBrokerage = $userServices->getOne(['uid' => $splitTargetPid]);
  390. $userServices->bcInc($splitTargetPid, 'brokerage_price', $splitAmount, 'uid');
  391. $balance = bcadd($pidBrokerage['brokerage_price'], $splitAmount, 2);
  392. $userBrokerageServices->income('get_spot_brokerage', $splitTargetPid, [
  393. 'nickname' => $userInfo['nickname'],
  394. 'pay_price' => floatval($order['pay_price']),
  395. 'number' => $splitAmount,
  396. 'frozen_time' => $frozenTime
  397. ], $balance, $order['id']);
  398. @file_put_contents('quanju4.txt', '向上发放见点奖给真直推上级: uid=' . $splitTargetPid . ', 金额=' . $splitAmount . "\r\n", 8);
  399. // 给假直推上级发放
  400. $currentBrokerage = $userServices->getOne(['uid' => $nextUid]);
  401. $userServices->bcInc($nextUid, 'brokerage_price', $remainderAmount, 'uid');
  402. $balance = bcadd($currentBrokerage['brokerage_price'], $remainderAmount, 2);
  403. $userBrokerageServices->income('get_spot_brokerage', $nextUid, [
  404. 'nickname' => $userInfo['nickname'],
  405. 'pay_price' => floatval($order['pay_price']),
  406. 'number' => $remainderAmount,
  407. 'frozen_time' => $frozenTime
  408. ], $balance, $order['id']);
  409. @file_put_contents('quanju4.txt', '向上发放见点奖给假直推上级: uid=' . $nextUid . ', 金额=' . $remainderAmount . "\r\n", 8);
  410. } else {
  411. // 不需要分成:全部给上级
  412. $currentBrokerage = $userServices->getOne(['uid' => $nextUid]);
  413. $userServices->bcInc($nextUid, 'brokerage_price', $spotBrokerage, 'uid');
  414. $balance = bcadd($currentBrokerage['brokerage_price'], $spotBrokerage);
  415. $userBrokerageServices->income('get_spot_brokerage', $nextUid, [
  416. 'nickname' => $userInfo['nickname'],
  417. 'pay_price' => floatval($order['pay_price']),
  418. 'number' => $spotBrokerage,
  419. 'frozen_time' => $frozenTime
  420. ], $balance, $order['id']);
  421. @file_put_contents('quanju4.txt', '向上发放见点奖: uid=' . $nextUid . ', 金额=' . $spotBrokerage . "\r\n", 8);
  422. }
  423. // 更新当前用户ID,用于下一次循环的判断
  424. $currentUid = $nextUid;
  425. // 查找下一个上级的推荐关系
  426. $currentRelation = $giftGroupService->getOne([
  427. 'product_id' => $product_id,
  428. 'uid' => $nextUid
  429. ]);
  430. // 如果找不到推荐关系,退出循环
  431. if (!$currentRelation) break;
  432. }
  433. // 2. 向下查找:先找直推下级,不够再找同组下级
  434. $spotDownLimit = sys_config('gift_spot_bonus_down', 15);
  435. $totalDownSpots = 0;
  436. // 2.1 先找直推下级
  437. $directSubordinates = $giftGroupService->getList([
  438. 'product_id' => $product_id,
  439. 'pid' => $order['uid']
  440. ], '*', 0, $spotDownLimit, 'create_time asc');
  441. foreach ($directSubordinates as $subordinate) {
  442. $subBrokerage = $userServices->getOne(['uid' => $subordinate['uid']]);
  443. $userServices->bcInc($subordinate['uid'], 'brokerage_price', $spotBrokerage, 'uid');
  444. $balance = bcadd($subBrokerage['brokerage_price'], $spotBrokerage);
  445. $userBrokerageServices->income('get_spot_brokerage', $subordinate['uid'], [
  446. 'nickname' => $userInfo['nickname'],
  447. 'pay_price' => floatval($order['pay_price']),
  448. 'number' => $spotBrokerage,
  449. 'frozen_time' => $frozenTime
  450. ], $balance, $order['id']);
  451. @file_put_contents('quanju4.txt', '向下发放见点奖给直推下级: uid=' . $subordinate['uid'] . ', 金额=' . $spotBrokerage . "\r\n", 8);
  452. $totalDownSpots++;
  453. }
  454. // 2.2 如果直推下级不够,找同组下级
  455. if ($totalDownSpots < $spotDownLimit) {
  456. // 获取所有pid与当前用户pid相同的同级用户
  457. $samePidMembers = $giftGroupService->getList([
  458. 'product_id' => $product_id,
  459. 'pid' => $userRelation['pid']
  460. ], '*', 0, 0, 'create_time asc');
  461. // 找到当前用户在同级用户中的位置
  462. $currentIndex = null;
  463. foreach ($samePidMembers as $index => $member) {
  464. if ($member['uid'] == $order['uid']) {
  465. $currentIndex = $index;
  466. break;
  467. }
  468. }
  469. // 从当前用户之后的同级用户开始,查找同组下级
  470. if ($currentIndex !== null) {
  471. for ($i = $currentIndex + 1; $i < count($samePidMembers) && $totalDownSpots < $spotDownLimit; $i++) {
  472. $member = $samePidMembers[$i];
  473. // 检查这个同级用户的group_pid层级是否在当前用户或其下级中
  474. $isGroupSubordinate = $this->isGroupSubordinate($order['uid'], $member['group_pid'], $product_id, $giftGroupService);
  475. if ($isGroupSubordinate) {
  476. $memberBrokerage = $userServices->getOne(['uid' => $member['uid']]);
  477. $userServices->bcInc($member['uid'], 'brokerage_price', $spotBrokerage, 'uid');
  478. $balance = bcadd($memberBrokerage['brokerage_price'], $spotBrokerage);
  479. $userBrokerageServices->income('get_spot_brokerage', $member['uid'], [
  480. 'nickname' => $userInfo['nickname'],
  481. 'pay_price' => floatval($order['pay_price']),
  482. 'number' => $spotBrokerage,
  483. 'frozen_time' => $frozenTime
  484. ], $balance, $order['id']);
  485. @file_put_contents('quanju4.txt', '向下发放见点奖给同组下级: uid=' . $member['uid'] . ', 金额=' . $spotBrokerage . "\r\n", 8);
  486. $totalDownSpots++;
  487. }
  488. }
  489. }
  490. }
  491. return true;
  492. } catch (\Exception $e) {
  493. @file_put_contents('quanju4.txt', $e->getMessage() . "-上级分红报错内容\r\n", 8);
  494. @file_put_contents('quanju4.txt', $e->getFile() . "-文件\r\n", 8);
  495. @file_put_contents('quanju4.txt', $e->getLine() . "-位置\r\n", 8);
  496. @file_put_contents('quanju4.txt', $e->getTraceAsString() . "-堆栈\r\n", 8);
  497. }
  498. }
  499. /**
  500. * 检查某个用户是否是另一个用户的小组下级(通过group_pid层级关系)
  501. * @param int $baseUid 基准用户uid
  502. * @param int $groupPid 要检查的group_pid
  503. * @param int $productId 商品ID
  504. * @param StoreProductGiftGroupService $giftGroupService 礼包服务
  505. * @param array $checked 已检查的用户(防止循环)
  506. * @return bool 如果是小组下级返回true,否则返回false
  507. */
  508. protected function isGroupSubordinate($baseUid, $groupPid, $productId, $giftGroupService, $checked = [])
  509. {
  510. // 如果已经检查过这个groupPid,跳过(防止循环)
  511. if (isset($checked[$groupPid])) {
  512. return false;
  513. }
  514. $checked[$groupPid] = true;
  515. // 如果groupPid是0,说明没有小组关系
  516. if (empty($groupPid)) {
  517. return false;
  518. }
  519. // 如果groupPid等于基准用户,说明是直接下级
  520. if ($groupPid == $baseUid) {
  521. return true;
  522. }
  523. // 递归检查group_pid是否是基准用户的下级
  524. $member = $giftGroupService->getOne([
  525. 'product_id' => $productId,
  526. 'uid' => $groupPid
  527. ]);
  528. if ($member) {
  529. // 继续检查这个用户的group_pid
  530. return $this->isGroupSubordinate($baseUid, $member['group_pid'], $productId, $giftGroupService, $checked);
  531. }
  532. return false;
  533. }
  534. /**
  535. * 检查某个用户是否是另一个用户的下级团队成员
  536. * @param int $uid 当前用户
  537. * @param int $targetUid 要检查的目标用户
  538. * @param int $productId 商品ID
  539. * @param StoreProductGiftGroupService $giftGroupService 礼包服务
  540. * @param array $checked 已检查的用户(防止循环)
  541. * @return bool 如果是下级返回true,否则返回false
  542. */
  543. protected function isSubordinate($uid, $targetUid, $productId, $giftGroupService, $checked = [])
  544. {
  545. // 如果已经检查过这个用户,跳过(防止循环)
  546. if (isset($checked[$uid])) {
  547. return false;
  548. }
  549. $checked[$uid] = true;
  550. // 查找该用户的所有直推下级
  551. $subordinates = $giftGroupService->getList([
  552. 'product_id' => $productId,
  553. 'pid' => $uid
  554. ], 'uid', 0, 0, 'create_time asc');
  555. // 检查目标用户是否在直推下级中
  556. foreach ($subordinates as $sub) {
  557. if ($sub['uid'] == $targetUid) {
  558. return true; // 找到了,是下级
  559. }
  560. }
  561. // 递归检查每个下级的下级
  562. foreach ($subordinates as $sub) {
  563. if ($this->isSubordinate($sub['uid'], $targetUid, $productId, $giftGroupService, $checked)) {
  564. return true; // 在下级的下级中找到了
  565. }
  566. }
  567. return false; // 没找到,不是下级
  568. }
  569. }