Mercurial > octave
view liboctave/util/str-vec.cc @ 21202:f7121e111991
maint: indent #ifdef blocks in liboctave and src directories.
* Array-C.cc, Array-b.cc, Array-ch.cc, Array-d.cc, Array-f.cc, Array-fC.cc,
Array-i.cc, Array-idx-vec.cc, Array-s.cc, Array-str.cc, Array-util.cc,
Array-voidp.cc, Array.cc, CColVector.cc, CDiagMatrix.cc, CMatrix.cc,
CNDArray.cc, CRowVector.cc, CSparse.cc, CSparse.h, DiagArray2.cc, MArray-C.cc,
MArray-d.cc, MArray-f.cc, MArray-fC.cc, MArray-i.cc, MArray-s.cc, MArray.cc,
MDiagArray2.cc, MSparse-C.cc, MSparse-d.cc, MSparse.h, MatrixType.cc,
PermMatrix.cc, Range.cc, Sparse-C.cc, Sparse-b.cc, Sparse-d.cc, Sparse.cc,
boolMatrix.cc, boolNDArray.cc, boolSparse.cc, chMatrix.cc, chNDArray.cc,
dColVector.cc, dDiagMatrix.cc, dMatrix.cc, dNDArray.cc, dRowVector.cc,
dSparse.cc, dSparse.h, dim-vector.cc, fCColVector.cc, fCDiagMatrix.cc,
fCMatrix.cc, fCNDArray.cc, fCRowVector.cc, fColVector.cc, fDiagMatrix.cc,
fMatrix.cc, fNDArray.cc, fRowVector.cc, idx-vector.cc, int16NDArray.cc,
int32NDArray.cc, int64NDArray.cc, int8NDArray.cc, intNDArray.cc,
uint16NDArray.cc, uint32NDArray.cc, uint64NDArray.cc, uint8NDArray.cc,
blaswrap.c, cquit.c, f77-extern.cc, f77-fcn.c, f77-fcn.h, lo-error.c, quit.cc,
quit.h, CmplxAEPBAL.cc, CmplxCHOL.cc, CmplxGEPBAL.cc, CmplxHESS.cc, CmplxLU.cc,
CmplxQR.cc, CmplxQRP.cc, CmplxSCHUR.cc, CmplxSVD.cc, CollocWt.cc, DASPK.cc,
DASRT.cc, DASSL.cc, EIG.cc, LSODE.cc, ODES.cc, Quad.cc, base-lu.cc, base-qr.cc,
dbleAEPBAL.cc, dbleCHOL.cc, dbleGEPBAL.cc, dbleHESS.cc, dbleLU.cc, dbleQR.cc,
dbleQRP.cc, dbleSCHUR.cc, dbleSVD.cc, eigs-base.cc, fCmplxAEPBAL.cc,
fCmplxCHOL.cc, fCmplxGEPBAL.cc, fCmplxHESS.cc, fCmplxLU.cc, fCmplxQR.cc,
fCmplxQRP.cc, fCmplxSCHUR.cc, fCmplxSVD.cc, fEIG.cc, floatAEPBAL.cc,
floatCHOL.cc, floatGEPBAL.cc, floatHESS.cc, floatLU.cc, floatQR.cc,
floatQRP.cc, floatSCHUR.cc, floatSVD.cc, lo-mappers.cc, lo-specfun.cc,
oct-convn.cc, oct-fftw.cc, oct-fftw.h, oct-norm.cc, oct-rand.cc,
oct-spparms.cc, randgamma.c, randmtzig.c, randpoisson.c, sparse-chol.cc,
sparse-dmsolve.cc, sparse-lu.cc, sparse-qr.cc, mx-defs.h, dir-ops.cc,
file-ops.cc, file-stat.cc, lo-sysdep.cc, mach-info.cc, oct-env.cc,
oct-group.cc, oct-openmp.h, oct-passwd.cc, oct-syscalls.cc, oct-time.cc,
oct-uname.cc, pathlen.h, sysdir.h, syswait.h, cmd-edit.cc, cmd-hist.cc,
data-conv.cc, f2c-main.c, glob-match.cc, lo-array-errwarn.cc,
lo-array-gripes.cc, lo-cutils.c, lo-cutils.h, lo-ieee.cc, lo-math.h,
lo-regexp.cc, lo-utils.cc, oct-base64.cc, oct-glob.cc, oct-inttypes.cc,
oct-inttypes.h, oct-locbuf.cc, oct-mutex.cc, oct-refcount.h, oct-rl-edit.c,
oct-rl-hist.c, oct-shlib.cc, oct-sort.cc, pathsearch.cc, singleton-cleanup.cc,
sparse-sort.cc, sparse-util.cc, statdefs.h, str-vec.cc, unwind-prot.cc,
url-transfer.cc, display-available.h, main-cli.cc, main-gui.cc, main.in.cc,
mkoctfile.in.cc, octave-config.in.cc, shared-fcns.h:
indent #ifdef blocks in liboctave and src directories.
author | Rik <rik@octave.org> |
---|---|
date | Sat, 06 Feb 2016 06:40:13 -0800 |
parents | a9574e3c6e9e |
children | 40de9f8f23a6 |
line wrap: on
line source
/* Copyright (C) 1996-2015 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 3 of the License, 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, see <http://www.gnu.org/licenses/>. */ /* The function string_vector::list_in_columns was adapted from a similar function distributed in the GNU file utilities, copyright (C) 85, 88, 90, 91, 95, 1996 Free Software Foundation, Inc. */ #ifdef HAVE_CONFIG_H # include <config.h> #endif #include <iostream> #include <string> #include "cmd-edit.h" #include "lo-utils.h" #include "str-vec.h" // FIXME: isn't there some STL trick that could be used to make this // work for all STL containers of std::string objects? string_vector::string_vector (const std::list<std::string>& lst) : Array<std::string> () { size_t n = lst.size (); resize (n); octave_idx_type i = 0; for (std::list<std::string>::const_iterator p = lst.begin (); p != lst.end (); p++) elem (i++) = *p; } string_vector::string_vector (const std::set<std::string>& lst) : Array<std::string> () { size_t n = lst.size (); resize (n); octave_idx_type i = 0; for (std::set<std::string>::const_iterator p = lst.begin (); p != lst.end (); p++) elem (i++) = *p; } // Create a string vector from a NULL terminated list of C strings. string_vector::string_vector (const char * const *s) : Array<std::string> () { octave_idx_type n = 0; if (s) { const char * const *t = s; while (*t++) n++; } resize (n); for (octave_idx_type i = 0; i < n; i++) elem (i) = s[i]; } // Create a string vector from up to N C strings. Assumes that N is // nonnegative. string_vector::string_vector (const char * const *s, octave_idx_type n) : Array<std::string> (dim_vector (n, 1)) { for (octave_idx_type i = 0; i < n; i++) elem (i) = s[i]; } string_vector& string_vector::sort (bool make_uniq) { // Don't use Array<std::string>::sort () to allow sorting in place. octave_sort<std::string> lsort; lsort.sort (Array<std::string>::fortran_vec (), numel ()); if (make_uniq) uniq (); return *this; } string_vector& string_vector::uniq (void) { octave_idx_type len = numel (); if (len > 0) { octave_idx_type k = 0; for (octave_idx_type i = 1; i < len; i++) if (elem (i) != elem (k)) if (++k != i) elem (k) = elem (i); if (len != ++k) resize (k); } return *this; } string_vector& string_vector::append (const std::string& s) { octave_idx_type len = numel (); resize (len + 1); elem (len) = s; return *this; } string_vector& string_vector::append (const string_vector& sv) { octave_idx_type len = numel (); octave_idx_type sv_len = sv.numel (); octave_idx_type new_len = len + sv_len; resize (new_len); for (octave_idx_type i = 0; i < sv_len; i++) elem (len + i) = sv[i]; return *this; } std::string string_vector::join (const std::string& sep) const { std::string retval; octave_idx_type len = numel (); if (len > 0) { octave_idx_type i; for (i = 0; i < len - 1; i++) retval += elem (i) + sep; retval += elem (i); } return retval; } char ** string_vector::c_str_vec (void) const { octave_idx_type len = numel (); char **retval = new char * [len + 1]; retval[len] = 0; for (octave_idx_type i = 0; i < len; i++) retval[i] = strsave (elem (i).c_str ()); return retval; } void string_vector::delete_c_str_vec (const char * const *v) { const char * const *p = v; while (*p) delete [] *p++; delete [] v; } // Format a list in neat columns. std::ostream& string_vector::list_in_columns (std::ostream& os, int width, const std::string& prefix) const { // Compute the maximum name length. octave_idx_type max_name_length = 0; octave_idx_type total_names = numel (); if (total_names == 0) { // List empty, remember to end output with a newline. os << "\n"; return os; } for (octave_idx_type i = 0; i < total_names; i++) { octave_idx_type name_length = elem (i).length (); if (name_length > max_name_length) max_name_length = name_length; } // Allow at least two spaces between names. max_name_length += 2; // Calculate the maximum number of columns that will fit. octave_idx_type line_length = ((width <= 0 ? command_editor::terminal_cols () : width) - prefix.length ()); octave_idx_type nc = line_length / max_name_length; if (nc == 0) nc = 1; // Calculate the number of rows that will be in each column except // possibly for a short column on the right. octave_idx_type nr = total_names / nc + (total_names % nc != 0); octave_idx_type count; for (octave_idx_type row = 0; row < nr; row++) { count = row; octave_idx_type pos = 0; // Print the next row. os << prefix; while (1) { std::string nm = elem (count); os << nm; octave_idx_type name_length = nm.length (); count += nr; if (count >= total_names) break; octave_idx_type spaces_to_pad = max_name_length - name_length; for (octave_idx_type i = 0; i < spaces_to_pad; i++) os << " "; pos += max_name_length; } os << "\n"; } return os; }