Commit d5e60650 authored by codezwjava's avatar codezwjava

扫码注册用户,修改直推和当前所在团队的数据维护逻辑

parent d88bf12e
...@@ -217,15 +217,17 @@ public class UserServiceImpl extends ServiceImpl<UsersMapper, User> implements U ...@@ -217,15 +217,17 @@ public class UserServiceImpl extends ServiceImpl<UsersMapper, User> implements U
if (null == userIdByIntive) { if (null == userIdByIntive) {
R.error(1, "用户推荐人邀请码不存在,请填写正确的邀请码"); R.error(1, "用户推荐人邀请码不存在,请填写正确的邀请码");
} else { } else {
//上级用户的直推信息 普通用户数量+1 // //上级用户的直推信息 普通用户数量+1
RecommendUser recommendUserMapperByUserId = recommendUserMapper.getByUserId(userIdByIntive); // RecommendUser recommendUserMapperByUserId = recommendUserMapper.getByUserId(userIdByIntive);
Integer normalUserNum = recommendUserMapperByUserId.getNormalUserNum(); // Integer normalUserNum = recommendUserMapperByUserId.getNormalUserNum();
recommendUserMapperByUserId.setNormalUserNum(normalUserNum + 1); // recommendUserMapperByUserId.setNormalUserNum(normalUserNum + 1);
recommendUserMapper.updateById(recommendUserMapperByUserId); // recommendUserMapper.updateById(recommendUserMapperByUserId);
//通过用户的userid和推荐人邀请码 设置当前用户的上级直推数据和当前用户所在团队的团队数据
aerialDeliveryUserService.userSetBeinviteCode(userId,beInvitedCode);
} }
//递归向上修改团队用户信息表 //递归向上修改团队用户信息表
teamUserInfo(beInvitedCode); // teamUserInfo(beInvitedCode);
Map map = new HashMap(); Map map = new HashMap();
R.ok("注册成功!", 0); R.ok("注册成功!", 0);
map.put("code", 0); map.put("code", 0);
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment