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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
|
// Template array classes
/*
Copyright (C) 1996 John W. Eaton
This file is part of Octave.
Octave 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 2, or (at your option) any
later version.
Octave 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 Octave; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#if defined (__GNUG__)
#pragma implementation
#endif
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <cassert>
#include <iostream.h>
#include "Array3.h"
#if defined (HEAVYWEIGHT_INDEXING)
#include "idx-vector.h"
#include "Array3-idx.h"
#endif
#include "lo-error.h"
// Three dimensional array class.
template <class T>
void
Array3<T>::resize (int r, int c, int p)
{
if (r < 0 || c < 0 || p < 0)
{
(*current_liboctave_error_handler)
("can't resize to negative dimension");
return;
}
if (r == dim1 () && c == dim2 () && p == dim3 ())
return;
ArrayRep *old_rep = rep;
const T *old_data = data ();
int old_d1 = dim1 ();
int old_d2 = dim2 ();
int old_d3 = dim3 ();
int old_len = length ();
rep = new ArrayRep (r*c*p);
d1 = r;
d2 = c;
d3 = p;
if (old_data && old_len > 0)
{
int min_r = old_d1 < r ? old_d1 : r;
int min_c = old_d2 < c ? old_d2 : c;
int min_p = old_d3 < p ? old_d3 : p;
for (int k = 0; k < min_p; k++)
for (int j = 0; j < min_c; j++)
for (int i = 0; i < min_r; i++)
xelem (i, j, k) = old_data[old_d1*(old_d2*k+j)+i];
}
if (--old_rep->count <= 0)
delete old_rep;
}
template <class T>
void
Array3<T>::resize (int r, int c, int p, const T& val)
{
if (r < 0 || c < 0 || p < 0)
{
(*current_liboctave_error_handler)
("can't resize to negative dimension");
return;
}
if (r == dim1 () && c == dim2 () && p == dim3 ())
return;
ArrayRep *old_rep = rep;
const T *old_data = data ();
int old_d1 = dim1 ();
int old_d2 = dim2 ();
int old_d3 = dim3 ();
int old_len = length ();
rep = new ArrayRep (r*c*p);
d1 = r;
d2 = c;
d3 = p;
int min_r = old_d1 < r ? old_d1 : r;
int min_c = old_d2 < c ? old_d2 : c;
int min_p = old_d3 < p ? old_d3 : p;
if (old_data && old_len > 0)
for (int k = 0; k < min_p; k++)
for (int j = 0; j < min_c; j++)
for (int i = 0; i < min_r; i++)
xelem (i, j, k) = old_data[old_d1*(old_d2*k+j)+i];
// If the copy constructor is expensive, this may win. Otherwise,
// it may make more sense to just copy the value everywhere when
// making the new ArrayRep.
for (int k = 0; k < min_p; k++)
for (int j = min_c; j < c; j++)
for (int i = 0; i < min_r; i++)
xelem (i, j, k) = val;
for (int k = 0; k < min_p; k++)
for (int j = 0; j < c; j++)
for (int i = min_r; i < r; i++)
xelem (i, j, k) = val;
for (int k = min_p; k < p; k++)
for (int j = 0; j < c; j++)
for (int i = 0; i < r; i++)
xelem (i, j, k) = val;
if (--old_rep->count <= 0)
delete old_rep;
}
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
