「C++第14週実験報告1-1」---専門的な配列類処理に関する配列の操作を確立する
4140 ワード
/*
【 1】
。C C++ ,
。 , 。
C++ abstraction, 。 : ,
size, 。 C++ , C ,
, 。 C++ 。
, C++ , Vector 。
, Vector 。
, , C++ 。
*/
/* ( )
*
* Copyright (c) 2011,
* All rights reserved.
* : MyArray.cpp
* : 114-3
* : 2012 5 21
* : V 1.0
*
*
*/
#include <iostream>
using namespace std;
class MyArray
{
private:
int *arr; //
int size; //
public:
MyArray(int sz=50);
MyArray(int a[], int sz); //
MyArray(const MyArray &A); //
~MyArray(void); // ,
MyArray & operator = (const MyArray &A); // “=”
int & operator [] (int i); // [], Array C++ , a[i] 【 】
bool operator == (MyArray& A); // ==, Array (size )
MyArray operator + (MyArray& A); // +, Array ( )【 】
friend ostream& operator << (ostream& out, MyArray& A); // <<,
int GetSize(void)const; // ;
void Resize(int sz); // , sz , ;sz , 【 】
};
MyArray::MyArray(int sz)
{
size = sz;
arr = new int [size];
for (int i = 0; i < size; ++i)
arr[i] = 0;
}
MyArray::MyArray(int a[], int sz)
{
size = sz;
arr = new int [size];
for (int i = 0; i < size; ++i)
arr[i] = a[i];
}
MyArray::MyArray(const MyArray &A)
{
this->size = A.size;
this->arr = new int [this->size];
for (int i = 0; i < size; ++i)
this->arr[i] = A.arr[i];
}
MyArray::~MyArray(void)
{
delete []arr;
}
MyArray & MyArray::operator = (const MyArray &A)
{
this->size = A.size;
this->arr = new int [this->size];
for (int i = 0; i < size; ++i)
this->arr[i] = A.arr[i];
return *this;
}
int & MyArray::operator[] (int i)
{
return arr[i];
}
bool MyArray::operator == (MyArray& A)
{
if (this->size != A.size)
return false;
for (int i = 0; i < this->size; ++i)
{
if (this->arr[i] != A.arr[i])
return false;
}
return true;
}
MyArray MyArray::operator + (MyArray& A)
{
if (this->size == A.size)
{
MyArray ma(A);
for (int i = 0; i < this->size; ++i)
{
ma.arr[i] = this->arr[i] + A.arr[i];
}
return ma;
}
else
cout << " !" << endl;
return *this;
}
ostream& operator << (ostream& out, MyArray& A)
{
cout << " :" << endl;
for (int i = 0; i < A.size; ++i)
out << "arr[" << i << "]=" << A.arr[i] << endl;
return out;
}
int MyArray::GetSize(void)const
{
return size;
}
void MyArray::Resize(int sz)
{
if (size > sz)
{
for (int i = sz; i < size; ++i)
arr[i] = 0;
size = sz;
}
else
{
int *sarr = new int [sz];
for (int i = 0; i < size; ++i)
sarr[i] = arr[i];
for (int i = size; i < sz; ++i)
{
sarr[i] = 0;
}
arr = sarr;
size = sz;
}
}
int main()
{
int a[10] = {1,2,3,4,5,6,7,8,9,10};
int b[10] = {4,5,6,7,8,9,10,11,12,13};
MyArray arr1(a, 10);
MyArray arr2(b, 10);
MyArray arr3(10);
cout << arr3;
arr3 = arr1 + arr2;
cout << arr3;
arr3.Resize(20);
cout << arr3;
arr3.Resize(5);
cout << arr3;
system("pause");
return 0;
}
/*
:
arr[0]=0
arr[1]=0
arr[2]=0
arr[3]=0
arr[4]=0
arr[5]=0
arr[6]=0
arr[7]=0
arr[8]=0
arr[9]=0
:
arr[0]=5
arr[1]=7
arr[2]=9
arr[3]=11
arr[4]=13
arr[5]=15
arr[6]=17
arr[7]=19
arr[8]=21
arr[9]=23
:
arr[0]=5
arr[1]=7
arr[2]=9
arr[3]=11
arr[4]=13
arr[5]=15
arr[6]=17
arr[7]=19
arr[8]=21
arr[9]=23
arr[10]=0
arr[11]=0
arr[12]=0
arr[13]=0
arr[14]=0
arr[15]=0
arr[16]=0
arr[17]=0
arr[18]=0
arr[19]=0
:
arr[0]=5
arr[1]=7
arr[2]=9
arr[3]=11
arr[4]=13
. . .
*/