selectmedianwithweighttest.java

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

/*
 * Copyright (C) 2000-2007 Wang Pengcheng <[e-mail]>
 * Licensed to the Wang Pengcheng under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The LGPL licenses this file to You under the GNU Lesser General Public
 * Licence, Version 2.0  (the "License"); you may not use this file except in
 * compliance with the License.  You may obtain a copy of the License at
 *
 *     http://www.gnu.org/licenses/lgpl.txt
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
//17 Nov 2007
package cn.edu.whu.iss.algorithm.unit09.test;

import cn.edu.whu.iss.algorithm.unit09.SelectMedianWithWeight;
import cn.edu.whu.iss.algorithm.unit09.WeightAndKeyGet;
import mypackage.tools.print.P;
import junit.framework.TestCase;

public class SelectMedianWithWeightTest extends TestCase {

	private static Smw[] s;
	
	public void testGetNumber() {
		init(9);
		int i= SelectMedianWithWeight.getNumber(s);

		if(i==s.length/2){
			P.rintln(s[i]);
			P.rintln(s);
		}if(i==s.length/2-1){
			P.rintln(s[i]);
			P.rintln(s);		
		}else{
			fail("Not yet implemented");
		}
	}
	
	private static void init(int t){
		s = new Smw[t];
		for(int i=0;i<s.length;i++){
			s[i] = new Smw(1,i);
		}
	}

}

class Smw implements WeightAndKeyGet{
	private int weight;
	private Integer key;

	public Smw(int w,int k){
		weight  = w;
		key = k;
	}
	
	public int getWeight() {
		return weight;
	}

	public int compareTo(Object o) {
		return key.compareTo( ((Smw)o).getKey() );
	}
	
	public int getKey(){
		return key;
	}
	public String toString(){
		return Integer.toString(key);
	}
}