dynamicstatisticstreetests.java

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

/*
 * 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
 */
//12 Mar 2008
package cn.edu.whu.iss.algorithm.unit14.test;

import cn.edu.whu.iss.algorithm.unit14.DynamicStatisticsTree;
import junit.framework.TestCase;

public class DynamicStatisticsTreeTests extends TestCase implements DynamicStatisticsTreeTestData{

	private DynamicStatisticsTree<Integer> tree;
	
	protected void setUp() throws Exception {
		super.setUp();
		tree = new DynamicStatisticsTree<Integer>();
	}

	public void testSelectStatisticData() {

		for(int i=0;i<ANS_UNCHANGE.length;i++){
			tree.clear();
			for(int j=0;j<NUMBERS[i].length;j++){
				tree.add(NUMBERS[i][j]);
			}
			for(int j=0;j<ANS_UNCHANGE[i].length;j++){
				assertEquals(ANS_UNCHANGE[i][j], tree.selectStatisticData(StData_UNCHANGE[i][j]));
			}
			
		}
		
//		long time = System.currentTimeMillis();
//		for(int i=1;i<=36000;i++){
//			tree.clear();
//			for(int j=1;j<=i;j++){
//				tree.add(j);
//			}
//			for(Integer j=1;j<=i;j++){
//				assertEquals(j, tree.selectStatisticData(j));
//			}
//		}
//		System.out.println("The time use:"+((System.currentTimeMillis()-time)/1000));
		
		for(int i=0;i<ANS_CHANGE.length;i++){
			tree.clear();
			for(int j=0;j<NUMBERS[i].length;j++){
				tree.add(NUMBERS[i][j]);
			}
			for(int j=0;j<REMOVE_NUM[i].length;j++){
				tree.remove(REMOVE_NUM[i][j]);
				//System.out.println(i+","+j);
				assertEquals(i+","+j+":"+ANS_CHANGE[i][j], i+","+j+":"+tree.selectStatisticData(StData_CHANGE[i][j]));
			}
		}
	}

}