zoukankan      html  css  js  c++  java
  • 找出整个AX系统使用某个扩展类型的所有表和字段

    1,运行下列的job即可。

    2,本例子是以扩展类型itemID为例说明的,可以修改为任何扩展类型。

    完整job演示:

    static void ListFields(Args _args)
    {
        int                 curFieldNum =extendedTypeNum('ITEMID');
        str 100             curFieldDESC;
        Dictionary          dictionary = new Dictionary();
        DictTable           dictTable;
        DictField           DictField;
        str                 TableType;
        int                 i,j;
        ;
        for (i=1; i<=dictionary.tableCnt(); i++)
        {
            dictTable = new DictTable(dictionary.tableCnt2Id(i));

            if (dictTable.isTmp())
                TableType='Tmp';
            else if (dictTable.isSystemTable())
                TableType='Sys';
            else if (dictTable.isMap())
                TableType='Map';
            else if (dictTable.isView())
                TableType='View';
            else
                TableType='Normal';

            if (!dictTable.isTmp() && !dictTable.isSystemTable() && !dictTable.isMap() && !dictTable.isView())
            {
                 for (j=1;j<=dictTable.fieldCnt();j++)
                 {
                    DictField=new DictField(dictTable.id(),dictTable.fieldCnt2Id(j));
                    if ((TableType=='Normal') && (DictField.typeId()==curFieldNum))
                    {
                      curFieldDESC='Table Name: '+dictTable.name();
                      curFieldDESC+=' , Field Name: '+DictField.name();
                      info(curFieldDESC);
                      break;
                    }
                    else
                        continue;
                }
            }
        }
    }

  • 相关阅读:
    BZOJ1001 狼抓兔子 终于过了!
    BZOJ 1901: Zju2112 Dynamic Rankings( 树状数组套主席树 )
    BZOJ 2302: [HAOI2011]Problem c( dp )
    BZOJ 1407: [Noi2002]Savage( 数论 )
    BZOJ 2661: [BeiJing wc2012]连连看( 费用流 )
    BZOJ 1021: [SHOI2008]Debt 循环的债务( dp )
    BZOJ 3170: [Tjoi 2013]松鼠聚会( sort )
    BZOJ 2301: [HAOI2011]Problem b( 数论 )
    BZOJ 2434: [Noi2011]阿狸的打字机( AC自动机 + DFS序 + 树状数组 )
    BZOJ 3231: [Sdoi2008]递归数列( 矩阵快速幂 )
  • 原文地址:https://www.cnblogs.com/perock/p/2205354.html
Copyright © 2011-2022 走看看