zoukankan      html  css  js  c++  java
  • Using X++ code to Running Obeject

    Using x++ code running some of Common object.

    remark by Jimmy Dec. 21th 2010

    void clicked()
    {
    UtilIdElements _UtilIdElements;
    MenuFunction MF;
    treeNode treeNode;
    xInfo xInfo
    = new xInfo();
    sysTableBrowser sysTableBrowser;
    #AOT
    ;
    // winAPI::shellExecute(UtilIdElements.name);
    // select firstonly _UtilIdElements
    // where _UtilIdElements.name == UtilIdElements.name
    // && _UtilIdElements.recordType == UtilElementType::Menu;
    // if(_UtilIdElements)

    switch(UtilIdElements.recordType)
    {
    case UtilElementType::DisplayTool :
    smmUtility::openMenuItemForm(UtilIdElements.name,UtilIdElements,
    null,false);

    break;
    case UtilElementType::ActionTool :
    MF
    = New MenuFunction(UtilIdElements.name,MenuItemType::Action);
    MF.run();
    break;
    case UtilElementType::OutputTool :
    MF
    = New MenuFunction(UtilIdElements.name,MenuItemType::Output);
    MF.run();
    break;
    case UtilElementType::Job :
    if(!Box::yesNo('Are you sure running this Job? may be affect some data.please know!',DialogButton::No,'Running job'))
    return ;

    treeNode
    = xInfo.rootNode();
    treeNode
    = treeNode::findNode("Jobs").AOTfindChild(UtilIdElements.name);
    treeNode.AOTrun();
    break;
    case UtilElementType::Table :
    /*
    treeNode = treeNode::findNode(#tablespath);
    treeNode = treeNode.AOTfindChild(UtilIdElements.name);
    treeNode.AOTrun();
    */
    sysTableBrowser
    = new sysTableBrowser();
    sysTableBrowser.setAllowEdit(
    true);
    SysTableBrowser.setAllowDelete(
    true);
    sysTableBrowser.Run(tableName2Id(UtilIdElements.name));
    break;
    case UtilElementType::Form :
    treeNode
    = treeNode::findNode(#FormsPath);
    treeNode
    = treeNode.AOTfindChild(UtilIdElements.name);
    treeNode.AOTrun();
    break;
    default :

    break;
    }

    }
  • 相关阅读:
    51nod 1284:2 3 5 7的倍数 容斥原理
    POJ 2006:Litmus Test 化学公式
    POJ 2039:To and Fro
    POJ 2014:Flow Layout 模拟水题
    南阳722--数独(Dfs)
    Poj2377--Bad Cowtractors(最大生成树)
    并查集知识点总结
    Poj1861--Network(最小生成树)
    杭电2824--The Euler function(欧拉函数)
    杭电1284--钱币兑换问题(有趣)
  • 原文地址:https://www.cnblogs.com/Fandyx/p/1912733.html
Copyright © 2011-2022 走看看