node4classleaves.java

来自「一个可以存储和打印成绩单的系统」· Java 代码 · 共 66 行

package org.minjey.cjsjk.view.tree.node;

import java.util.HashMap;
import java.util.Iterator;

import org.minjey.cjsjk.model.Course;
import org.minjey.cjsjk.model.ExamType;
import org.minjey.cjsjk.model.Major;
import org.minjey.cjsjk.util.Reflector;

public abstract class Node4ClassLeaves extends MyTreeNode {
	
	
	public Node4ClassLeaves(Object userObject) {
		super(userObject);
	}
	
	public void addNode(MyTreeNode node) {

	}
	
	public void showChildren() {

	}
	
	public void deleteNode(MyTreeNode node) {

	}
	
	public HashMap<Integer, Object> getCourses() {
		Node4ClassLeaves parent = (Node4ClassLeaves)getParent();
		HashMap<Integer, Object> pobjs = parent.getCourses();
		HashMap<Integer, Object> cobjs = new HashMap<Integer, Object>();
		Iterator it = pobjs.values().iterator();
		while(it.hasNext()) {
			Object cobj = it.next();
			if(isLeagleChild(userObject, cobj)) {
				Integer id = (Integer)reflector.getValue(cobj, "id");
				cobjs.put(id, cobj);
			}
		}
		return cobjs;
	}
	
	public HashMap<Integer, Object> getStudents() {
		Node4ClassLeaves parent = (Node4ClassLeaves)getParent();
		HashMap<Integer, Object> pobjs = parent.getStudents();
		HashMap<Integer, Object> cobjs = new HashMap<Integer, Object>();
		Iterator it = pobjs.values().iterator();
		while(it.hasNext()) {
			Object cobj = it.next();
			if(isLeagleChild(userObject, cobj)) {
				Integer id = (Integer)reflector.getValue(cobj, "id");
				cobjs.put(id, cobj);
			}
		}
		return cobjs;
	}
	
	public Major getMajor() {
		Node4ClassLeaves parent = (Node4ClassLeaves)getParent();
		return parent.getMajor();
	}
	
}