2019-7-9工作总结

1：easyUi在主页面打开一级窗口，在一级窗口上打开二级窗口，如果两个窗口的id相同，则先打开的窗口会被干掉。（在开发中想获取被干掉的窗口中表格信息报错，都已经被干掉了咋获取？）

2：easyui  $('#modelTable').datagrid({}}

其中 fitColumns：true 表格自适应

        pagination：true 开启分页

{
    field : 'goodsName',
    title:'模型',
    width : 200,
    formatter : function(value, row, index) {
        return row.fileName+'.'+row.fileSuffix;
    }
},（记住 filed一定要写！filed一定要写！filed一定要写！否则格式会错乱）

3 ：url路径一定要检查准确，并且记得加“/”。如果路径不对的话，可以在后台加断点，若没进到后台就是前端的问题。

4 ：url也可以传递数组，在js中先将数组转为json对象，再采用$.param()讲对象序列化。其实实际路径中key相同只是value不同

前段发送

var data={ids:ids}
var ids=$.param(data);
window.location.href=ctx+'/projectModel/exportModel?'+ids;

后台接受

@RequestMapping(value = "/exportModel")
@ResponseBody
public void exportModel(@RequestParam("ids[]") List<String> ids） {}

5：js方法打开新页面，在后面跟该页面的方法会失效，应该在该页面初始化的时候调用。

6：树的广度优先遍历与深度优先遍历

public class TreeNode<T> {

    private T data;
    private List<TreeNode<T>> nodes = new LinkedList<TreeNode<T>>();
    public TreeNode(){

    }

    public void setNodes(List<TreeNode<T>> nodes) {
        this.nodes = nodes;
    }

    public TreeNode(T data) {
        super();
        this.data = data;

    }
    public T getData() {
        return data;
    }
    public void setData(T data) {
        this.data = data;
    }

    public void addNode(TreeNode<T> node){
        nodes.add(node);
    }
    public  List<TreeNode<T>> getNodes(){
        return nodes;
    }
}

public class TreeNdoeTest {
    public static void main(String[] args ){
        TreeNode<String>treeNode=new TreeNode<>("root");
        List<TreeNode<String>>treeNodeList=new LinkedList<TreeNode<String>>();
        TreeNode<String>treeNode1=new TreeNode<>("1");
        TreeNode<String>treeNode2=new TreeNode<>("2");
        List<TreeNode<String>>treeNodeList1=new LinkedList<TreeNode<String>>();
        treeNodeList1.add(new TreeNode<>("3"));
        treeNodeList1.add(new TreeNode<>("4"));
        treeNodeList1.add(new TreeNode<>("5"));
        List<TreeNode<String>>treeNodeList2=new LinkedList<TreeNode<String>>();
        treeNodeList2.add(new TreeNode<>("6"));
        treeNodeList2.add(new TreeNode<>("7"));
        treeNode1.setNodes(treeNodeList1);
        treeNode2.setNodes(treeNodeList2);
        treeNodeList.add(treeNode1);
        treeNodeList.add(treeNode2);
        treeNode.setNodes(treeNodeList);
        System.out.println("广度优先遍历");
        System.out.println(treeNode.getData());
        test(treeNode.getNodes());
        System.out.println("深度优先遍历");
        test(treeNode);
    }
    public static void test( List<TreeNode<String>>treeNodeList){
        if(treeNodeList.size()>0){
            for(TreeNode<String>treeNode1:treeNodeList){
                System.out.print(treeNode1.getData()+" ");
            }
            System.out.println(" ");
            List<TreeNode<String>>treeNodeList1=new LinkedList<TreeNode<String>>();
            for(TreeNode<String>treeNode1:treeNodeList){
                List<TreeNode<String>> treeNodeList2=treeNode1.getNodes();
                if(treeNodeList2.size()>0){
                    for(TreeNode<String>treeNode2:treeNodeList2){
                        treeNodeList1.add(treeNode2);
                    }
                }
            }
            test(treeNodeList1);
        }
    }
    public static void test(TreeNode<String>treeNode){
        System.out.println(treeNode.getData());
        List<TreeNode<String>> treeNodeList=treeNode.getNodes();
        if(treeNodeList.size()>0){
            for(TreeNode<String> treeNode1:treeNodeList){
                test(treeNode1);
            }
        }
    }
}