make2db.h

来自「单源最短路径问题」· C头文件 代码 · 共 48 行

#ifndef Make2DArray_
#define Make2DArray_

template <class T>
void Make1DArray(T * &x, int cols){
	x = new T[cols];
}

template <class T>
void Make2DArray(T ** &x, int rows, int cols){
	x = new T * [rows];
	for (int i = 0; i < rows; i++)
		x[i] = new T[cols];
}

template <class T>
void Make3DArray(T *** &x, int plan, int rows, int cols){
	x = new T ** [plan];
	for (int i = 0; i < plan; i++)
		x[i] = new T* [rows];
	for (int i = 0; i < plan; i++)
		for (int j = 0; j < rows; j++)
			x[i][j] = new T[cols];
}

template <class T>
void remove1DArray(T * &x){
	delete [] x;
}

template <class T>
void remove2DArray(T ** &x, int rows){
	for (int i = 0; i < rows; i++)
		delete [] x[i];
	delete [] x;
}

template <class T>
void remove3DArray(T *** &x, int plan, int rows){
	for (int i = 0; i < plan; i++)
		for (int j = 0; j < rows; j++)
			delete [] x[i][j];
	for (int i = 0; i < rows; i++)
		delete [] x[i];
	delete [] x;
}
#endif