getportionbagtests.java

来自「<算法导论>第二版大部分算法实现. 1. 各类排序和顺序统计学相关」· Java 代码 · 共 59 行

/*
 * Copyright (C) 2003-2008 Wang Pengcheng <[e-mail]>
 * Permission is granted to copy, distribute and/or modify this
 * document under the terms of the GNU Free Documentation License,
 * Version 2.0 or any later version published by the Free Software Foundation;
 * with no Invariant Sections.
 * You may obtain a copy of the License at
 *   http://www.gnu.org/licenses/lgpl.txt
 */
//13 Mar 2008
package cn.edu.whu.iss.algorithm.unit16.test;

import cn.edu.whu.iss.algorithm.unit16.GetPortionBag;
import cn.edu.whu.iss.algorithm.unit16.PortionBagObj;
import junit.framework.TestCase;

public class GetPortionBagTests extends TestCase implements GetPortionBagTestData{

	private GetPortionBag get;
	
	public void testGetRes() {
		
		for(int i=0;i<ANS_PRICE_ALL.length;i++){
			Obj[] o = new Obj[PRICE[i].length];
			for(int j=0;j<o.length;j++){
				o[j] = new Obj(PRICE[i][j],WEIGHT[i][j]);
			}
			int w = WEIGHT_ALL[i];
			get = new GetPortionBag(o,w);
			assertEquals(ANS_PRICE_ALL[i],get.getRes());
		}
	}
	
	class Obj implements PortionBagObj{
		private int price;
		private int weight;
		
		public Obj(int price, int weight) {
			super();
			this.price = price;
			this.weight = weight;
		}
		public int getPrice() {
			return price;
		}
		public void setPrice(int price) {
			this.price = price;
		}
		public int getWeight() {
			return weight;
		}
		public void setWeight(int weight) {
			this.weight = weight;
		}
		
	}

}