C++博客-夫为剑者-文章分类-自我监督http://www.cppblog.com/vivip/category/2359.html示之以虚 开之以利 后之以发 先之以至zh-cnFri, 23 May 2008 00:18:46 GMTFri, 23 May 2008 00:18:46 GMT602006-08-15http://www.cppblog.com/vivip/articles/11242.htmlvivipvivipTue, 15 Aug 2006 02:44:00 GMThttp://www.cppblog.com/vivip/articles/11242.htmlhttp://www.cppblog.com/vivip/comments/11242.htmlhttp://www.cppblog.com/vivip/articles/11242.html#Feedback0http://www.cppblog.com/vivip/comments/commentRss/11242.htmlhttp://www.cppblog.com/vivip/services/trackbacks/11242.html #ifndef MATH_OPERATOR_H
#define MATH_OPERATOR_H

#include "StackTmp.h"

class MathOperator
{
private:
char op;
int inputprecedence;
int stackprecedence;
public:
MathOperator();
MathOperator(char);
int operator >=(MathOperator a) const;
void Evaluate(Stack<float>& operandStack);
char GetOp();
};

#endif


vivip 2006-08-15 10:44 发表评论
]]>2006-08-14http://www.cppblog.com/vivip/articles/11217.htmlvivipvivipMon, 14 Aug 2006 07:49:00 GMThttp://www.cppblog.com/vivip/articles/11217.htmlhttp://www.cppblog.com/vivip/comments/11217.htmlhttp://www.cppblog.com/vivip/articles/11217.html#Feedback0http://www.cppblog.com/vivip/comments/commentRss/11217.htmlhttp://www.cppblog.com/vivip/services/trackbacks/11217.html 简单的数组类
#ifndef ARRAY_H_
#define ARRAY_H_

#include <iostream.h>;
#include <stdlib.h>;

enum ErrorType { invalidArraySize,memoryAllocationError,indexOutOfRange};
char * errorMsg[] = { "Invalid array size","Memory allocation error","invalid index"};

template <class T>;
class Array
{
private:
T* alist;
int size;

void Error(ErrorType errorCommitted,int badIndex=0) const;
public:
Array(int sz=50);
Array(const Array<T>;& X);
~Array();

Array<T>;& operator =(const Array<T>;& rhs);
T& operator [](int i);
operator T* () const;
int ListSize() const;
void Resize(int sz);
};

template <class T>;
Array<T>;::Array(int sz/* =50 */)
{
if (sz <= 0)
Error(invalidArraySize);
size = sz;
alist = new T[size];
if (alist == NULL)
Error(memoryAllocationError);
}

template <class T>;
Array<T>;::Array(const Array<T>;& X)
{
int n = X.size;
size = n;
alist = new T[n];
if (alist == NULL)
Error(memoryAllocationError);
T* srcptr = X.alist;
T* destptr = alist;
while(n--)
*destptr++ = *srcptr++;
}

template <class T>;
Array<T>;::~Array()
{
delete [] alist;
}

template <class T>;
T& Array<T>;::operator [](int n)
{
if (n<0 || n>;size - 1)
Error(indexOutOfRange,n);
return alist[n];
}

template <class T>;
Array<T>;::operator T* () const
{
return alist;
}

template <class T>;
int Array<T>;::ListSize() const
{
return size;
}

template <class T>;
void Array<T>;::Resize(int sz)
{
if (sz <= 0)
Error(invalidArraySize);
if (sz == size)
return;
T* newlist = new T[sz];
if (newlist == NULL)
Error(memoryAllocationError);
int n = (sz <= size ? sz : size);
T* srcptr = alist;
T* destptr = newlist;
while (n--)
*destptr++ = *srcptr++;
delete [] alist;
alist = newlist;
size = sz;
}

template <class T>;
void Array<T>;::Error(ErrorType errorCommitted,int badIndex/* =0 */) const
{
if (errorCommitted == invalidArraySize)
cerr<<errorMsg[0]<<endl;
else if (errorCommitted == memoryAllocationError)
cerr<<errorMsg[1]<<endl;
else if (errorCommitted == indexOutOfRange)
cerr<<errorMsg[2]<<" "<<badIndex<<endl;
exit(1);
}

