Mercurial > octave-dspies
view liboctave/util/caseless-str.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 | 6113e0c6920b |
children |
line wrap: on
line source
/* Copyright (C) 2007-2013 Shai Ayal 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_caseless_str_h) #define octave_caseless_str_h 1 #include <cctype> #include <string> class caseless_str : public std::string { public: typedef std::string::iterator iterator; typedef std::string::const_iterator const_iterator; caseless_str (void) : std::string () { } caseless_str (const std::string& s) : std::string (s) { } caseless_str (const char *s) : std::string (s) { } caseless_str (const caseless_str& name) : std::string (name) { } caseless_str& operator = (const caseless_str& pname) { std::string::operator = (pname); return *this; } operator std::string (void) const { return *this; } bool operator < (const std::string& s) const { const_iterator p1 = begin (); const_iterator p2 = s.begin (); while (p1 != end () && p2 != s.end ()) { char lp1 = std::tolower (*p1); char lp2 = std::tolower (*p2); if (lp1 > lp2) return false; if (lp1 < lp2) return true; p1++; p2++; } if (length () >= s.length ()) return false; else return true; } // Case-insensitive comparison. bool compare (const std::string& s, size_t limit = std::string::npos) const { const_iterator p1 = begin (); const_iterator p2 = s.begin (); size_t k = 0; while (p1 != end () && p2 != s.end () && k++ < limit) { if (std::tolower (*p1) != std::tolower (*p2)) return false; p1++; p2++; } return (limit == std::string::npos) ? size () == s.size () : k == limit; } }; #endif