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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
// 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 "Array.h"
#if defined (HEAVYWEIGHT_INDEXING)
#include "idx-vector.h"
#include "Array-idx.h"
#endif
#include "lo-error.h"
// One dimensional array class. Handles the reference counting for
// all the derived classes.
template <class T>
Array<T>::Array (int n, const T& val)
{
rep = new ArrayRep (n);
for (int i = 0; i < n; i++)
rep->data[i] = val;
#ifdef HEAVYWEIGHT_INDEXING
max_indices = 1;
idx_count = 0;
idx = 0;
#endif
}
template <class T>
Array<T>::~Array (void)
{
if (--rep->count <= 0)
delete rep;
#ifdef HEAVYWEIGHT_INDEXING
delete [] idx;
#endif
}
template <class T>
Array<T>&
Array<T>::operator = (const Array<T>& a)
{
if (this != &a && rep != a.rep)
{
if (--rep->count <= 0)
delete rep;
rep = a.rep;
rep->count++;
}
#ifdef HEAVYWEIGHT_INDEXING
max_indices = 1;
idx_count = 0;
idx = 0;
#endif
return *this;
}
template <class T>
void
Array<T>::resize (int n)
{
if (n < 0)
{
(*current_liboctave_error_handler) ("can't resize to negative dimension");
return;
}
if (n == length ())
return;
ArrayRep *old_rep = rep;
const T *old_data = data ();
int old_len = length ();
rep = new ArrayRep (n);
if (old_data && old_len > 0)
{
int min_len = old_len < n ? old_len : n;
for (int i = 0; i < min_len; i++)
xelem (i) = old_data[i];
}
if (--old_rep->count <= 0)
delete old_rep;
}
template <class T>
void
Array<T>::resize (int n, const T& val)
{
if (n < 0)
{
(*current_liboctave_error_handler) ("can't resize to negative dimension");
return;
}
if (n == length ())
return;
ArrayRep *old_rep = rep;
const T *old_data = data ();
int old_len = length ();
rep = new ArrayRep (n);
int min_len = old_len < n ? old_len : n;
if (old_data && old_len > 0)
{
for (int i = 0; i < min_len; i++)
xelem (i) = old_data[i];
}
for (int i = old_len; i < n; i++)
xelem (i) = val;
if (--old_rep->count <= 0)
delete old_rep;
}
template <class T>
T *
Array<T>::fortran_vec (void)
{
if (rep->count > 1)
{
--rep->count;
rep = new ArrayRep (*rep);
}
return rep->data;
}
template <class T>
T
Array<T>::range_error (const char *fcn, int n) const
{
(*current_liboctave_error_handler) ("%s (%d): range error", fcn, n);
return T ();
}
template <class T>
T&
Array<T>::range_error (const char *fcn, int n)
{
(*current_liboctave_error_handler) ("%s (%d): range error", fcn, n);
static T foo;
return foo;
}
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
