Mercurial > octave-nkf
comparison liboctave/dim-vector.h @ 15020:560317fd5977
maint: Cuddle open bracket used for indexing C++ arrays in source code.
* Array-util.cc, Array.cc, DASPK.cc, DASRT.cc, DASSL.cc, LSODE.cc,
MatrixType.cc, Sparse.cc, Sparse.h, dim-vector.h, eigs-base.cc, idx-vector.cc,
oct-alloc.cc, oct-locbuf.cc, oct-locbuf.h, oct-mem.h, oct-sort.cc, oct-time.cc,
sparse-base-chol.cc, sparse-dmsolve.cc, ccolamd.cc, colamd.cc, spparms.cc,
symbfact.cc, symrcm.cc, help.cc, ls-mat5.cc, pt-idx.cc, utils.cc, variables.cc,
zfstream.cc: Cuddle open bracket used for indexing C++ arrays in source code.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 26 Jul 2012 09:25:47 -0700 |
parents | 4c9fd3e31436 |
children |
comparison
equal
deleted
inserted
replaced
15019:ae3670d4df29 | 15020:560317fd5977 |
---|---|
64 | 64 |
65 // Construct a new rep with count = 1 and ndims given. | 65 // Construct a new rep with count = 1 and ndims given. |
66 | 66 |
67 static octave_idx_type *newrep (int ndims) | 67 static octave_idx_type *newrep (int ndims) |
68 { | 68 { |
69 octave_idx_type *r = new octave_idx_type[ndims + 2]; | 69 octave_idx_type *r = new octave_idx_type [ndims + 2]; |
70 | 70 |
71 *r++ = 1; | 71 *r++ = 1; |
72 *r++ = ndims; | 72 *r++ = ndims; |
73 | 73 |
74 return r; | 74 return r; |
78 | 78 |
79 octave_idx_type *clonerep (void) | 79 octave_idx_type *clonerep (void) |
80 { | 80 { |
81 int l = ndims (); | 81 int l = ndims (); |
82 | 82 |
83 octave_idx_type *r = new octave_idx_type[l + 2]; | 83 octave_idx_type *r = new octave_idx_type [l + 2]; |
84 | 84 |
85 *r++ = 1; | 85 *r++ = 1; |
86 *r++ = l; | 86 *r++ = l; |
87 | 87 |
88 for (int i = 0; i < l; i++) | 88 for (int i = 0; i < l; i++) |
98 int l = ndims (); | 98 int l = ndims (); |
99 | 99 |
100 if (n < 2) | 100 if (n < 2) |
101 n = 2; | 101 n = 2; |
102 | 102 |
103 octave_idx_type *r = new octave_idx_type[n + 2]; | 103 octave_idx_type *r = new octave_idx_type [n + 2]; |
104 | 104 |
105 *r++ = 1; | 105 *r++ = 1; |
106 *r++ = n; | 106 *r++ = n; |
107 | 107 |
108 if (l > n) | 108 if (l > n) |