二叉查找树的基类实现（二）

下面是整数数据类型的定义和实现

IntClass.h 文件

#ifndef INTCLASS_H
#define INTCLASS_H
#include "objectclass.h"
class IntClass:public ObjectClass
{
private:
	int data;
	int length;
public:
IntClass();
IntClass(int data);
public:
int Compare(ObjectClass *objcls);
virtual void OutPut();
float getValue();
int getLength();
};
#endif

IntClass.cpp 文件

#include "IntClass.h"
IntClass::IntClass()
{
	data=0;
	length = 0;
}

IntClass::IntClass(int data)
{
	length = 0;
	this->data=data;
	if(data == 0)length = 1;
	while(data>0)
	{
		data=data/10;
		length++;
	}
}
//比较大小函数，如果返回-1就小，返回1就大，返回0就相等
int IntClass::Compare(ObjectClass *objcls)
{
	if(data < objcls->getValue())
	return -1;
	else if(data > objcls->getValue())
	return 1;
	else
	return 0;
}
float IntClass::getValue()
{
	return data;
}
void IntClass::OutPut()
{
	cout<<data;
}
int IntClass::getLength()
{
	return length;
}

转载于:https://www.cnblogs.com/xiao-cheng/archive/2011/10/01/2197162.html