changes

来自「用Borland C写的B-Tree算法」· 代码 · 共 38 行

1/4/98	btree-mem-C/btree.h
	removed math.h and time.h includes
	removed BTREE_KEY_LONG and BTREE_KEY_STR classes (moved to btkey.h)
	added BTREE_ITERATOR class, and made friend of BTREE & BTREE_ROOT
	added private BTREE constructors to disable copy constructor
		and assignment operator
	changed BTREE::get_count() to be const
	changed BTREE::fix_root_remove() to not be inline
	removed BTREE::find_prev()
	added BTREE::find_first()
	added BTREE::traverse()
	fixed nasty bug in BTREE::find_next()
	fixed nasty bug in BTREE::add_internal()
	added BTREE_ROOT copy constructor and assignment operator
	added BTREE_ROOT::add_tree()
	changed BTREE_ROOT::get_count() to be const
	changed BTREE_ROOT::remove() to be inline

	WARNING: fixes to nasty bugs in btree-mem-C/btree.h not applied
	to btree-mem-long/btree.h

	btree-mem-C/random.c
	changed MAX_RAND definition

	btree-mem-long/random.c
	changed MAX_RAND definition

3/24/97	btree-mem-C/btree.h
	Modified BTREE constructor to use typedef for BTREE<KEY> * because
		ptr = new (BTREE<KEY> *)[order];
	was not working for Microsoft Visual C++ 4.1

	btree-mem-C/btree-mem-C.ide
	created Borland C++ 5.0 project file

	btree-mem-long/btree-mem-long.ide
	created Borland C++ 5.0 project file