| 12
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
 100
 101
 102
 103
 104
 105
 106
 107
 108
 109
 110
 111
 112
 113
 114
 
 | /*
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.
*/
#if !defined (octave_str_vec_h)
#define octave_str_vec_h 1
#include <iostream>
#include <string>
#include "Array.h"
class
string_vector : public Array<std::string>
{
public:
  string_vector (void) : Array<std::string> () { }
  explicit string_vector (int n) : Array<std::string> (n) { }
  string_vector (const char *s) : Array<std::string> (1, s) { }
  string_vector (const std::string& s) : Array<std::string> (1, s) { }
  string_vector (const string_vector& s) : Array<std::string> (s) { }
  string_vector (const char * const *s);
  string_vector (const char * const *s, int n);
  string_vector& operator = (const string_vector& s)
  {
    if (this != &s)
      Array<std::string>::operator = (s);
    return *this;
  }
  ~string_vector (void) { }
  int empty (void) const { return length () == 0; }
  int max_length (void) const
  {
    int n = length ();
    int longest = 0;
    for (int i = 0; i < n; i++)
      {
	int tmp = elem(i).length ();
	if (tmp > longest)
	  longest = tmp;
      }
    return longest;
  }
  std::string& operator[] (int i) { return Array<std::string>::elem (i); }
  std::string operator[] (int i) const { return Array<std::string>::elem (i); }
  static int compare (const void *a_arg, const void *b_arg);
  string_vector& qsort (bool make_uniq = false)
  {
    Array<std::string>::qsort (compare);
    if (make_uniq)
      uniq ();
    return *this;
  }
  string_vector& uniq (void);
  string_vector& append (const std::string& s);
  string_vector& append (const string_vector& sv);
  char **c_str_vec (void) const;
  static void delete_c_str_vec (const char * const*);
  std::ostream& list_in_columns (std::ostream&) const;
};
#endif
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
 |