/** * @file unc_text.cpp * A simple class that handles the chunk text. * * @author Ben Gardner * @license GPL v2+ */ #include "unc_text.h" #include "unc_ctype.h" #include "unicode.h" // encode_utf8() #include #include using namespace std; static constexpr const int_fast8_t UTF8_BLOCKS = 6; // 6 -> max utf8 blocks per char static size_t fix_len_idx(size_t size, size_t idx, size_t len); //! converts \n and \r chars are into NL and CR UTF8 symbols before encode_utf8 is called static void toLogTextUtf8(int c, unc_text::log_type &container); /** * calculates the size a 'log_type' container needs to have in order to take * in values of a 'unc_text::value_type' up to idx * (without \0, with symbols for the converted \n and \r chars) * * throws if char is greater than 0x7fffffff */ static int getLogTextUtf8Len(unc_text::value_type &c0, size_t end); static int getLogTextUtf8Len(unc_text::value_type &c0, size_t start, size_t end); static int getLogTextUtf8Len(unc_text::value_type &c0, size_t start, size_t end) { size_t c1_idx = 0; for (size_t i = start; i < end; ++i) { auto ch = c0[i]; if (ch == '\n') { ch = 0x2424; // NL symbol } else if (ch == '\r') { ch = 0x240d; // CR symbol } if (ch < 0x80) // 1-byte sequence { c1_idx += 1; } else if (ch < 0x0800) // 2-byte sequence { c1_idx += 2; } else if (ch < 0x10000) // 3-byte sequence { c1_idx += 3; } else if (ch < 0x200000) // 4-byte sequence { c1_idx += 4; } else if (ch < 0x4000000) // 5-byte sequence { c1_idx += 5; } else if (ch <= 0x7fffffff) // 6-byte sequence { c1_idx += 6; } else { throw out_of_range(string(__func__) + ":" + to_string(__LINE__) + " - ch value too big, can't convert to utf8"); } } return(c1_idx); } // getLogTextUTF8Len static int getLogTextUtf8Len(unc_text::value_type &c0, size_t end) { return(getLogTextUtf8Len(c0, 0, end)); } static void toLogTextUtf8(int c, unc_text::log_type &container) { if (c == '\n') { c = 0x2424; // NL symbol } else if (c == '\r') { c = 0x240d; // CR symbol } encode_utf8(c, container); } static size_t fix_len_idx(size_t size, size_t idx, size_t len) { if (idx >= size) { return(0); } const size_t left = size - idx; return((len > left) ? left : len); } unc_text::unc_text() { m_logtext = log_type{ '\0' }; } unc_text::unc_text(const unc_text &ref) { set(ref); } unc_text::unc_text(const unc_text &ref, size_t idx, size_t len) { set(ref, idx, len); } unc_text::unc_text(const char *ascii_text) { set(ascii_text); } unc_text::unc_text(const std::string &ascii_text) { set(ascii_text); } unc_text::unc_text(const value_type &data, size_t idx, size_t len) { set(data, idx, len); } size_t unc_text::size() const { return(m_chars.size()); } unc_text &unc_text::operator=(int ch) { set(ch); return(*this); } unc_text &unc_text::operator=(const unc_text &ref) { set(ref); return(*this); } unc_text &unc_text::operator=(const std::string &ascii_text) { set(ascii_text); return(*this); } unc_text &unc_text::operator=(const char *ascii_text) { set(ascii_text); return(*this); } unc_text &unc_text::operator+=(int ch) { append(ch); return(*this); } unc_text &unc_text::operator+=(const unc_text &ref) { append(ref); return(*this); } unc_text &unc_text::operator+=(const std::string &ascii_text) { append(ascii_text); return(*this); } unc_text &unc_text::operator+=(const char *ascii_text) { append(ascii_text); return(*this); } const unc_text::value_type &unc_text::get() const { return(m_chars); } int unc_text::operator[](size_t idx) const { return((idx < m_chars.size()) ? m_chars[idx] : 0); } const int &unc_text::at(size_t idx) const { return(m_chars.at(idx)); } const int &unc_text::back() const { return(m_chars.back()); } void unc_text::push_back(int ch) { append(ch); } void unc_text::pop_back() { if (size() == 0) { return; } m_chars.pop_back(); update_logtext(); } void unc_text::pop_front() { if (size() == 0) { return; } m_chars.pop_front(); update_logtext(); } void unc_text::update_logtext() { // make a pessimistic guess at the size m_logtext.clear(); m_logtext.reserve(m_chars.size() * 3); for (int m_char : m_chars) { toLogTextUtf8(m_char, m_logtext); } m_logtext.push_back(0); } int unc_text::compare(const unc_text &ref1, const unc_text &ref2, size_t len, bool tcare) { const size_t len1 = ref1.size(); const size_t len2 = ref2.size(); const auto max_idx = std::min({ len, len1, len2 }); size_t idx = 0; for ( ; idx < max_idx; idx++) { // exactly the same character ? if (ref1.m_chars[idx] == ref2.m_chars[idx]) { continue; } int diff; // Issue #2091 if (tcare) { diff = ref1.m_chars[idx] - ref2.m_chars[idx]; } else { diff = unc_tolower(ref1.m_chars[idx]) - unc_tolower(ref2.m_chars[idx]); } if (diff == 0) { /* * if we're comparing the same character but in different case * we want to favor lower case before upper case (e.g. a before A) * so the order is the reverse of ASCII order (we negate). */ return(-(ref1.m_chars[idx] - ref2.m_chars[idx])); } // return the case-insensitive diff to sort alphabetically return(diff); } if (idx == len) { return(0); } // underflow save: return(len1 - len2); return((len1 > len2) ? (len1 - len2) : -static_cast(len2 - len1)); } // unc_text::compare bool unc_text::equals(const unc_text &ref) const { const size_t len = size(); if (ref.size() != len) { return(false); } for (size_t idx = 0; idx < len; idx++) { if (m_chars[idx] != ref.m_chars[idx]) { return(false); } } return(true); } const char *unc_text::c_str() const { return(reinterpret_cast(&m_logtext[0])); } void unc_text::set(int ch) { m_logtext.clear(); toLogTextUtf8(ch, m_logtext); m_logtext.push_back('\0'); m_chars.clear(); m_chars.push_back(ch); } void unc_text::set(const unc_text &ref) { m_chars = ref.m_chars; m_logtext = ref.m_logtext; } void unc_text::set(const unc_text &ref, size_t idx, size_t len) { const auto ref_size = ref.size(); if (len == ref_size) { m_chars = ref.m_chars; update_logtext(); return; } m_chars.resize(len); len = fix_len_idx(ref_size, idx, len); for (size_t di = 0; len > 0; di++, idx++, len--) { m_chars[di] = ref.m_chars[idx]; } update_logtext(); } void unc_text::set(const string &ascii_text) { const size_t len = ascii_text.size(); m_chars.resize(len); for (size_t idx = 0; idx < len; idx++) { m_chars[idx] = ascii_text[idx]; } update_logtext(); } void unc_text::set(const char *ascii_text) { const size_t len = strlen(ascii_text); m_chars.resize(len); for (size_t idx = 0; idx < len; idx++) { m_chars[idx] = *ascii_text++; } update_logtext(); } void unc_text::set(const value_type &data, size_t idx, size_t len) { m_chars.resize(len); len = fix_len_idx(data.size(), idx, len); for (size_t di = 0; len > 0; di++, idx++, len--) { m_chars[di] = data[idx]; } update_logtext(); } void unc_text::resize(size_t new_size) { if (size() == new_size) { return; } const auto log_new_size = getLogTextUtf8Len(m_chars, new_size); m_logtext.resize(log_new_size + 1); // one extra for \0 m_logtext[log_new_size] = '\0'; m_chars.resize(new_size); } void unc_text::clear() { m_logtext.clear(); m_logtext.push_back('\0'); m_chars.clear(); } void unc_text::insert(size_t idx, int ch) { if (idx >= m_chars.size()) { throw out_of_range(string(__func__) + ":" + to_string(__LINE__) + " - idx >= m_chars.size()"); } log_type utf8converted; utf8converted.reserve(UTF8_BLOCKS); toLogTextUtf8(ch, utf8converted); const auto utf8_idx = getLogTextUtf8Len(m_chars, idx); m_logtext.pop_back(); // remove '\0' m_logtext.insert(std::next(std::begin(m_logtext), utf8_idx), std::begin(utf8converted), std::end(utf8converted)); m_logtext.push_back('\0'); m_chars.insert(std::next(std::begin(m_chars), idx), ch); } void unc_text::insert(size_t idx, const unc_text &ref) { if (ref.size() == 0) { return; } if (idx >= m_chars.size()) { throw out_of_range(string(__func__) + ":" + to_string(__LINE__) + " - idx >= m_chars.size()"); } const auto utf8_idx = getLogTextUtf8Len(m_chars, idx); // (A+B) remove \0 from both containers, add back a single at the end m_logtext.pop_back(); // A m_logtext.insert(std::next(std::begin(m_logtext), utf8_idx), std::begin(ref.m_logtext), std::prev(std::end(ref.m_logtext))); // B m_logtext.push_back('\0'); m_chars.insert(std::next(std::begin(m_chars), idx), std::begin(ref.m_chars), std::end(ref.m_chars)); } void unc_text::append(int ch) { m_logtext.pop_back(); if (ch < 0x80 && ch != '\n' && ch != '\r') { m_logtext.push_back(ch); } else { log_type utf8converted; utf8converted.reserve(UTF8_BLOCKS); toLogTextUtf8(ch, utf8converted); m_logtext.insert(std::end(m_logtext), std::begin(utf8converted), std::end(utf8converted)); } m_logtext.push_back('\0'); m_chars.push_back(ch); } void unc_text::append(const unc_text &ref) { if (ref.size() == 0) { return; } m_logtext.pop_back(); m_logtext.insert(std::end(m_logtext), std::begin(ref.m_logtext), std::end(ref.m_logtext)); m_chars.insert(m_chars.end(), ref.m_chars.begin(), ref.m_chars.end()); } void unc_text::append(const string &ascii_text) { unc_text tmp(ascii_text); append(tmp); } void unc_text::append(const char *ascii_text) { unc_text tmp(ascii_text); append(tmp); } void unc_text::append(const value_type &data, size_t idx, size_t len) { unc_text tmp(data, idx, len); append(tmp); } bool unc_text::startswith(const char *text, size_t idx) const { const auto orig_idx = idx; for ( ; idx < size() && *text; idx++, text++) { if (*text != m_chars[idx]) { return(false); } } return(idx != orig_idx && (*text == 0)); } bool unc_text::startswith(const unc_text &text, size_t idx) const { size_t si = 0; const auto orig_idx = idx; for ( ; idx < size() && si < text.size(); idx++, si++) { if (text.m_chars[si] != m_chars[idx]) { return(false); } } return(idx != orig_idx && (si == text.size())); } int unc_text::find(const char *search_txt, size_t start_idx) const { const size_t t_len = strlen(search_txt); // the length of 'text' we are looking for const size_t s_len = size(); // the length of the string we are looking in if ( s_len < t_len // search_txt longer than the string we are looking in || start_idx + t_len - 1 >= s_len) // starting position to high to find search_txt { return(-1); } const size_t end_idx = s_len - t_len; for (size_t idx = start_idx; idx <= end_idx; idx++) { bool match = true; for (size_t ii = 0; ii < t_len; ii++) { if (m_chars[idx + ii] != search_txt[ii]) { match = false; break; } } if (match) // 'text' found at position 'idx' { return(idx); } } return(-1); // 'text' not found } int unc_text::rfind(const char *search_txt, size_t start_idx) const { const size_t t_len = strlen(search_txt); // the length of 'text' we are looking for const size_t s_len = size(); // the length of the string we are looking in if ( s_len < t_len // search_txt longer than the string we are looking in || start_idx < t_len - 1) // starting position to low to find search_txt { return(-1); } const size_t end_idx = s_len - t_len; if (start_idx > end_idx) { start_idx = end_idx; } for (auto idx = static_cast(start_idx); idx >= 0; idx--) { bool match = true; for (size_t ii = 0; ii < t_len; ii++) { if (m_chars[idx + ii] != search_txt[ii]) { match = false; break; } } if (match) { return(idx); } } return(-1); } void unc_text::erase(size_t start_idx, size_t len) { if (len == 0) { return; } const size_t end_idx = start_idx + len - 1; if (end_idx >= m_chars.size()) { throw out_of_range(string(__func__) + ":" + to_string(__LINE__) + " - idx + len >= m_chars.size()"); } const auto pos_s = getLogTextUtf8Len(m_chars, start_idx); const auto pos_e = pos_s + getLogTextUtf8Len(m_chars, start_idx, end_idx); m_logtext.pop_back(); m_logtext.erase(std::next(std::begin(m_logtext), pos_s), std::next(std::begin(m_logtext), pos_e + 1)); m_logtext.push_back('\0'); m_chars.erase(std::next(std::begin(m_chars), start_idx), std::next(std::begin(m_chars), end_idx + 1)); } int unc_text::replace(const char *search_text, const unc_text &replace_text) { const size_t s_len = strlen(search_text); const size_t r_len = replace_text.size(); int rcnt = 0; int fidx = find(search_text); while (fidx >= 0) { rcnt++; erase(static_cast(fidx), s_len); (static_cast(fidx) >= m_chars.size()) ? append(replace_text) : insert(static_cast(fidx), replace_text); fidx = find(search_text, static_cast(fidx) + r_len); } return(rcnt); }