1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
/*
* Copyright (C) 2010 Regents of the University of Michigan
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __MEMORY_ALLOCATORS_H__
#define __MEMORY_ALLOCATORS_H__
#include <stdlib.h>
template <class T> T** AllocateMatrix(int rows, int cols);
template <class T> T** AllocateMatrix(int rows, int cols, T value);
template <class T> void FreeMatrix(T ** & matrix, int rows);
char ** AllocateCharMatrix(int rows, int cols);
void FreeCharMatrix(char ** & matrix, int rows);
float ** AllocateFloatMatrix(int rows, int cols);
void FreeFloatMatrix(float ** & matrix, int rows);
double ** AllocateDoubleMatrix(int rows, int cols);
void FreeDoubleMatrix(double ** & matrix, int rows);
int ** AllocateIntMatrix(int rows, int cols);
void FreeIntMatrix(int ** & matrix, int rows);
short ** AllocateShortMatrix(int rows, int cols);
void FreeShortMatrix(short ** & matrix, int rows);
char *** AllocateCharCube(int n, int rows, int cols);
void FreeCharCube(char *** & matrix, int n, int rows);
// Template definitions follow ...
//
template <class T> T** AllocateMatrix(int rows, int cols)
{
T ** matrix = new T * [rows];
// Stop early if we are out of memory
if (matrix == NULL)
return NULL;
for (int i = 0; i < rows; i++)
{
matrix[i] = new T [cols];
// Safely unravel allocation if we run out of memory
if (matrix[i] == NULL)
{
while (i--)
delete [] matrix[i];
delete [] matrix;
return NULL;
}
}
return matrix;
};
template <class T> T** AllocateMatrix(int rows, int cols, T value)
{
T ** matrix = AllocateMatrix<T>(rows, cols);
if (matrix != NULL)
for (int i = 0; i < rows; i++)
for (int j = 0; j < cols; j++)
matrix[i][j] = value;
return matrix;
};
template <class T> void FreeMatrix(T ** & matrix, int rows)
{
if (matrix == NULL)
return;
for (int i = 0; i < rows; i++)
delete [] matrix[i];
delete [] matrix;
matrix = NULL;
};
#endif
|
