myconcourse.java

基本数据结构

package concourseApp;
import DuoLink.DuoLinkItem;
import LinearLink.*;
public class MyConcourse extends LinearLink
{
	public MyConcourse(double item) 
    {
		super(item);
	    LinearLink set=new LinearLink(item);
	}
	public boolean reside(double item,MyConcourse sa)
	{
		double[] array=new double[sa.getLength(sa.getFirst())];int i;
		System.arraycopy(sa.getItemArray(), 0, array, 0, sa.getLength(sa.getFirst()));
		for(i=0;i<sa.getLength(sa.getFirst());i++)
		{
			if(item==array[i])break;
		}
		if(i<sa.getLength(sa.getFirst())-1)return true;
		else return false;
	}
    public MyConcourse Union(MyConcourse sa,MyConcourse sb)
    {
    	MyConcourse sc;int i,j;
    	int saLength=sa.getLength(sa.getFirst());
    	int sbLength=sb.getLength(sb.getFirst());
    	double[] array1=new double[saLength];
    	double[] array2=new double[sbLength];
    	System.arraycopy(sa.getItemArray(), 0, array1, 0, saLength);
    	System.arraycopy(sb.getItemArray(), 0, array2, 0, sbLength);
    	if(saLength>sbLength)
    	{
    		j=saLength;
    		for(i=0;i<j;i++)
        	{
        		if(sa.reside(array2[i],sa)!=true) 
        		{
        			sa.insertItem(array1[i], array2[i]);
        		}
        	}
    	    sc=sa;
    	}
    	else 
    	{
    		j=sbLength;
    		for(i=0;i<j;i++)
        	{
        		if(sb.reside(array1[i],sb)!=true) 
        		{
        			sa.insertItem(array2[i], array1[i]);
        		}
        	}
    		sc=sb;
    	}
    	return sc;
    }
    public MyConcourse intersection(MyConcourse sa,MyConcourse sb)
    {
    	MyConcourse sc;int i,j;
    	int saLength=sa.getLength(sa.getFirst());
    	int sbLength=sb.getLength(sb.getFirst());
    	double[] array1=new double[saLength];
    	double[] array2=new double[sbLength];
    	System.arraycopy(sa.getItemArray(), 0, array1, 0, saLength);
    	System.arraycopy(sb.getItemArray(), 0, array2, 0, sbLength);
    	if(saLength>sbLength)
    	{
    		j=saLength;
    		for(i=0;i<j;i++)
        	{
        		if(sa.reside(array2[i],sa)!=true) 
        		{
        			sb.removeItem(array2[i]);
        		}
        	}
    	    sc=sb;
    	}
    	else 
    	{
    		j=sbLength;
    		for(i=0;i<j;i++)
        	{
        		if(sb.reside(array1[i],sb)!=true) 
        		{
        			sa.removeItem(array1[i]);
        		}
        	}
    		sc=sa;
    	}
    	return sc;
    }
    public MyConcourse difference(MyConcourse sa,MyConcourse sb)
    {
    	MyConcourse sc,se;
    	se=this.intersection(sa, sb);
    	int seLength=se.getLength(se.getFirst());
    	int saLength=sa.getLength(sa.getFirst());
    	double[] array1=new double[seLength];
    	double[] array2=new double[saLength];
    	System.arraycopy(se.getItemArray(), 0, array1, 0, seLength);
    	System.arraycopy(sa.getItemArray(), 0, array2, 0, saLength);
    	int j=saLength,i;
    	for(i=0;i<j;i++)
        {
        	if(sa.reside(array1[i],sa)==true) 
        	{
        		sa.removeItem(array1[i]);
        	}
        }
    	    sc=sa;
    	return sc;
    }
}