zip to JTree

[Iban Cardona]

Hello,

Anybody know any method to explore a zip file and convert their content to a JTree?

Thank you very much.

[Rob Spoor]

I assume you know how to read all entries in a Zip file.

I would keep a mapping from entry names to DefaultMutableTreeNodes. Then, when you encounter a ZipEntry, you determine its parent from the name (using the / as the separator*). You retrieve the parent node from the map, creating it if necessary. Then you create a DefaultMutableTreeNode, and add it to the parent node. Finally you add the new mapping.

In pseudo code (untested):

public TreeNode createNode(ZipFile file)
{
    MutableTreeNode root = new DefaultMutableTreeNode("root");
    Map<String,MutableTreeNode> nodes = new HashMap<String,MutableTreeNode>();
    nodes.put(null, root);
    for (Enumeration<? extends ZipEntry> e = file.entries(); e.hasNextElement(); )
    {
        ZipEntry entry = e.nextElement();
        String name = entry.getName();
        MutableTreeNode node = new DefaultMutableTreeNode(name);
        nodes.put(name, node);

        MutableTreeNode parent = getParent(name, nodes);
        parent.insert(node, parent.getChildCount());
    }
    return root;
}

private MutableTreeNode getParent(String name, Map<String,MutableTreeNode> nodes)
{
    String parent = <get parent name from name>;
    MutableTreeNode parentNode = nodes.get(parent);
    // parent == null => parentNode is the root
    // omitted: null check and creation
    return parentNode;
}

* You can be lazy and use java.io.File for this.

[Iban Cardona]

Rob Prime wrote:I assume you know how to read all entries in a Zip file.

I would keep a mapping from entry names to DefaultMutableTreeNodes. Then, when you encounter a ZipEntry, you determine its parent from...

Thank you.

Using split would be a good solution for the name of the parent?

[Rob Spoor]

If you can get the right regex, sure. Not that that's too hard

[Iban Cardona]

George,

Many thanks. Helped me a lot.
I made a small test and seems to work pretty well. I show you the code adapted to my needs.

public TreeNode treureArbre() {
		ZipFile file = null;
		try {
			file = new ZipFile(ruta);
		} catch (IOException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
			System.exit(1);
		}
		MutableTreeNode root = new DefaultMutableTreeNode(nomFitxer);  
		Map<String,MutableTreeNode> nodes = new HashMap<String,MutableTreeNode>();  
		nodes.put(nomFitxer, root);
		for (Enumeration<? extends ZipEntry> e = file.entries(); e.hasMoreElements();) {  
			ZipEntry entry = e.nextElement();  
			String name = entry.getName();
			System.out.println("Name:"+entry.getName());
			MutableTreeNode node = new DefaultMutableTreeNode(name);
			nodes.put(name, node);
			
			MutableTreeNode parent = getParent(name, nodes);
			parent.insert(node, parent.getChildCount());  
		}  
		return root;
	}

      *ruta & nomFitxer ara my variables.

private MutableTreeNode getParent(String name, Map<String,MutableTreeNode> nodes)  {
		File f = new File(name);
		String parent = f.getParent();
		System.out.println("parent:"+parent);
		// parent == null => parentNode is the root
		if (parent == null) {
			return nodes.get(nomFitxer);
		}  else {
			parent = parent+File.separator;
		}
		MutableTreeNode parentNode = nodes.get(parent);
		return parentNode;  
	}

What do you think?
Many thanks again.

[Rob Spoor]

This will cause problems if you happen to have a zip entry with the same name as the value of nomFitxer.