php 递归生成树形菜单,递归生成树形结构菜单

public List listWithTree() {

//1、查出所有菜单

List categoryEntities = categoryDao.selectList(null);

//2、组装成父子的树形结构

//2.1 找到所有的一级分类

List level1Menus = categoryEntities.stream().filter(categoryEntity -> {

return categoryEntity.getParentCid() == 0;

}).map(menu->{

menu.setChildren(getChildrens(menu,categoryEntities));

return menu;

}).sorted((menu1,menu2)->{

return (menu1.getSort()==null?0:menu1.getSort())-(menu2.getSort()==null?0:menu2.getSort());

})

.collect(Collectors.toList());

return level1Menus;

}

//递归找到当前菜单的子菜单

private List getChildrens(CategoryEntity root,List all){

List children = all.stream().filter(categoryEntity -> {

return categoryEntity.getParentCid().equals(root.getCatId());

}).map(categoryEntity -> {

categoryEntity.setChildren(getChildrens(categoryEntity,all));

return categoryEntity;

}).sorted((menu1,menu2)->{

return (menu1.getSort()==null?0:menu1.getSort())-(menu2.getSort()==null?0:menu2.getSort());

}).collect(Collectors.toList());

return children;

}

标签：菜单,return,递归,List,categoryEntity,menu2,树形,menu1,getSort

来源： https://blog.csdn.net/victoyr/article/details/111565348