testrbtree.java

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

/*
 * 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.
 */
//25 Jan 2008
package cn.edu.whu.iss.algorithm.unit13.test;

import static cn.edu.whu.iss.algorithm.basictools.BasicSortTool.*;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

import cn.edu.whu.iss.algorithm.unit13.RBTree;
import mypackage.tools.print.*;
public class TestRBTree {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int n = 20;
		List<Integer> list = new ArrayList<Integer>();
		for(int i=0;i<n;i++){
			list.add(n-i);
		}
		Iterator<Integer> it = list.iterator();
		RBTree<Integer> tree = new RBTree<Integer>();
		while(it.hasNext()){
			tree.add(it.next());
			//P.rintln(tree);
		}
		int k = randomInt(1, n);
		while(k>0){
			k--;
			int i = randomInt(1, n);
			//P.rint(i+" ");
			tree.remove(i);
			Object[] l = tree.toArray();
			P.rintln(l);
		}
		Object[] l = tree.toArray();
		P.rintln(l);
	}

}