/usr/include/octave-3.8.1/octave/caseless-str.h is in liboctave-dev 3.8.1-1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 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 | /*
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), 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
|