comparison liboctave/array/Array-b.cc @ 18084:8e056300994b

Follow coding convention of defining and initializing only 1 variable per line in liboctave. * liboctave/array/Array-b.cc, liboctave/array/Array-util.cc, liboctave/array/Array.cc, liboctave/array/CDiagMatrix.cc, liboctave/array/CMatrix.cc, liboctave/array/CSparse.cc, liboctave/array/MDiagArray2.cc, liboctave/array/MatrixType.cc, liboctave/array/PermMatrix.cc, liboctave/array/Sparse.cc, liboctave/array/Sparse.h, liboctave/array/boolSparse.cc, liboctave/array/dDiagMatrix.cc, liboctave/array/dMatrix.cc, liboctave/array/dSparse.cc, liboctave/array/dim-vector.cc, liboctave/array/fCDiagMatrix.cc, liboctave/array/fCMatrix.cc, liboctave/array/fDiagMatrix.cc, liboctave/array/fMatrix.cc, liboctave/array/idx-vector.cc, liboctave/array/idx-vector.h, liboctave/numeric/CmplxLU.cc, liboctave/numeric/CmplxQR.cc, liboctave/numeric/base-qr.cc, liboctave/numeric/bsxfun-defs.cc, liboctave/numeric/bsxfun.h, liboctave/numeric/dbleLU.cc, liboctave/numeric/dbleQR.cc, liboctave/numeric/fCmplxLU.cc, liboctave/numeric/fCmplxQR.cc, liboctave/numeric/floatLU.cc, liboctave/numeric/floatQR.cc, liboctave/numeric/lo-specfun.cc, liboctave/numeric/oct-convn.cc, liboctave/numeric/oct-norm.cc, liboctave/numeric/sparse-dmsolve.cc, liboctave/operators/mx-inlines.cc, liboctave/operators/mx-op-defs.h, liboctave/util/caseless-str.h, liboctave/util/kpse.cc, liboctave/util/lo-utils.cc, liboctave/util/oct-binmap.h, liboctave/util/oct-cmplx.h, liboctave/util/oct-inttypes.cc, liboctave/util/oct-inttypes.h, liboctave/util/oct-sort.cc: Follow coding convention of defining and initializing only 1 variable per line in liboctave.
author Rik <rik@octave.org>
date Wed, 04 Dec 2013 22:13:18 -0800
parents 49a5a4be04a1
children fb09907f4e49
comparison
equal deleted inserted replaced
18083:938f01339043 18084:8e056300994b
50 octave_idx_type nel) 50 octave_idx_type nel)
51 { 51 {
52 // FIXME: This is essentially a simple bucket sort. 52 // FIXME: This is essentially a simple bucket sort.
53 // Can it be efficiently done by std::partition? 53 // Can it be efficiently done by std::partition?
54 OCTAVE_LOCAL_BUFFER (octave_idx_type, jdx, nel); 54 OCTAVE_LOCAL_BUFFER (octave_idx_type, jdx, nel);
55 octave_idx_type k = 0, l = 0; 55 octave_idx_type k = 0;
56 octave_idx_type l = 0;
56 for (octave_idx_type i = 0; i < nel; i++) 57 for (octave_idx_type i = 0; i < nel; i++)
57 { 58 {
58 if (data[i] == desc) 59 if (data[i] == desc)
59 { 60 {
60 data[k] = desc; 61 data[k] = desc;