mirror of https://github.com/tstack/lnav.git
120 lines
3.3 KiB
C++
120 lines
3.3 KiB
C++
/**
|
|
* Copyright (c) 2019, Timothy Stack
|
|
*
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
* * Neither the name of Timothy Stack nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
|
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
|
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef lnav_string_util_hh
|
|
#define lnav_string_util_hh
|
|
|
|
#include <string.h>
|
|
#include <string>
|
|
|
|
void scrub_to_utf8(char *buffer, size_t length);
|
|
|
|
inline bool is_line_ending(char ch) {
|
|
return ch == '\r' || ch == '\n';
|
|
}
|
|
|
|
size_t unquote(char *dst, const char *str, size_t len);
|
|
|
|
inline bool startswith(const char *str, const char *prefix)
|
|
{
|
|
return strncmp(str, prefix, strlen(prefix)) == 0;
|
|
}
|
|
|
|
inline bool startswith(const std::string &str, const char *prefix)
|
|
{
|
|
return startswith(str.c_str(), prefix);
|
|
}
|
|
|
|
inline bool endswith(const char *str, const char *suffix)
|
|
{
|
|
size_t len = strlen(str), suffix_len = strlen(suffix);
|
|
|
|
if (suffix_len > len) {
|
|
return false;
|
|
}
|
|
|
|
return strcmp(&str[len - suffix_len], suffix) == 0;
|
|
}
|
|
|
|
template<int N>
|
|
inline bool endswith(const std::string& str, const char (&suffix) [N])
|
|
{
|
|
if (N > str.length()) {
|
|
return false;
|
|
}
|
|
|
|
return strcmp(&str[str.size() - N], suffix) == 0;
|
|
}
|
|
|
|
void truncate_to(std::string &str, size_t len);
|
|
|
|
inline std::string trim(const std::string &str)
|
|
{
|
|
std::string::size_type start, end;
|
|
|
|
for (start = 0; start < str.size() && isspace(str[start]); start++);
|
|
for (end = str.size(); end > 0 && isspace(str[end - 1]); end--);
|
|
|
|
return str.substr(start, end - start);
|
|
}
|
|
|
|
inline std::string tolower(const char *str)
|
|
{
|
|
std::string retval;
|
|
|
|
for (int lpc = 0; str[lpc]; lpc++) {
|
|
retval.push_back(::tolower(str[lpc]));
|
|
}
|
|
|
|
return retval;
|
|
}
|
|
|
|
inline std::string tolower(const std::string &str)
|
|
{
|
|
return tolower(str.c_str());
|
|
}
|
|
|
|
inline std::string toupper(const char *str)
|
|
{
|
|
std::string retval;
|
|
|
|
for (int lpc = 0; str[lpc]; lpc++) {
|
|
retval.push_back(::toupper(str[lpc]));
|
|
}
|
|
|
|
return retval;
|
|
}
|
|
|
|
inline std::string toupper(const std::string &str)
|
|
{
|
|
return toupper(str.c_str());
|
|
}
|
|
|
|
#endif
|