template <class T>;
Array<T>;& Array<T>;::operator =(const Array<T>;& X)
{
T* newlist = new T[X.size];
if (newlist == NULL)
Error(memoryAllocationError);T* srcptr = alist;
T* destptr = newlist;
while (n--)
*destptr++ = *srcptr++;
delete [] alist;
alist = newlist;
size = sz;
return this;
}


#endif

下面是测试代码，求质数
#include "Array.h"
#include <iomanip.h>;

int main()
{
Array <int>; A(10);
int upperlimit,primecount = 0,i,j;
cout<<"enter value >;= 2 as upper limit for prime numbers:";
cin>;>;upperlimit;
A[primecount++] = 2;
for (i=3;i<upperlimit;i++)
{
if (primecount == A.ListSize())
A.Resize(primecount+10);
if (i % 2 == 0)
continue;
j = 3;
while (j <= i/2 && i % j != 0)
j+=2;
if (j>;i/2)
A[primecount++] = i;
}
for (i=0;i<primecount;i++)
{
cout<<setw(5)<<A[i];
if ((i+1)%10 == 0)
cout<<endl;
}
cout <<endl;
return 0;
}


vivip 2006-08-14 15:49 发表评论
]]>2006.08.09http://www.cppblog.com/vivip/articles/11095.htmlvivipvivipThu, 10 Aug 2006 09:20:00 GMThttp://www.cppblog.com/vivip/articles/11095.htmlhttp://www.cppblog.com/vivip/comments/11095.htmlhttp://www.cppblog.com/vivip/articles/11095.html#Feedback0http://www.cppblog.com/vivip/comments/commentRss/11095.htmlhttp://www.cppblog.com/vivip/services/trackbacks/11095.html     没有学习，惰性上来了。

vivip 2006-08-10 17:20 发表评论
]]>2006.08.08http://www.cppblog.com/vivip/articles/11031.htmlvivipvivipWed, 09 Aug 2006 01:44:00 GMThttp://www.cppblog.com/vivip/articles/11031.htmlhttp://www.cppblog.com/vivip/comments/11031.htmlhttp://www.cppblog.com/vivip/articles/11031.html#Feedback0http://www.cppblog.com/vivip/comments/commentRss/11031.htmlhttp://www.cppblog.com/vivip/services/trackbacks/11031.html #ifndef STACK_TMP_H
#define STACK_TMP_H

#include <iostream.h>
#include <stdlib.h>

const int MaxStackSize = 50;

template <class T>
class Stack
{
private:
T StackList[MaxStackSize];
int top;
public:
Stack();
void Push(const T& item);
T Pop();
void ClearStack();
T Peek() const;
int StackEmpty() const;
int StackFull() const;
};

template <class T>
Stack<T>::Stack()
{
top = -1;
}

template <class T>
void Stack<T>::Push(const T& item)
{
if (top == MaxStackSize-1)
{
exit(1);
}
StackList[++top] = item;
}

template <class T>
T Stack<T>::Pop()
{
if (top == -1)
exit(1);
T tmp;
tmp = StackList[top--];
return tmp;
}

template <class T>
void Stack<T>::ClearStack()
{
top = -1;
}

template <class T>
T Stack<T>::Peek() const
{
if (top == -1)
exit(1);
return StackList[top];
}

template <class T>
int Stack<T>::StackEmpty() const
{
return (top == -1);
}

template <class T>
int Stack<T>::StackFull() const
{
return (top == MaxStackSize-1);
}

#endif


vivip 2006-08-09 09:44 发表评论
]]>2006.08.07http://www.cppblog.com/vivip/articles/10962.htmlvivipvivipTue, 08 Aug 2006 02:06:00 GMThttp://www.cppblog.com/vivip/articles/10962.htmlhttp://www.cppblog.com/vivip/comments/10962.htmlhttp://www.cppblog.com/vivip/articles/10962.html#Feedback0http://www.cppblog.com/vivip/comments/commentRss/10962.htmlhttp://www.cppblog.com/vivip/services/trackbacks/10962.html ㅏ ,ㅑ ,ㅓ ,ㅕ,ㅗ,ㅛ ,ㅡ,ㅣ
reflector,terrific,vendor,ferryboat.
#ifndef RATIONAL_H_
#define RATIONAL_H_

