| | |
| | | * @return |
| | | */ |
| | | @Override |
| | | public AjaxResult listWithTree() { |
| | | public AjaxResult listWithTree(Integer depth) { |
| | | |
| | | List<ZInfoUser> allPeopleList = list(); |
| | | List<ZInfoUser> result = null; |
| | |
| | | |
| | | } |
| | | |
| | | @Override |
| | | public AjaxResult listMySelfAndSpouse(Long id) { |
| | | LambdaQueryWrapper<ZInfoUser> lqw1 = new LambdaQueryWrapper<>(); |
| | | lqw1.eq(ZInfoUser::getUserId,id); |
| | | ZInfoUser myself = getOne(lqw1); |
| | | Long spouseId = myself.getSpouseId(); |
| | | |
| | | LambdaQueryWrapper<ZInfoUser> lqw2 = new LambdaQueryWrapper<>(); |
| | | lqw2.eq(ZInfoUser::getUserId,spouseId); |
| | | ZInfoUser spouse = getOne(lqw2); |
| | | |
| | | ArrayList<ZInfoUser> zInfoUsers = new ArrayList<>(); |
| | | zInfoUsers.add(myself); |
| | | zInfoUsers.add(spouse); |
| | | |
| | | return AjaxResult.success(zInfoUsers); |
| | | } |
| | | |
| | | /** |
| | | * 递归算法 |
| | | * @param people |
| | |
| | | * @return |
| | | */ |
| | | private List<ZInfoUser> fillChildren(ZInfoUser people, List<ZInfoUser> allPeopleList) { |
| | | return allPeopleList.stream().filter( |
| | | |
| | | // TODO: 2023-05-05 控制递归的次数 |
| | | |
| | | List<ZInfoUser> collect = allPeopleList.stream().filter( |
| | | one -> one.getFatherId() == people.getUserId() || one.getMomId() == people.getUserId() |
| | | ).map( |
| | | one -> { |
| | |
| | | } |
| | | ).collect(Collectors.toList()); |
| | | |
| | | return collect; |
| | | |
| | | } |
| | | |
| | | |