| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257 |
- /* ScummVM Tools
- *
- * ScummVM Tools is the legal property of its developers, whose
- * names are too numerous to list here. Please refer to the
- * COPYRIGHT file distributed with this source distribution.
- *
- * Additionally this file is based on the ScummVM source code.
- * Copyright information for the ScummVM source code is
- * available in the COPYRIGHT file of the ScummVM source
- * distribution.
- *
- * This program 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
- * of the License, or (at your option) any later version.
- *
- * This program 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 this program; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
- */
- #ifndef COMMON_STRING_H
- #define COMMON_STRING_H
- #include "common/scummsys.h"
- #include <string>
- namespace Common {
- /**
- * Simple string class for ScummVM. Provides automatic storage managment,
- * and overloads several operators in a 'natural' fashion, mimicking
- * the std::string class. Even provides simple iterators.
- *
- */
- class String {
- protected:
- /**
- * Pointer to the actual string storage. Either points to _storage,
- * or to a block allocated on the heap via malloc.
- */
- std::string _str;
- public:
- /** Construct a new empty string. */
- String() = default;
- /** Construct a new string from the given NULL-terminated C string. */
- String(const char *str);
- /** Construct a new string containing exactly len characters read from address str. */
- String(const char *str, uint32 len);
- /** Construct a new string containing the characters between beginP (including) and endP (excluding). */
- String(const char *beginP, const char *endP);
- /** Construct a copy of the given string. */
- String(const String &str);
- /** Construct a string consisting of the given character. */
- explicit String(char c);
- ~String();
- String &operator =(const char *str);
- String &operator =(const String &str);
- String &operator =(char c);
- String &operator +=(const char *str);
- String &operator +=(const String &str);
- String &operator +=(char c);
- bool operator ==(const String &x) const;
- bool operator ==(const char *x) const;
- bool operator !=(const String &x) const;
- bool operator !=(const char *x) const;
- bool operator <(const String &x) const;
- bool operator <=(const String &x) const;
- bool operator >(const String &x) const;
- bool operator >=(const String &x) const;
- bool equals(const String &x) const;
- bool equalsIgnoreCase(const String &x) const;
- int compareTo(const String &x) const; // strcmp clone
- int compareToIgnoreCase(const String &x) const; // stricmp clone
- bool equals(const char *x) const;
- bool equalsIgnoreCase(const char *x) const;
- int compareTo(const char *x) const; // strcmp clone
- int compareToIgnoreCase(const char *x) const; // stricmp clone
- bool hasSuffix(const String &x) const;
- bool hasSuffix(const char *x) const;
- bool hasPrefix(const String &x) const;
- bool hasPrefix(const char *x) const;
- bool contains(const String &x) const;
- bool contains(const char *x) const;
- bool contains(char x) const;
- /**
- * Simple DOS-style pattern matching function (understands * and ? like used in DOS).
- * Taken from exult/files/listfiles.cc
- *
- * Token meaning:
- * "*": any character, any amount of times.
- * "?": any character, only once.
- *
- * Example strings/patterns:
- * String: monkey.s01 Pattern: monkey.s?? => true
- * String: monkey.s101 Pattern: monkey.s?? => false
- * String: monkey.s99 Pattern: monkey.s?1 => false
- * String: monkey.s101 Pattern: monkey.s* => true
- * String: monkey.s99 Pattern: monkey.s*1 => false
- *
- * @param str Text to be matched against the given pattern.
- * @param pat Glob pattern.
- * @param ignoreCase Whether to ignore the case when doing pattern match
- * @param pathMode Whether to use path mode, i.e., whether slashes must be matched explicitly.
- *
- * @return true if str matches the pattern, false otherwise.
- */
- bool matchString(const char *pat, bool ignoreCase = false, bool pathMode = false) const;
- bool matchString(const String &pat, bool ignoreCase = false, bool pathMode = false) const;
- inline const char *c_str() const { return _str.c_str(); }
- inline uint size() const { return uint(_str.size()); }
- inline bool empty() const { return (_str.empty() == 0); }
- char lastChar() const { return (_str.size() > 0) ? _str[_str.size()-1] : 0; }
- char operator[](int idx) const {
- assert(idx >= 0 && idx < (int)_str.size());
- return _str[idx];
- }
- /** Set character c at position p, replacing the previous character there. */
- void setChar(char c, uint32 p);
- /** Insert character c before position p. */
- void insertChar(char c, uint32 p);
- /** Clears the string, making it empty. */
- void clear();
- /** Convert all characters in the string to lowercase. */
- void toLowercase();
- /** Convert all characters in the string to uppercase. */
- void toUppercase();
- public:
- typedef char * iterator;
- typedef const char * const_iterator;
- iterator begin() {
- return &_str[0];
- }
- iterator end() {
- return begin() + size();
- }
- const_iterator begin() const {
- return &_str[0];
- }
- const_iterator end() const {
- return begin() + size();
- }
- protected:
- void initWithCStr(const char *str, uint32 len);
- };
- // Append two strings to form a new (temp) string
- String operator +(const String &x, const String &y);
- String operator +(const char *x, const String &y);
- String operator +(const String &x, const char *y);
- String operator +(const String &x, char y);
- String operator +(char x, const String &y);
- // Some useful additional comparison operators for Strings
- bool operator == (const char *x, const String &y);
- bool operator != (const char *x, const String &y);
- // Utility functions to remove leading and trailing whitespaces
- extern char *ltrim(char *t);
- extern char *rtrim(char *t);
- extern char *trim(char *t);
- /**
- * Returns the last component of a given path.
- *
- * Examples:
- * /foo/bar.txt would return 'bar.txt'
- * /foo/bar/ would return 'bar'
- * /foo/./bar// would return 'bar'
- *
- * @param path the path of which we want to know the last component
- * @param sep character used to separate path components
- * @return The last component of the path.
- */
- Common::String lastPathComponent(const Common::String &path, const char sep);
- /**
- * Normalize a gien path to a canonical form. In particular:
- * - trailing separators are removed: /foo/bar/ -> /foo/bar
- * - double separators (= empty components) are removed: /foo//bar -> /foo/bar
- * - dot components are removed: /foo/./bar -> /foo/bar
- *
- * @todo remove double dot components: /foo/baz/../bar -> /foo/bar
- *
- * @param path the path to normalize
- * @param sep the separator token (usually '/' on Unix-style systems, or '\\' on Windows based stuff)
- * @return the normalized path
- */
- Common::String normalizePath(const Common::String &path, const char sep);
- /**
- * Simple DOS-style pattern matching function (understands * and ? like used in DOS).
- * Taken from exult/files/listfiles.cc
- *
- * Token meaning:
- * "*": any character, any amount of times.
- * "?": any character, only once.
- *
- * Example strings/patterns:
- * String: monkey.s01 Pattern: monkey.s?? => true
- * String: monkey.s101 Pattern: monkey.s?? => false
- * String: monkey.s99 Pattern: monkey.s?1 => false
- * String: monkey.s101 Pattern: monkey.s* => true
- * String: monkey.s99 Pattern: monkey.s*1 => false
- *
- * @param str Text to be matched against the given pattern.
- * @param pat Glob pattern.
- * @param ignoreCase Whether to ignore the case when doing pattern match
- * @param pathMode Whether to use path mode, i.e., whether slashes must be matched explicitly.
- *
- * @return true if str matches the pattern, false otherwise.
- */
- bool matchString(const char *str, const char *pat, bool ignoreCase = false, bool pathMode = false);
- } // End of namespace Common
- #endif
|