#include <iostream.h>
#include <stdlib.h>

class Rational //有理数类
{
private:
long num,den;//分子分母
Rational(long number,long denom);
void Standordize();//将分母转换为正数
long gcd(long m,long n) const;//最大公约数
public:
Rational(int number=0,long denom=1);
Rational(double x);//double类型转换为有理数

friend istream& operator >>(istream& istr,Rational &x);
friend ostream& operator <<(ostream& ostr,const Rational &x);

Rational operator +(Rational v) const;
Rational operator -(Rational v) const;
Rational operator *(Rational v) const;
Rational operator /(Rational v) const;

Rational operator -() const;

int operator <(Rational v) const;
int operator >(Rational v) const;
int operator <=(Rational v) const;
int operator >=(Rational v) const;
int operator ==(Rational v) const;
int operator !=(Rational v) const;

operator double() const;//有理数转换为double

long GetNumberator() const;
long GetDenominator() const;
void Reduce();//最简形式
};

#endif



#include "Rational.h"

long Rational::gcd(long m,long n) const
{
long r;
if (m==0 || n==0)
exit(1);
while (r = m % n)
{
m = n;
n = r;
}
return n;
}

void Rational::Standordize()
{
if (den < 0)
{
den = -den;
num = -num;
}
}

Rational::Rational(int number/* =0 */,long denom/* =1 */)
{
if (denom == 0)
exit(1);
num = number;
den = denom;
Standordize();
}

Rational::Rational(long number,long denom):num(number),den(denom)
{
if (den == 0)
exit(1);
}

Rational::Rational(double x)
{
double var1,var2;
var1 = 100000000L * x;
var2 = 10000000L * x;
num = long(var1-var2);
den = 90000000L;
Reduce();
}

void Rational::Reduce()
{
long r = gcd(num,den);
num /= r;
den /= r;
}

long Rational::GetDenominator() const
{
return den;
}

long Rational::GetNumberator() const
{
return num;
}

Rational Rational::operator +(Rational v) const
{
return Rational(num*v.GetDenominator()+v.GetNumberator()*den,den*v.GetDenominator());
}

Rational Rational::operator -(Rational v) const
{
return Rational(num*v.GetDenominator()-v.GetNumberator()*den,den*v.GetDenominator());
}
Rational Rational::operator *(Rational v) const
{
return Rational(num*v.GetNumberator(),den*v.GetDenominator());
}
Rational Rational::operator /(Rational v) const
{
return Rational(num*v.GetDenominator(),den*v.GetNumberator());
}

Rational Rational::operator -() const
{
return Rational(-num,den);
}

int Rational::operator <(Rational v) const
{
return den*v.GetDenominator()>0 ? num*v.GetDenominator()<v.GetNumberator()*den : num*v.GetDenominator()>v.GetNumberator()*den;
}

int Rational::operator >(Rational v) const
{
return den*v.GetDenominator()>0 ? num*v.GetDenominator()>v.GetNumberator()*den : num*v.GetDenominator()<v.GetNumberator()*den;
}

int Rational::operator <=(Rational v) const
{
return den*v.GetDenominator()>0 ? num*v.GetDenominator()<=v.GetNumberator()*den : num*v.GetDenominator()>=v.GetNumberator()*den;
}

int Rational::operator >=(Rational v) const
{
return den*v.GetDenominator()>0 ? num*v.GetDenominator()>=v.GetNumberator()*den : num*v.GetDenominator()<=v.GetNumberator()*den;
}

int Rational::operator ==(Rational v) const
{
return num*v.GetDenominator()==v.GetNumberator()*den;
}

int Rational::operator !=(Rational v) const
{
return num*v.GetDenominator()!=v.GetNumberator()*den;
}

Rational::operator double() const
{
return double(num)/den;
}

istream& operator >>(istream& istr,Rational &x)
{
char c;
istr>>x.num>>c>>x.den;
if (x.den == 0)
{
exit(1);
}
return istr;
}

ostream& operator <<(ostream& ostr,const Rational &x)
{
ostr<<"the num is:"<<x.num<<endl;
ostr<<"the den is:"<<x.den<<endl;
return ostr;
}


vivip 2006-08-08 10:06 发表评论
]]>