public String getTrees(boolean inverse) 
{
        nodeHash = new HashMap< String, TreeEntry >();
        List list = ClassLoaderRegistry.getList();
        Iterator iter = list.iterator();
        while (iter.hasNext()) {
            if (!inverse)
                updateTree((ClassLoader) iter.next());
            else
                inverseTree((ClassLoader) iter.next());
        }
        return this.printClassLoaders();
}

 public TreeEntry inverseTree(ClassLoader classloader) 
{
        TreeEntry node = nodeHash.get(classloader.toString());
        if (null != node)
            return node;
        node = new TreeEntry(classloader.toString(), "root");
        node = addClasses(node, classloader);
        nodeHash.put(node.getName(), node);
        if (classloader instanceof MultiParentClassLoader) {
            MultiParentClassLoader mpclassloader = (MultiParentClassLoader) classloader;
            ClassLoader[] parents = mpclassloader.getParents();
            if (null != parents && 0 <  parents.length) {
                for (int i = 0; i <  parents.length; i++) {
                    TreeEntry parentNode = inverseTree(parents[i]);
                    node.addChild(parentNode);
                }
            }
        } else if (classloader.getParent() != null) {
            TreeEntry parentNode = inverseTree(classloader.getParent());
            node.addChild(parentNode);
        }
        return node;
}

 String printClassLoaders() 
{
        // generate an ordered id
        List< TreeEntry > rootNodes = new ArrayList< TreeEntry >();
        for (TreeEntry entry : nodeHash.values()) {
            if (entry.getType().equals("root"))
                rootNodes.add(entry);
        }
        markupId(-1, rootNodes); // here root nodes have already been sorted
        List< TreeEntry > allNodes = rootNodes;
        for (TreeEntry entry : nodeHash.values()) {
            if (!entry.getType().equals("root"))
                allNodes.add(entry);
        }
        StringBuilder sb = new StringBuilder(512);
        sb.append("{label:\"name\",identifier:\"id\",items:[");
        Iterator< TreeEntry > list = allNodes.iterator();
        while (list.hasNext()) {
            TreeEntry curr = list.next();
            sb.append("{name:\"").append(curr.getName())
            .append("\",id:\"").append(curr.getId())
            .append("\",type:\"").append(curr.getType())
            .append("\",children:[");
            Iterator< TreeEntry > children = curr.getChildren().iterator();
            // the first child is Classes and the second one is Interfaces
            printClasses(sb, children.next());
            sb.append(",");
            printClasses(sb, children.next());
            while (children.hasNext()) {
                TreeEntry child = children.next();
                sb.append(",{_reference:\"").append(child.getId()).append("\"}");
            }
            if (list.hasNext())
                sb.append("]},");
            else
                sb.append("]}");
        }
        sb.append("]}");
        return sb.toString();
}

 public TreeEntry updateTree(ClassLoader classloader) 
{
        TreeEntry node = nodeHash.get(classloader.toString());
        if (null != node)
            return node;
        node = new TreeEntry(classloader.toString(), NORMAL_TYPE);
        node = addClasses(node, classloader);
        nodeHash.put(node.getName(), node);
        if (classloader instanceof MultiParentClassLoader) {
            MultiParentClassLoader mpclassloader = (MultiParentClassLoader) classloader;
            ClassLoader[] parents = mpclassloader.getParents();
            if (null != parents && 0 <  parents.length) {
                for (int i = 0; i <  parents.length; i++) {
                    TreeEntry parentNode = updateTree(parents[i]);
                    parentNode.addChild(node);
                }
            }
        } else if (classloader.getParent() != null) {
            TreeEntry parentNode = updateTree(classloader.getParent());
            parentNode.addChild(node);
        } else {
            node.setType("root");
        }
        return node;
}