Mercurial > hg > octave-nkf
view liboctave/str-vec.cc @ 5356:06585668a971 ss-2-9-3
[project @ 2005-05-18 17:20:31 by jwe]
author | jwe |
---|---|
date | Wed, 18 May 2005 17:20:32 +0000 |
parents | 4c8a2e4e0717 |
children | 161ebd1f3410 |
line wrap: on
line source
/* Copyright (C) 1996, 1997 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, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ /* 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" // 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; 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> (n) { for (octave_idx_type i = 0; i < n; i++) elem (i) = s[i]; } int string_vector::compare (const void *a_arg, const void *b_arg) { const std::string *a = (const std::string *) a_arg; const std::string *b = (const std::string *) b_arg; return a->compare (*b); } string_vector& string_vector::uniq (void) { octave_idx_type len = length (); 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 = length (); resize (len + 1); elem(len) = s; return *this; } string_vector& string_vector::append (const string_vector& sv) { octave_idx_type len = length (); octave_idx_type sv_len = sv.length (); 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; } char ** string_vector::c_str_vec (void) const { octave_idx_type len = length (); 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) const { // Compute the maximum name length. octave_idx_type max_name_length = 0; octave_idx_type total_names = length (); 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 = command_editor::terminal_cols (); 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); // Recalculate columns based on rows. nc = total_names / nr + (total_names % nr != 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. 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; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; End: *** */