arrivalgen.h

这是最难的一个程序了

#ifndef ARRIVALGEN_H
#define ARRIVALGEN_H

#include <cstdlib>  
#include <math.h>     
#include <time.h>
#include <iostream.h>
#include "article.h"

class Generator
{
public:
    Generator (int s,float cap)
	{
     srand (s);             //seed the random sequence
     capacity = cap;
	}

    float generchiff()
    {
	  float returnval;
	  if(capacity==1.0)
        returnval = (float)(rand()%10+1)/10.0; 
      else
	    returnval = (float)(rand()%((int)capacity)+1);
	  return returnval;
	}

    float gener_dis_date(float max_jour)
	{float returnval;
	  returnval = (float)(rand()%((int)(max_jour+1))); 
	  return returnval;
	}

    void Sort(ARTICLE* ar[],int s)
	{ float temp;   
	  int size,max,i;
	  size = s;
	  size--;
	  
      for( i = 1;i<size;i++)
		{   max = i;
			for(int j = i+1;j<=size;j++)
			{ if(ar[j]->GetPoid()>ar[max]->GetPoid()) max = j;
			}
			temp = ar[i]->GetPoid();
			ar[i]->SetPoid(ar[max]->GetPoid());
			ar[max]->SetPoid(temp);
		}
	}

    void Sort2(ARTICLE* ar[],int s)
	{ ARTICLE* temp;   
	  int size,max,i;
	  size = s;
	  size--;
      for( i = 0;i<size;i++)
		{   max = i;
			for(int j = i+1;j<=size;j++)
			{ if(ar[j]->GetPoid()>ar[max]->GetPoid()) max = j;
			}
			temp = ar[i];
			ar[i]=ar[max];
			ar[max]=temp;
		}
	}

    void Sort_date(ARTICLE* ar[],int s)
	{ ARTICLE* temp;   
	  int size,min,i;
	  size = s;
	  size--;
      for( i = 0;i<size;i++)
	  {   min = i;
		for(int j = i+1;j<=size;j++)
		{ if(ar[j]->dis_date<ar[min]->dis_date) 
			min = j;
		}
		temp = ar[i];
		ar[i] = ar[min];
		ar[min] = temp;
	  }  
	  
	}
	
private:
   float capacity;
};
      
#endif