report.java

用c编写的数据内部排序方法,可在窗口中选择多种排序方法,如快排,冒泡,折半插入等,还可以选择排序数据的个数,初态,控制等.

package main;

import java.awt.*;
import javax.swing.*;
import javax.swing.border.*;
import javax.swing.tree.*;
import javax.swing.event.*;
import java.awt.event.*;
import java.io.*;
import main.myClass.*;

public class Report extends JFrame{
	JSplitPane splitPane = new JSplitPane(JSplitPane.HORIZONTAL_SPLIT);
	JEditorPane edit=new JEditorPane();
	DefaultMutableTreeNode top=new DefaultMutableTreeNode("排序方法");
	JTree tree=new JTree(top);
	private String[] name;
	
	public Report(myHashtable algorithm){
		setTitle("课程设计报告");
		edit.setEditable(false);
		edit.setFont(new Font("宋体",0,14));
		splitPane.setDividerLocation(0.3d);
		init(algorithm);
		tree.addTreeSelectionListener(new TreeSelectionListener() {
			public void valueChanged(TreeSelectionEvent e) {
				DefaultMutableTreeNode node = (DefaultMutableTreeNode)
					tree.getLastSelectedPathComponent();
				if(node==null) return;
				if(node.isLeaf()){
					String parent=node.getParent().toString();
					if(node.getUserObject().equals("算法描述")){
						try{
							FileReader temp=new FileReader("./main/Report/"+parent+"Alg.txt");
							edit.read(temp,null);
							temp.close();
						}
						catch(Exception f){f.printStackTrace();}
					}
					else if(node.getUserObject().equals("排序评价")){
						try{
							FileReader temp=new FileReader("./main/Report/"+parent+"Comp.txt");
							edit.read(temp,null);
							temp.close();
						}
						catch(Exception f){f.printStackTrace();}
					}
					else if(node.getUserObject().equals("源代码")){
						try{
							FileReader temp=new FileReader("./main/Report/"+parent+"Code.txt");
							edit.read(temp,null);
							temp.close();
						}
						catch(Exception f){f.printStackTrace();}
					}
				}
				else return;
			}
		});
		
		splitPane.setLeftComponent(new JScrollPane(tree));
		splitPane.setRightComponent(new JScrollPane(edit));
		getContentPane().add(splitPane,BorderLayout.CENTER);
	}
	
	public void addNode(DefaultMutableTreeNode top,String[] son){
		for(int i=0;i<son.length;i++){
			DefaultMutableTreeNode temp=new DefaultMutableTreeNode(son[i]);
			DefaultMutableTreeNode suanfa=new DefaultMutableTreeNode("算法描述");
			DefaultMutableTreeNode code=new DefaultMutableTreeNode("源代码");
			DefaultMutableTreeNode complication=new DefaultMutableTreeNode("排序评价");
			temp.add(suanfa);
			temp.add(code);
			temp.add(complication);
			top.add(temp);
		}
	}	
	
	public void init(myHashtable algorithm){
		name=new String[algorithm.size()];
		top.removeAllChildren();
		for(int i=0;i<algorithm.size();i++)
			name[i]=algorithm.getKey(i);
		addNode(top,name);
	}
}