book.java

构建网上购书最优联盟 此篇文章重在构建囊括最多变量因素的网上购书联盟。计算最优则变成了不断测试不断更改变量的统计型问题。而联盟要求的最低构建要素是： &#61548 联盟中心到站点的运输费

package tomato;


final class Book {
  
  protected String d_bookname;
  private double d_price ;
  private BookType d_type;
  private Purchaser d_purchaser;
  
  public Book(String bookname,double price,BookType booktype){
  	
   d_bookname = bookname;
   d_price = price;
   d_type = booktype;	
  
  }
  /*
  public Book(Book book){
  	
   //d_purchaser = Purchaser(book.d_purchaser);
   d_bookname = book.d_bookname;
   d_price = book.d_price;
   d_type = book.d_type;	
  
  }
  */
  
  public String GetBookname(){
    
    return d_bookname;
      
  }
  
  public void Display(){
     
   System.out.println("The book name is:  "+GetBookname()); 
   System.out.println("The price is:      "+d_price);        	
   System.out.println("The book's type is:"+d_type.toString().trim());       
 }
  
  public Purchaser GetPurchaser(){
   
    return d_purchaser;	
  }
  
  private void SetPurchaser(Purchaser purchaser){
    
    d_purchaser = purchaser;	
  }
  
  public double GetPrice(Purchaser purchaser){
    
    SetPurchaser(purchaser);	
    return d_price*GetDiscount();
    
  }
  
  private double GetDiscount(){
    return d_type.Discount(this);	
  }
  
  public static void main(String[]args){
  	
    Book aTest = new Book((String)"aTest",120,new BookofComputer());     
 
    aTest.Display();   
       
   // bTest.Display();
  	
  }
  
}