VectorVector::operator+(constVector&b)const { returnVector(x+b.x,y+b.y); } VectorVector::operator-(constVector&b)const { returnVector(x-b.x,y-b.y); } VectorVector::operator-()const { returnVector(-x,-y); } VectorVector::operator*(doublen)const { returnVector(x*n,y*n); } ...
下面给出一个排序算法, 它属于数据表类的成员函数, 其中currentSize是数据表实例的当前长度, Vector[ ] 是存放数据表元素的一维数组。template
VectorVector::operator+(constVector&b)const { returnVector(x+b.x,y+b.y); } VectorVector::operator-(constVector&b)const { returnVector(x-b.x,y-b.y); } VectorVector::operator-()const { returnVector(-x,-y); } VectorVector::operator*(doublen)const { returnVector(x*n,y*n); } ...
1下面给出一个排序算法,它属于数据表类的成员函数,其中currentSize是数据表实例的当前长度,Vector[ ] 是存放数据表元素的一维数组。template void dataList :: unknown ( ) {T temp; int i, j, n = currentSize;for ( i = 1; i < n; i++ )if ( Vector[i] .key < Vector[i-1].key ) {temp...