• 下拉列表树形结构


    上级菜单<select id="cc" class="easyui-combotree" style="223px;" name='parentid'
            data-options="url:'<%=request.getContextPath()%>/sysMenu/combolist'">
        @RequestMapping("/combolist")
        public void combolist(HttpServletRequest request,HttpServletResponse response){
                
    
            List<SysMenu> list = null;
            Map<String,Object> params = new HashMap<String,Object>();
            HashMap<String,Object> dataMap = new HashMap<String,Object>();
            
            //查询列表
            list = this.sysMenuService.list(params);
            
            List menuList = new ArrayList<Map>();
            //根菜单
            HashMap<String,Object> menuRootMap = new HashMap<>();
            
            ArrayList<Map<String,Object>> modalArray = new ArrayList<Map<String,Object>>();
            for(SysMenu menuParent : list){
                
                if(menuParent.getParentid() == null || menuParent.getParentid() == 0){
                    menuRootMap.put("id", menuParent.getId());
                    menuRootMap.put("text", menuParent.getName());
                }
                
                
                //二级模块
                if(menuParent.getParentid() == 13){
                    HashMap<String,Object> menuParentMap = new HashMap<String,Object>();
                    ArrayList<Map<String,Object>> childrenList = new ArrayList<Map<String,Object>>() ;
                    menuParentMap.put("id", menuParent.getId());
                    menuParentMap.put("text", menuParent.getName());
                    
                    //菜单
                    for(SysMenu menuChildren : list){
                        
                        if(menuChildren.getParentid().intValue() == menuParent.getId().intValue()){
                            HashMap<String,Object> menuChildrenMap = new HashMap<>();
                            menuChildrenMap.put("id", menuChildren.getId());
                            menuChildrenMap.put("text", menuChildren.getName());
                            
                            childrenList.add(menuChildrenMap);
                        }
                    }
                    menuParentMap.put("children", childrenList);
                    modalArray.add(menuParentMap);
                }
            }
            
            menuRootMap.put("children", modalArray);
            
            menuList.add(menuRootMap);
            
            //HashMap<String,Object> messageMap = new HashMap<String,Object>();
            //messageMap.put("rows", list);
            
            //this.out(response, messageMap);
            this.webOut(response, menuList);
            return;
        }
  • 相关阅读:
    编程填空:第i位替换
    poj 2192 Zipper
    3:拦截导弹
    vijos 1006 晴天小猪历险记之Hill——数字三角形的终极变化
    数字三角形【汇总】
    codevs 1576 最长严格上升子序列
    3299 有序数组合并求第K大问题
    输出数组第k大的元素
    Java线程同步的Monitor机制(Lock配合Condition)
    堆排序Heapsort的Java和C代码
  • 原文地址:https://www.cnblogs.com/cuijinlong/p/7200303.html
Copyright © 2020-2023  润新知