Java SupportedHierarchy.getAssociationIds方法代码示例

import org.LexGrid.naming.SupportedHierarchy; //导入方法依赖的package包/类
public HashMap getTreePathData(LexBIGService lbsvc, LexBIGServiceConvenienceMethods lbscm, String scheme,
        CodingSchemeVersionOrTag csvt, SupportedHierarchy hierarchyDefn, String focusCode) throws LBException {
    HashMap hmap = new HashMap();
    TreeItem ti = new TreeItem("<Root>", "Root node");
    long ms = System.currentTimeMillis();
    int pathsResolved = 0;
    try {

        // Resolve 'is_a' hierarchy info. This example will
        // need to make some calls outside of what is covered
        // by existing convenience methods, but we use the
        // registered hierarchy to prevent need to hard code
        // relationship and direction info used on lookup ...
        String hierarchyID = hierarchyDefn.getLocalId();
        String[] associationsToNavigate = hierarchyDefn.getAssociationIds();
        boolean associationsNavigatedFwd = hierarchyDefn.getIsForwardNavigable();

        // Identify the set of all codes on path from root
        // to the focus code ...
        Map<String, EntityDescription> codesToDescriptions = new HashMap<String, EntityDescription>();
        AssociationList pathsFromRoot = getPathsFromRoot(lbsvc, lbscm, scheme, csvt, hierarchyID, focusCode,
                codesToDescriptions);

        // Typically there will be one path, but handle multiple just in
        // case.  Each path from root provides a 'backbone', from focus
        // code to root, for additional nodes to hang off of in our
        // printout. For every backbone node, one level of children is
        // printed, along with an indication of whether those nodes can
        // be expanded.
        for (Iterator<Association> paths = pathsFromRoot.iterateAssociation(); paths.hasNext();) {
            addPathFromRoot(ti, lbsvc, lbscm, scheme, csvt, paths.next(), associationsToNavigate, associationsNavigatedFwd,
                    codesToDescriptions);
            pathsResolved++;
        }

    } finally {
        _logger.debug("Run time (milliseconds): " + (System.currentTimeMillis() - ms) +
            " to resolve " + pathsResolved + " paths from root.");
    }

    hmap.put(focusCode, ti);

    // Print the result ..
    return hmap;

}
 

import org.LexGrid.naming.SupportedHierarchy; //导入方法依赖的package包/类
/**
     * Prints the tree for an individual code.
     */
    public void run(LexBIGService lbsvc, LexBIGServiceConvenienceMethods lbscm, String scheme,
            CodingSchemeVersionOrTag csvt, SupportedHierarchy hierarchyDefn, String focusCode) throws LBException {

        // Print a header and define a new tree for the code being processed.
        Util_displayMessage("============================================================");
        Util_displayMessage("Focus code: " + focusCode);
        Util_displayMessage("============================================================");

        TreeItem ti = new TreeItem("<Root>", "Root node");
        //long ms = System.currentTimeMillis();
        Util.StopWatch stopWatch = new Util.StopWatch();
        int pathsResolved = 0;
        try {

            // Resolve 'is_a' hierarchy info. This example will
            // need to make some calls outside of what is covered
            // by existing convenience methods, but we use the
            // registered hierarchy to prevent need to hard code
            // relationship and direction info used on lookup ...
            String hierarchyID = hierarchyDefn.getLocalId();
            //String[] associationsToNavigate = hierarchyDefn.getAssociationNames();
            String[] associationsToNavigate = hierarchyDefn.getAssociationIds();
            boolean associationsNavigatedFwd = hierarchyDefn.getIsForwardNavigable();

            // Identify the set of all codes on path from root
            // to the focus code ...
            Map<String, EntityDescription> codesToDescriptions = new HashMap<String, EntityDescription>();
            AssociationList pathsFromRoot = getPathsFromRoot(lbsvc, lbscm, scheme, csvt, hierarchyID, focusCode,
                    codesToDescriptions);

            // Typically there will be one path, but handle multiple just in
            // case.  Each path from root provides a 'backbone', from focus
            // code to root, for additional nodes to hang off of in our
            // printout. For every backbone node, one level of children is
            // printed, along with an indication of whether those nodes can
            // be expanded.
            for (Iterator<Association> paths = pathsFromRoot.iterateAssociation(); paths.hasNext();) {
                addPathFromRoot(ti, lbsvc, lbscm, scheme, csvt, paths.next(), associationsToNavigate, associationsNavigatedFwd,
                        codesToDescriptions);
                pathsResolved++;
            }

        } finally {
            long duration = stopWatch.duration();
//            println("Run time (milliseconds): " + (System.currentTimeMillis() - ms) +
//                " to resolve " + pathsResolved + " paths from root.");
            println(stopWatch.getResult(duration) +
                    " * To resolve " + pathsResolved + " paths from root.");
            excelBuffer.append(pathsResolved + "\t");
            excelBuffer.append(stopWatch.getSecondString(duration) + "\t");
        }

        // Print the result ..
        printTree(ti, focusCode, 0);
    }
 

import org.LexGrid.naming.SupportedHierarchy; //导入方法依赖的package包/类
/**
 * Prints the tree for an individual code.
 */
public void run(LexBIGService lbsvc, LexBIGServiceConvenienceMethods lbscm, String scheme,
        CodingSchemeVersionOrTag csvt, SupportedHierarchy hierarchyDefn, String focusCode) throws LBException {

    // Print a header and define a new tree for the code being processed.
    Util_displayMessage("============================================================");
    Util_displayMessage("Focus code: " + focusCode);
    Util_displayMessage("============================================================");

    TreeItem ti = new TreeItem("<Root>", "Root node");
    long ms = System.currentTimeMillis();
    int pathsResolved = 0;
    try {

        // Resolve 'is_a' hierarchy info. This example will
        // need to make some calls outside of what is covered
        // by existing convenience methods, but we use the
        // registered hierarchy to prevent need to hard code
        // relationship and direction info used on lookup ...
        String hierarchyID = hierarchyDefn.getLocalId();
        //String[] associationsToNavigate = hierarchyDefn.getAssociationNames();
        String[] associationsToNavigate = hierarchyDefn.getAssociationIds();
        boolean associationsNavigatedFwd = hierarchyDefn.getIsForwardNavigable();

        // Identify the set of all codes on path from root
        // to the focus code ...
        Map<String, EntityDescription> codesToDescriptions = new HashMap<String, EntityDescription>();
        AssociationList pathsFromRoot = getPathsFromRoot(lbsvc, lbscm, scheme, csvt, hierarchyID, focusCode,
                codesToDescriptions);

        // Typically there will be one path, but handle multiple just in
        // case.  Each path from root provides a 'backbone', from focus
        // code to root, for additional nodes to hang off of in our
        // printout. For every backbone node, one level of children is
        // printed, along with an indication of whether those nodes can
        // be expanded.
        for (Iterator<Association> paths = pathsFromRoot.iterateAssociation(); paths.hasNext();) {
            addPathFromRoot(ti, lbsvc, lbscm, scheme, csvt, paths.next(), associationsToNavigate, associationsNavigatedFwd,
                    codesToDescriptions);
            pathsResolved++;
        }

    } finally {
        System.out.println("Run time (milliseconds): " + (System.currentTimeMillis() - ms) +
            " to resolve " + pathsResolved + " paths from root.");
    }

    // Print the result ..
    printTree(ti, focusCode, 0);
}