|
5164
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 2004 David Bateman |
|
|
4 Copyright (C) 1998-2004 Andy Adler |
|
|
5 |
|
|
6 Octave is free software; you can redistribute it and/or modify it |
|
|
7 under the terms of the GNU General Public License as published by the |
|
|
8 Free Software Foundation; either version 2, or (at your option) any |
|
|
9 later version. |
|
|
10 |
|
|
11 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
14 for more details. |
|
|
15 |
|
|
16 You should have received a copy of the GNU General Public License |
|
5307
|
17 along with this program; see the file COPYING. If not, write to the |
|
|
18 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
|
|
19 Boston, MA 02110-1301, USA. |
|
5164
|
20 |
|
|
21 */ |
|
|
22 |
|
|
23 #ifdef HAVE_CONFIG_H |
|
|
24 #include <config.h> |
|
|
25 #endif |
|
|
26 |
|
|
27 #include "quit.h" |
|
|
28 #include "lo-error.h" |
|
|
29 #include "MArray2.h" |
|
|
30 #include "Array-util.h" |
|
|
31 |
|
|
32 #include "MSparse.h" |
|
|
33 #include "MSparse-defs.h" |
|
|
34 |
|
|
35 // sparse array with math ops. |
|
|
36 |
|
|
37 // Element by element MSparse by MSparse ops. |
|
|
38 |
|
|
39 template <class T> |
|
|
40 MSparse<T>& |
|
|
41 operator += (MSparse<T>& a, const MSparse<T>& b) |
|
|
42 { |
|
|
43 MSparse<T> r; |
|
|
44 |
|
5275
|
45 octave_idx_type a_nr = a.rows (); |
|
|
46 octave_idx_type a_nc = a.cols (); |
|
5164
|
47 |
|
5275
|
48 octave_idx_type b_nr = b.rows (); |
|
|
49 octave_idx_type b_nc = b.cols (); |
|
5164
|
50 |
|
|
51 if (a_nr != b_nr || a_nc != b_nc) |
|
|
52 gripe_nonconformant ("operator +=" , a_nr, a_nc, b_nr, b_nc); |
|
|
53 else |
|
|
54 { |
|
|
55 r = MSparse<T> (a_nr, a_nc, (a.nnz () + b.nnz ())); |
|
|
56 |
|
5275
|
57 octave_idx_type jx = 0; |
|
|
58 for (octave_idx_type i = 0 ; i < a_nc ; i++) |
|
5164
|
59 { |
|
5275
|
60 octave_idx_type ja = a.cidx(i); |
|
|
61 octave_idx_type ja_max = a.cidx(i+1); |
|
5164
|
62 bool ja_lt_max= ja < ja_max; |
|
|
63 |
|
5275
|
64 octave_idx_type jb = b.cidx(i); |
|
|
65 octave_idx_type jb_max = b.cidx(i+1); |
|
5164
|
66 bool jb_lt_max = jb < jb_max; |
|
|
67 |
|
|
68 while (ja_lt_max || jb_lt_max ) |
|
|
69 { |
|
|
70 OCTAVE_QUIT; |
|
|
71 if ((! jb_lt_max) || |
|
|
72 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) |
|
|
73 { |
|
|
74 r.ridx(jx) = a.ridx(ja); |
|
|
75 r.data(jx) = a.data(ja) + 0.; |
|
|
76 jx++; |
|
|
77 ja++; |
|
|
78 ja_lt_max= ja < ja_max; |
|
|
79 } |
|
|
80 else if (( !ja_lt_max ) || |
|
|
81 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) |
|
|
82 { |
|
|
83 r.ridx(jx) = b.ridx(jb); |
|
|
84 r.data(jx) = 0. + b.data(jb); |
|
|
85 jx++; |
|
|
86 jb++; |
|
|
87 jb_lt_max= jb < jb_max; |
|
|
88 } |
|
|
89 else |
|
|
90 { |
|
|
91 if ((a.data(ja) + b.data(jb)) != 0.) |
|
|
92 { |
|
|
93 r.data(jx) = a.data(ja) + b.data(jb); |
|
|
94 r.ridx(jx) = a.ridx(ja); |
|
|
95 jx++; |
|
|
96 } |
|
|
97 ja++; |
|
|
98 ja_lt_max= ja < ja_max; |
|
|
99 jb++; |
|
|
100 jb_lt_max= jb < jb_max; |
|
|
101 } |
|
|
102 } |
|
|
103 r.cidx(i+1) = jx; |
|
|
104 } |
|
|
105 |
|
|
106 a = r.maybe_compress (); |
|
|
107 } |
|
|
108 |
|
|
109 return a; |
|
|
110 } |
|
|
111 |
|
|
112 template <class T> |
|
|
113 MSparse<T>& |
|
|
114 operator -= (MSparse<T>& a, const MSparse<T>& b) |
|
|
115 { |
|
|
116 MSparse<T> r; |
|
|
117 |
|
5275
|
118 octave_idx_type a_nr = a.rows (); |
|
|
119 octave_idx_type a_nc = a.cols (); |
|
5164
|
120 |
|
5275
|
121 octave_idx_type b_nr = b.rows (); |
|
|
122 octave_idx_type b_nc = b.cols (); |
|
5164
|
123 |
|
|
124 if (a_nr != b_nr || a_nc != b_nc) |
|
|
125 gripe_nonconformant ("operator -=" , a_nr, a_nc, b_nr, b_nc); |
|
|
126 else |
|
|
127 { |
|
|
128 r = MSparse<T> (a_nr, a_nc, (a.nnz () + b.nnz ())); |
|
|
129 |
|
5275
|
130 octave_idx_type jx = 0; |
|
|
131 for (octave_idx_type i = 0 ; i < a_nc ; i++) |
|
5164
|
132 { |
|
5275
|
133 octave_idx_type ja = a.cidx(i); |
|
|
134 octave_idx_type ja_max = a.cidx(i+1); |
|
5164
|
135 bool ja_lt_max= ja < ja_max; |
|
|
136 |
|
5275
|
137 octave_idx_type jb = b.cidx(i); |
|
|
138 octave_idx_type jb_max = b.cidx(i+1); |
|
5164
|
139 bool jb_lt_max = jb < jb_max; |
|
|
140 |
|
|
141 while (ja_lt_max || jb_lt_max ) |
|
|
142 { |
|
|
143 OCTAVE_QUIT; |
|
|
144 if ((! jb_lt_max) || |
|
|
145 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) |
|
|
146 { |
|
|
147 r.ridx(jx) = a.ridx(ja); |
|
|
148 r.data(jx) = a.data(ja) - 0.; |
|
|
149 jx++; |
|
|
150 ja++; |
|
|
151 ja_lt_max= ja < ja_max; |
|
|
152 } |
|
|
153 else if (( !ja_lt_max ) || |
|
|
154 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) |
|
|
155 { |
|
|
156 r.ridx(jx) = b.ridx(jb); |
|
|
157 r.data(jx) = 0. - b.data(jb); |
|
|
158 jx++; |
|
|
159 jb++; |
|
|
160 jb_lt_max= jb < jb_max; |
|
|
161 } |
|
|
162 else |
|
|
163 { |
|
|
164 if ((a.data(ja) - b.data(jb)) != 0.) |
|
|
165 { |
|
|
166 r.data(jx) = a.data(ja) - b.data(jb); |
|
|
167 r.ridx(jx) = a.ridx(ja); |
|
|
168 jx++; |
|
|
169 } |
|
|
170 ja++; |
|
|
171 ja_lt_max= ja < ja_max; |
|
|
172 jb++; |
|
|
173 jb_lt_max= jb < jb_max; |
|
|
174 } |
|
|
175 } |
|
|
176 r.cidx(i+1) = jx; |
|
|
177 } |
|
|
178 |
|
|
179 a = r.maybe_compress (); |
|
|
180 } |
|
|
181 |
|
|
182 return a; |
|
|
183 } |
|
|
184 |
|
|
185 // Element by element MSparse by scalar ops. |
|
|
186 |
|
|
187 #define SPARSE_A2S_OP_1(OP) \ |
|
|
188 template <class T> \ |
|
|
189 MArray2<T> \ |
|
|
190 operator OP (const MSparse<T>& a, const T& s) \ |
|
|
191 { \ |
|
5275
|
192 octave_idx_type nr = a.rows (); \ |
|
|
193 octave_idx_type nc = a.cols (); \ |
|
5164
|
194 \ |
|
|
195 MArray2<T> r (nr, nc, (0.0 OP s)); \ |
|
|
196 \ |
|
5275
|
197 for (octave_idx_type j = 0; j < nc; j++) \ |
|
|
198 for (octave_idx_type i = a.cidx(j); i < a.cidx(j+1); i++) \ |
|
5164
|
199 r.elem (a.ridx (i), j) = a.data (i) OP s; \ |
|
|
200 return r; \ |
|
|
201 } |
|
|
202 |
|
|
203 #define SPARSE_A2S_OP_2(OP) \ |
|
|
204 template <class T> \ |
|
|
205 MSparse<T> \ |
|
|
206 operator OP (const MSparse<T>& a, const T& s) \ |
|
|
207 { \ |
|
5275
|
208 octave_idx_type nr = a.rows (); \ |
|
|
209 octave_idx_type nc = a.cols (); \ |
|
|
210 octave_idx_type nz = a.nnz (); \ |
|
5164
|
211 \ |
|
|
212 MSparse<T> r (nr, nc, nz); \ |
|
|
213 \ |
|
5275
|
214 for (octave_idx_type i = 0; i < nz; i++) \ |
|
5164
|
215 { \ |
|
|
216 r.data(i) = a.data(i) OP s; \ |
|
|
217 r.ridx(i) = a.ridx(i); \ |
|
|
218 } \ |
|
5275
|
219 for (octave_idx_type i = 0; i < nc + 1; i++) \ |
|
5164
|
220 r.cidx(i) = a.cidx(i); \ |
|
|
221 r.maybe_compress (true); \ |
|
|
222 return r; \ |
|
|
223 } |
|
|
224 |
|
|
225 |
|
|
226 SPARSE_A2S_OP_1 (+) |
|
|
227 SPARSE_A2S_OP_1 (-) |
|
|
228 SPARSE_A2S_OP_2 (*) |
|
|
229 SPARSE_A2S_OP_2 (/) |
|
|
230 |
|
|
231 // Element by element scalar by MSparse ops. |
|
|
232 |
|
|
233 #define SPARSE_SA2_OP_1(OP) \ |
|
|
234 template <class T> \ |
|
|
235 MArray2<T> \ |
|
|
236 operator OP (const T& s, const MSparse<T>& a) \ |
|
|
237 { \ |
|
5275
|
238 octave_idx_type nr = a.rows (); \ |
|
|
239 octave_idx_type nc = a.cols (); \ |
|
5164
|
240 \ |
|
|
241 MArray2<T> r (nr, nc, (s OP 0.0)); \ |
|
|
242 \ |
|
5275
|
243 for (octave_idx_type j = 0; j < nc; j++) \ |
|
|
244 for (octave_idx_type i = a.cidx(j); i < a.cidx(j+1); i++) \ |
|
5164
|
245 r.elem (a.ridx (i), j) = s OP a.data (i); \ |
|
|
246 return r; \ |
|
|
247 } |
|
|
248 |
|
|
249 #define SPARSE_SA2_OP_2(OP) \ |
|
|
250 template <class T> \ |
|
|
251 MSparse<T> \ |
|
|
252 operator OP (const T& s, const MSparse<T>& a) \ |
|
|
253 { \ |
|
5275
|
254 octave_idx_type nr = a.rows (); \ |
|
|
255 octave_idx_type nc = a.cols (); \ |
|
|
256 octave_idx_type nz = a.nnz (); \ |
|
5164
|
257 \ |
|
|
258 MSparse<T> r (nr, nc, nz); \ |
|
|
259 \ |
|
5275
|
260 for (octave_idx_type i = 0; i < nz; i++) \ |
|
5164
|
261 { \ |
|
|
262 r.data(i) = s OP a.data(i); \ |
|
|
263 r.ridx(i) = a.ridx(i); \ |
|
|
264 } \ |
|
5275
|
265 for (octave_idx_type i = 0; i < nc + 1; i++) \ |
|
5164
|
266 r.cidx(i) = a.cidx(i); \ |
|
|
267 r.maybe_compress (true); \ |
|
|
268 return r; \ |
|
|
269 } |
|
|
270 |
|
|
271 SPARSE_SA2_OP_1 (+) |
|
|
272 SPARSE_SA2_OP_1 (-) |
|
|
273 SPARSE_SA2_OP_2 (*) |
|
|
274 SPARSE_SA2_OP_2 (/) |
|
|
275 |
|
|
276 // Element by element MSparse by MSparse ops. |
|
|
277 |
|
|
278 #define SPARSE_A2A2_OP(OP) \ |
|
|
279 template <class T> \ |
|
|
280 MSparse<T> \ |
|
|
281 operator OP (const MSparse<T>& a, const MSparse<T>& b) \ |
|
|
282 { \ |
|
|
283 MSparse<T> r; \ |
|
|
284 \ |
|
5275
|
285 octave_idx_type a_nr = a.rows (); \ |
|
|
286 octave_idx_type a_nc = a.cols (); \ |
|
5164
|
287 \ |
|
5275
|
288 octave_idx_type b_nr = b.rows (); \ |
|
|
289 octave_idx_type b_nc = b.cols (); \ |
|
5164
|
290 \ |
|
|
291 if (a_nr != b_nr || a_nc != b_nc) \ |
|
|
292 gripe_nonconformant ("operator " # OP, a_nr, a_nc, b_nr, b_nc); \ |
|
|
293 else \ |
|
|
294 { \ |
|
|
295 r = MSparse<T> (a_nr, a_nc, (a.nnz () + b.nnz ())); \ |
|
|
296 \ |
|
5275
|
297 octave_idx_type jx = 0; \ |
|
5164
|
298 r.cidx (0) = 0; \ |
|
5275
|
299 for (octave_idx_type i = 0 ; i < a_nc ; i++) \ |
|
5164
|
300 { \ |
|
5275
|
301 octave_idx_type ja = a.cidx(i); \ |
|
|
302 octave_idx_type ja_max = a.cidx(i+1); \ |
|
5164
|
303 bool ja_lt_max= ja < ja_max; \ |
|
|
304 \ |
|
5275
|
305 octave_idx_type jb = b.cidx(i); \ |
|
|
306 octave_idx_type jb_max = b.cidx(i+1); \ |
|
5164
|
307 bool jb_lt_max = jb < jb_max; \ |
|
|
308 \ |
|
|
309 while (ja_lt_max || jb_lt_max ) \ |
|
|
310 { \ |
|
|
311 OCTAVE_QUIT; \ |
|
|
312 if ((! jb_lt_max) || \ |
|
|
313 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) \ |
|
|
314 { \ |
|
|
315 r.ridx(jx) = a.ridx(ja); \ |
|
|
316 r.data(jx) = a.data(ja) OP 0.; \ |
|
|
317 jx++; \ |
|
|
318 ja++; \ |
|
|
319 ja_lt_max= ja < ja_max; \ |
|
|
320 } \ |
|
|
321 else if (( !ja_lt_max ) || \ |
|
|
322 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) \ |
|
|
323 { \ |
|
|
324 r.ridx(jx) = b.ridx(jb); \ |
|
|
325 r.data(jx) = 0. OP b.data(jb); \ |
|
|
326 jx++; \ |
|
|
327 jb++; \ |
|
|
328 jb_lt_max= jb < jb_max; \ |
|
|
329 } \ |
|
|
330 else \ |
|
|
331 { \ |
|
|
332 if ((a.data(ja) OP b.data(jb)) != 0.) \ |
|
|
333 { \ |
|
|
334 r.data(jx) = a.data(ja) OP b.data(jb); \ |
|
|
335 r.ridx(jx) = a.ridx(ja); \ |
|
|
336 jx++; \ |
|
|
337 } \ |
|
|
338 ja++; \ |
|
|
339 ja_lt_max= ja < ja_max; \ |
|
|
340 jb++; \ |
|
|
341 jb_lt_max= jb < jb_max; \ |
|
|
342 } \ |
|
|
343 } \ |
|
|
344 r.cidx(i+1) = jx; \ |
|
|
345 } \ |
|
|
346 \ |
|
|
347 r.maybe_compress (); \ |
|
|
348 } \ |
|
|
349 \ |
|
|
350 return r; \ |
|
|
351 } |
|
|
352 |
|
|
353 #define SPARSE_A2A2_FCN_1(FCN, OP) \ |
|
|
354 template <class T> \ |
|
|
355 MSparse<T> \ |
|
|
356 FCN (const MSparse<T>& a, const MSparse<T>& b) \ |
|
|
357 { \ |
|
|
358 MSparse<T> r; \ |
|
|
359 \ |
|
5275
|
360 octave_idx_type a_nr = a.rows (); \ |
|
|
361 octave_idx_type a_nc = a.cols (); \ |
|
5164
|
362 \ |
|
5275
|
363 octave_idx_type b_nr = b.rows (); \ |
|
|
364 octave_idx_type b_nc = b.cols (); \ |
|
5164
|
365 \ |
|
|
366 if (a_nr != b_nr || a_nc != b_nc) \ |
|
|
367 gripe_nonconformant (#FCN, a_nr, a_nc, b_nr, b_nc); \ |
|
|
368 else \ |
|
|
369 { \ |
|
|
370 r = MSparse<T> (a_nr, a_nc, (a.nnz() > b.nnz() ? a.nnz() : b.nnz())); \ |
|
|
371 \ |
|
5275
|
372 octave_idx_type jx = 0; \ |
|
5164
|
373 r.cidx (0) = 0; \ |
|
5275
|
374 for (octave_idx_type i = 0 ; i < a_nc ; i++) \ |
|
5164
|
375 { \ |
|
5275
|
376 octave_idx_type ja = a.cidx(i); \ |
|
|
377 octave_idx_type ja_max = a.cidx(i+1); \ |
|
5164
|
378 bool ja_lt_max= ja < ja_max; \ |
|
|
379 \ |
|
5275
|
380 octave_idx_type jb = b.cidx(i); \ |
|
|
381 octave_idx_type jb_max = b.cidx(i+1); \ |
|
5164
|
382 bool jb_lt_max = jb < jb_max; \ |
|
|
383 \ |
|
|
384 while (ja_lt_max || jb_lt_max ) \ |
|
|
385 { \ |
|
|
386 OCTAVE_QUIT; \ |
|
|
387 if ((! jb_lt_max) || \ |
|
|
388 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) \ |
|
|
389 { \ |
|
|
390 ja++; ja_lt_max= ja < ja_max; \ |
|
|
391 } \ |
|
|
392 else if (( !ja_lt_max ) || \ |
|
|
393 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) \ |
|
|
394 { \ |
|
|
395 jb++; jb_lt_max= jb < jb_max; \ |
|
|
396 } \ |
|
|
397 else \ |
|
|
398 { \ |
|
|
399 if ((a.data(ja) OP b.data(jb)) != 0.) \ |
|
|
400 { \ |
|
|
401 r.data(jx) = a.data(ja) OP b.data(jb); \ |
|
|
402 r.ridx(jx) = a.ridx(ja); \ |
|
|
403 jx++; \ |
|
|
404 } \ |
|
|
405 ja++; ja_lt_max= ja < ja_max; \ |
|
|
406 jb++; jb_lt_max= jb < jb_max; \ |
|
|
407 } \ |
|
|
408 } \ |
|
|
409 r.cidx(i+1) = jx; \ |
|
|
410 } \ |
|
|
411 \ |
|
|
412 r.maybe_compress (); \ |
|
|
413 } \ |
|
|
414 \ |
|
|
415 return r; \ |
|
|
416 } |
|
|
417 |
|
|
418 #define SPARSE_A2A2_FCN_2(FCN, OP) \ |
|
|
419 template <class T> \ |
|
|
420 MSparse<T> \ |
|
|
421 FCN (const MSparse<T>& a, const MSparse<T>& b) \ |
|
|
422 { \ |
|
|
423 MSparse<T> r; \ |
|
|
424 T Zero = T (); \ |
|
|
425 \ |
|
5275
|
426 octave_idx_type a_nr = a.rows (); \ |
|
|
427 octave_idx_type a_nc = a.cols (); \ |
|
5164
|
428 \ |
|
5275
|
429 octave_idx_type b_nr = b.rows (); \ |
|
|
430 octave_idx_type b_nc = b.cols (); \ |
|
5164
|
431 \ |
|
|
432 if (a_nr != b_nr || a_nc != b_nc) \ |
|
|
433 gripe_nonconformant (#FCN, a_nr, a_nc, b_nr, b_nc); \ |
|
|
434 else \ |
|
|
435 { \ |
|
|
436 r = MSparse<T>( a_nr, a_nc, (Zero OP Zero)); \ |
|
|
437 \ |
|
5275
|
438 for (octave_idx_type i = 0 ; i < a_nc ; i++) \ |
|
5164
|
439 { \ |
|
5275
|
440 octave_idx_type ja = a.cidx(i); \ |
|
|
441 octave_idx_type ja_max = a.cidx(i+1); \ |
|
5164
|
442 bool ja_lt_max= ja < ja_max; \ |
|
|
443 \ |
|
5275
|
444 octave_idx_type jb = b.cidx(i); \ |
|
|
445 octave_idx_type jb_max = b.cidx(i+1); \ |
|
5164
|
446 bool jb_lt_max = jb < jb_max; \ |
|
|
447 \ |
|
|
448 while (ja_lt_max || jb_lt_max ) \ |
|
|
449 { \ |
|
|
450 OCTAVE_QUIT; \ |
|
|
451 if ((! jb_lt_max) || \ |
|
|
452 (ja_lt_max && (a.ridx(ja) < b.ridx(jb)))) \ |
|
|
453 { \ |
|
|
454 r.elem (a.ridx(ja),i) = a.data(ja) OP Zero; \ |
|
|
455 ja++; ja_lt_max= ja < ja_max; \ |
|
|
456 } \ |
|
|
457 else if (( !ja_lt_max ) || \ |
|
|
458 (jb_lt_max && (b.ridx(jb) < a.ridx(ja)) ) ) \ |
|
|
459 { \ |
|
|
460 r.elem (b.ridx(jb),i) = Zero OP b.data(jb); \ |
|
|
461 jb++; jb_lt_max= jb < jb_max; \ |
|
|
462 } \ |
|
|
463 else \ |
|
|
464 { \ |
|
|
465 r.elem (a.ridx(ja),i) = a.data(ja) OP b.data(jb); \ |
|
|
466 ja++; ja_lt_max= ja < ja_max; \ |
|
|
467 jb++; jb_lt_max= jb < jb_max; \ |
|
|
468 } \ |
|
|
469 } \ |
|
|
470 } \ |
|
|
471 \ |
|
|
472 r.maybe_compress (true); \ |
|
|
473 } \ |
|
|
474 \ |
|
|
475 return r; \ |
|
|
476 } |
|
|
477 |
|
|
478 SPARSE_A2A2_OP (+) |
|
|
479 SPARSE_A2A2_OP (-) |
|
|
480 SPARSE_A2A2_FCN_1 (product, *) |
|
|
481 SPARSE_A2A2_FCN_2 (quotient, /) |
|
|
482 |
|
|
483 // Unary MSparse ops. |
|
|
484 |
|
|
485 template <class T> |
|
|
486 MSparse<T> |
|
|
487 operator + (const MSparse<T>& a) |
|
|
488 { |
|
|
489 return a; |
|
|
490 } |
|
|
491 |
|
|
492 template <class T> |
|
|
493 MSparse<T> |
|
|
494 operator - (const MSparse<T>& a) |
|
|
495 { |
|
|
496 MSparse<T> retval (a); |
|
5275
|
497 octave_idx_type nz = a.nnz (); |
|
|
498 for (octave_idx_type i = 0; i < nz; i++) |
|
5164
|
499 retval.data(i) = - retval.data(i); |
|
|
500 return retval; |
|
|
501 } |
|
|
502 |
|
|
503 /* |
|
|
504 ;;; Local Variables: *** |
|
|
505 ;;; mode: C++ *** |
|
|
506 ;;; End: *** |
|
|
507 */ |
