key.java

一个用Java applet实现的B-Tree算法

/**  By Kristi Thompson and Sean McLaughlin
 *
 *	  April 10 & 11, 1997
 *
 *    CISC 235 - Information Structures (Winter 1997) taught by David Alex Lamb
 *
 *    Dept of Computer Science
 *    Queen's University, Kingston
 *
 *    [e-mail] , [e-mail]
 *
 *    http://qlink.queensu.ca/~3sm79/BplusTree
 *
 * Feel free to copy and modify this applet, but please give credit
 * to the original author where appropriate
 *
 * This applet was inspired by and partly based upon the BST Search Tree Applet
 * by James Stewart.
 *
 * http://www.dgp.toronto.edu/people/JamesStewart/applets/bst/bst-property.html
 *
 */

import java.awt.*;


/** //
	// Key
	//

	A Key is an animated moveable object which displays a 'Key Value'
	And lets keys be compared for <, >, =

	Ideally subclassed for String Keys, Integer Keys, etc
*/

class Key extends Sprite
{ 

static final Color KeyColor		= Color.red;
static int   KEY_WIDTH		= 25;
//static final Font keyFont;
//static FontMetrics keyfm;

	Key()
	{
//		keyFont = new Font( "TimesRoman", Font.BOLD, 18 );
//		keyfm = getFontMetrics( keyFont );
	}
}