zoukankan      html  css  js  c++  java
  • eas左树右表基础资料界面引用为左树右表F7的简单方法

    age:  
    /**
    * 加载配件F7(左树右表)
    * @param F7Filed           要加载的F7控件
    * @param ctx               界面上下文
    * @单据中用法示例
    *      final KDBizPromptBox kdtEntrys_accessories_PromptBox = new KDBizPromptBox();
    *      CommonUtil.loadAccessoriesF7PromptBox(kdtEntrys_accessories_PromptBox, this.getUIContext());
    * @throws Exception  
    */  
    public static void loadAccessoriesF7PromptBox(final KDBizPromptBox F7Filed, Map ctx) throws Exception {  
        F7Filed.setQueryInfo("com.kingdee.eas.mydep.assetmanage.database.app.AccessoriesQuery");  
        F7Filed.setEntityViewInfo(new EntityViewInfo("where state=1"));  
        F7Filed.setDisplayFormat("$name$");  
        F7Filed.setEditFormat("$number$");  
        F7Filed.setCommitFormat("$number$");  
            F7Filed.addSelectorListener(new SelectorListener() {  
                AccessoriesListUI accessoriesF7UI = null;  
                public void willShow(SelectorEvent e) {  
                    if (accessoriesF7UI == null) {  
                        try {  
                            accessoriesF7UI = new AccessoriesListUI();  
                            HashMap ctx = new HashMap();  
                            ctx.put("bizUIOwner", javax.swing.SwingUtilities.getWindowAncestor(accessoriesF7UI));  
                            accessoriesF7UI.setF7Use(true, ctx);  
                        accessoriesF7UI.setFilterForQuery(new FilterInfo("state=1"));  
                    } catch (ParserException e1) {  
                        e1.printStackTrace();  
                    } catch (Exception e2) {  
                        e2.printStackTrace();  
                    }  
                        F7Filed.setSelector(accessoriesF7UI);  
                    }  
                }  
        });  
  • 相关阅读:
    jQuery火箭图标返回顶部代码
    jQuery火箭图标返回顶部代码
    Rng(求逆元)
    P1306 斐波那契公约数(ksm+结论)
    sort(桶排序+hash)
    牛客多校训练AFJ(签到)
    Educational Codeforces Round 68 (Rated for Div. 2)-D. 1-2-K Game
    Educational Codeforces Round 68 (Rated for Div. 2)-C-From S To T
    The Unique MST(最小生成树的唯一性判断)
    飞跃原野(三维bfs)
  • 原文地址:https://www.cnblogs.com/luojiabao/p/10964419.html
Copyright © 2011-2022 走看看