Build a tree and populate it from hashtables
/* Java Swing, 2nd Edition By Marc Loy, Robert Eckstein, Dave Wood, James Elliott, Brian Cole ISBN: 0-596-00408-7 Publisher: O'Reilly */ // ObjectTree.java //A simple test to see how we can build a tree and populate it. This version //builds the tree from hashtables. // import java.awt.BorderLayout; import java.util.Hashtable; import javax.swing.JFrame; import javax.swing.JTree; public class ObjectTree extends JFrame { JTree tree; String[][] sampleData = { { "Amy" }, { "Brandon", "Bailey" }, { "Jodi" }, { "Trent", "Garrett", "Paige", "Dylan" }, { "Donn" }, { "Nancy", "Donald", "Phyllis", "John", "Pat" }, { "Ron" }, { "Linda", "Mark", "Lois", "Marvin" } }; public ObjectTree() { super("Hashtable Test"); setSize(400, 300); setDefaultCloseOperation(EXIT_ON_CLOSE); } public void init() { Hashtable h = new Hashtable(); // Build up the hashtable using every other entry in the String[][] as a // key // followed by a String[]"value." for (int i = 0; i < sampleData.length; i += 2) { h.put(sampleData[i][0], sampleData[i + 1]); } tree = new JTree(h); getContentPane().add(tree, BorderLayout.CENTER); } public static void main(String args[]) { ObjectTree tt = new ObjectTree(); tt.init(); tt.setVisible(true); } }