Mercurial > octave-dspies
view liboctave/util/str-vec.h @ 19010:3fb030666878 draft default tip dspies
Added special-case logical-indexing function
* logical-index.h (New file) : Logical-indexing function. May be called on
octave_value types via call_bool_index
* nz-iterators.h : Add base-class nz_iterator for iterator types. Array has
template bool for whether to internally store row-col or compute on the fly
Add skip_ahead method which skips forward to the next nonzero after its
argument
Add flat_index for computing octave_idx_type index of current position (with
assertion failure in the case of overflow)
Move is_zero to separate file
* ov-base-diag.cc, ov-base-mat.cc, ov-base-sparse.cc, ov-perm.cc
(do_index_op): Add call to call_bool_index in logical-index.h
* Array.h : Move forward-declaration for array_iterator to separate header file
* dim-vector.cc (dim_max): Refers to idx-bounds.h (max_idx)
* array-iter-decl.h (New file): Header file for forward declaration of
array-iterator
* direction.h : Add constants fdirc and bdirc to avoid having to reconstruct
them
* dv-utils.h, dv-utils.cc (New files) :
Utility functions for querying and constructing dim-vectors
* idx-bounds.h (New file) :
Utility constants and functions for determining whether things will overflow
the maximum allowed bounds
* interp-idx.h (New function : to_flat_idx) : Converts row-col pair to linear
index of octave_idx_type
* is-zero.h (New file) : Function for determining whether an element is zero
* logical-index.tst : Add tests for correct return-value dimensions and large
sparse matrix behavior
author | David Spies <dnspies@gmail.com> |
---|---|
date | Fri, 25 Jul 2014 13:39:31 -0600 |
parents | 49a5a4be04a1 |
children |
line wrap: on
line source
/* Copyright (C) 1996-2013 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/>. */ #if !defined (octave_str_vec_h) #define octave_str_vec_h 1 #include <iosfwd> #include <list> #include <set> #include <string> #include "Array.h" class OCTAVE_API string_vector : public Array<std::string> { public: string_vector (void) : Array<std::string> () { } explicit string_vector (octave_idx_type n) : Array<std::string> (dim_vector (n, 1)) { } string_vector (const char *s) : Array<std::string> (dim_vector (1, 1), s) { } string_vector (const std::string& s) : Array<std::string> (dim_vector (1, 1), s) { } string_vector (const string_vector& s) : Array<std::string> (s) { } string_vector (const std::list<std::string>& lst); string_vector (const std::set<std::string>& lst); string_vector (const Array<std::string>& s) : Array<std::string> (s.as_column ()) { } string_vector (const char * const *s); string_vector (const char * const *s, octave_idx_type n); string_vector& operator = (const string_vector& s) { if (this != &s) Array<std::string>::operator = (s); return *this; } ~string_vector (void) { } bool empty (void) const { return length () == 0; } octave_idx_type max_length (void) const { octave_idx_type n = length (); octave_idx_type longest = 0; for (octave_idx_type i = 0; i < n; i++) { octave_idx_type tmp = elem (i).length (); if (tmp > longest) longest = tmp; } return longest; } void resize (octave_idx_type n, const std::string& rfv = std::string ()) { Array<std::string>::resize (dim_vector (n, 1), rfv); } std::string& operator[] (octave_idx_type i) { return Array<std::string>::elem (i); } std::string operator[] (octave_idx_type i) const { return Array<std::string>::elem (i); } string_vector& sort (bool make_uniq = false); string_vector& uniq (void); string_vector& append (const std::string& s); string_vector& append (const string_vector& sv); std::string join (const std::string& sep = std::string ()) const; char **c_str_vec (void) const; static void delete_c_str_vec (const char * const*); std::ostream& list_in_columns (std::ostream&, int width = 0, const std::string& prefix = std::string ()) const; }; #endif