/**
* Reloads data from new model, creates new search engine to search in new model if model contains
* view with the same name
*/
private void reloadData(HelpModel model) {
debug("reloadData using new model");
helpsearch = null;
SearchView view = null;
newHelpSet = model.getHelpSet();
SearchView oldView = (SearchView) searchnav.getNavigatorView();
String oldName = oldView.getName();
NavigatorView[] navViews = newHelpSet.getNavigatorViews();
for (int i = 0; i < navViews.length; i++) {
if ((navViews[i].getName()).equals(oldName)) {
NavigatorView tempView = navViews[i];
if (tempView instanceof SearchView) {
view = (SearchView) tempView;
break;
}
}
}
if (view == null) return;
topNode.removeAllChildren();
searchnav.setSearchEngine(new MergingSearchEngine(view));
setCellRenderer(view, tree);
// add all subhelpsets
addSubHelpSets(newHelpSet);
}
// reorder the nodes
private void reorder(Vector nodes) {
debug("reorder nodes");
// remove all the children of topNode (they'll be added back later)
topNode.removeAllChildren();
// Create an array of the elements for sorting & copy the elements
// into the array.
DefaultMutableTreeNode[] array = new DefaultMutableTreeNode[nodes.size()];
nodes.copyInto(array);
// Sort the array (Quick Sort)
quickSort(array, 0, array.length - 1);
// Reload the topNode. Everthing is in order now.
for (int i = 0; i < array.length; i++) {
topNode.add((DefaultMutableTreeNode) array[i]);
}
// Tell the tree to repaint itself
((DefaultTreeModel) tree.getModel()).reload();
tree.invalidate();
tree.repaint();
}
/** Remove all nodes except the root node. */
public void clear() {
rootNode.removeAllChildren();
treeModel.reload();
}
