/* * The ManaPlus Client * Copyright (C) 2007-2009 The Mana World Development Team * Copyright (C) 2009-2010 The Mana Developers * Copyright (C) 2011-2020 The ManaPlus Developers * Copyright (C) 2020-2023 The ManaVerse Developers * * This file is part of The ManaPlus Client. * * 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 * 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, see . */ #include "utils/stringutils.h" #include "const/utils/utf8.h" #ifdef DYECMD #include "utils/cast.h" #else // DYECMD #include "resources/iteminfo.h" #include "resources/db/itemdb.h" #endif // DYECMD #include "utils/gettext.h" #include "utils/foreach.h" #include #include #ifdef WIN32 #include #endif // WIN32 #include "debug.h" std::string &trim(std::string &str) { size_t pos = str.find_last_not_of(' '); if (pos != std::string::npos) { str.erase(pos + 1); pos = str.find_first_not_of(' '); if (pos != std::string::npos) str.erase(0, pos); } else { // There is nothing else but whitespace in the string str.clear(); } return str; } std::string &toLower(std::string &str) { std::transform(str.begin(), str.end(), str.begin(), &tolower); return str; } std::string &toUpper(std::string &str) { std::transform(str.begin(), str.end(), str.begin(), &toupper); return str; } unsigned int atox(const std::string &str) { unsigned int value = 0; if (sscanf(str.c_str(), "0x%06x", &value) != 0) return value; return 0; } const char *ipToString(const uint32_t address) { static char asciiIP[18]; snprintf(asciiIP, sizeof(asciiIP), "%i.%i.%i.%i", CAST_U8(address), CAST_U8(address >> 8), CAST_U8(address >> 16), CAST_U8(address >> 24)); asciiIP[17] = 0; return asciiIP; } std::string strprintf(const char *const format, ...) { char buf[257]; va_list args; va_start(args, format); size_t nb = vsnprintf(buf, 256, format, args); buf[256] = 0; va_end(args); if (nb < 256) return buf; // The static size was not big enough, try again with a dynamic allocation. ++nb; char *buf2 = new char[nb]; va_start(args, format); vsnprintf(buf2, nb, format, args); va_end(args); std::string res(buf2); delete [] buf2; return res; } std::string removeColors(std::string msg) { for (unsigned int f = 0; f < msg.length() - 2 && msg.length() > 2; f++) { while (msg.length() > f + 2 && msg.at(f) == '#' && msg.at(f + 1) == '#') { msg = msg.erase(f, 3); } } return msg; } int compareStrI(const std::string &a, const std::string &b) { std::string::const_iterator itA = a.begin(); const std::string::const_iterator endA = a.end(); std::string::const_iterator itB = b.begin(); const std::string::const_iterator endB = b.end(); for (; itA < endA && itB < endB; ++itA, ++itB) { const int comp = tolower(*itA) - tolower(*itB); if (comp != 0) return comp; } // Check string lengths if (itA == endA && itB == endB) return 0; else if (itA == endA) return -1; else return 1; } const std::string findSameSubstring(const std::string &restrict str1, const std::string &restrict str2) { const int minLength = str1.length() > str2.length() ? CAST_S32(str2.length()) : CAST_S32(str1.length()); for (int f = 0; f < minLength; f ++) { if (str1.at(f) != str2.at(f)) return str1.substr(0, f); } return str1.substr(0, minLength); } const std::string findSameSubstringI(const std::string &restrict s1, const std::string &restrict s2) { std::string str1 = s1; std::string str2 = s2; toLower(str1); toLower(str2); const size_t minLength = str1.length() > str2.length() ? str2.length() : str1.length(); for (size_t f = 0; f < minLength; f ++) { if (str1.at(f) != str2.at(f)) return s1.substr(0, f); } return s1.substr(0, minLength); } size_t findI(std::string str, std::string subStr) { str = toLower(str); subStr = toLower(subStr); return str.find(subStr); } size_t findI(std::string text, const StringVect &list) { toLower(text); FOR_EACH (StringVectCIter, i, list) { std::string subStr = *i; subStr = toLower(subStr); const size_t idx = text.find(subStr); if (idx != std::string::npos) return idx; } return std::string::npos; } size_t findAny(const std::string &restrict text, const std::string &restrict chars, const size_t pos) { size_t idx = std::string::npos; const size_t sz = chars.size(); for (size_t f = 0; f < sz; f ++) { const size_t idx2 = text.find(chars[f], pos); if (idx2 != std::string::npos && idx2 < idx) idx = idx2; } return idx; } namespace { unsigned int base = 94; unsigned int start = 33; } // namespace const std::string encodeStr(unsigned int value, const unsigned int size) { std::string buf; do { buf += CAST_S8(value % base + start); value /= base; } while (value != 0U); while (buf.length() < size) buf += CAST_S8(start); return buf; } unsigned int decodeStr(const std::string &str) { if (str.empty()) return 0; int res = str[0] - start; int mult = 1; for (size_t f = 1; f < str.length(); f ++) { mult *= base; res = res + (str[f] - start) * mult; } return res; } std::string extractNameFromSprite(std::string str) { const size_t pos1 = str.rfind('.'); if (pos1 != std::string::npos) { size_t pos2 = str.rfind('/'); const size_t pos3 = str.rfind('\\'); if (pos3 != std::string::npos) { if (pos2 == std::string::npos || pos3 > pos2) pos2 = pos3; } if (pos2 == std::string::npos) pos2 = CAST_SIZE(-1); const int size = CAST_S32(pos1) - CAST_S32(pos2) - 1; if (size > 0) str = str.substr(pos2 + 1, size); } return str; } std::string removeSpriteIndex(std::string str) { const size_t pos1 = str.rfind('['); if (pos1 != std::string::npos) { size_t pos2 = str.rfind('/'); const size_t pos3 = str.rfind('\\'); if (pos3 != std::string::npos) { if (pos2 == std::string::npos || pos3 > pos2) pos2 = pos3; } if (pos2 == std::string::npos) pos2 = CAST_SIZE(-1); const int size = CAST_S32(pos1) - CAST_S32(pos2) - 1; if (size > 0) str = str.substr(pos2 + 1, size); } return str; } const char* getSafeUtf8String(const std::string &text) { const size_t sz = text.size(); const size_t size = sz + UTF8_MAX_SIZE; char *const buf = new char[size]; memcpy(buf, text.c_str(), sz); memset(buf + sz, 0, UTF8_MAX_SIZE); return buf; } void getSafeUtf8String(std::string text, char *const buf) { if (buf == nullptr) return; const size_t sz = text.size(); const size_t size = sz + UTF8_MAX_SIZE; if (size > 65500) { text = text.substr(0, 65500); const size_t sz1 = text.size(); memcpy(buf, text.c_str(), sz1); memset(buf + sz1, 0, UTF8_MAX_SIZE); } else { memcpy(buf, text.c_str(), sz); memset(buf + sz, 0, UTF8_MAX_SIZE); } } std::string getFileName(const std::string &path) { size_t pos1 = path.rfind('/'); const size_t pos2 = path.rfind('\\'); if (pos1 == std::string::npos || (pos2 != std::string::npos && pos2 > pos1)) { pos1 = pos2; } if (pos1 == std::string::npos) return path; return path.substr(pos1 + 1); } std::string getFileDir(const std::string &path) { size_t pos1 = path.rfind('/'); const size_t pos2 = path.rfind('\\'); if (pos1 == std::string::npos || (pos2 != std::string::npos && pos2 > pos1)) { pos1 = pos2; } if (pos1 == std::string::npos) return path; return path.substr(0, pos1); } std::string& replaceAll(std::string& context, const std::string &restrict from, const std::string &restrict to) { if (from.empty()) return context; size_t lookHere = 0; size_t foundHere; const size_t fromSize = from.size(); const size_t toSize = to.size(); while ((foundHere = context.find(from, lookHere)) != std::string::npos) { context.replace(foundHere, fromSize, to); lookHere = foundHere + toSize; } return context; } void replaceRecursiveAll(std::string& context, const std::string &restrict from, const char to) { size_t lookHere = 0; size_t foundHere; const size_t fromSize = from.size(); while ((foundHere = context.find(from, lookHere)) != std::string::npos) { context.replace(foundHere, fromSize, 1, to); lookHere = foundHere; } } bool getBoolFromString(const std::string &text) { std::string txt = text; toLower(trim(txt)); if (txt == "true" || txt == "yes" || txt == "on" || txt == "1") return true; else if (txt == "false" || txt == "no" || txt == "off" || txt == "0") return false; else return static_cast(atoi(txt.c_str())); } void replaceSpecialChars(std::string &text) { size_t pos1 = text.find('&'); while (pos1 != std::string::npos) { const size_t idx = pos1 + 1; const size_t sz = text.size(); if (idx >= sz) break; size_t f; for (f = idx; f < sz; f ++) { if (text[f] < '0' || text[f] > '9') break; } if (idx + 1 < f && text[f] == ';') { std::string str(" "); str[0] = CAST_S8(atoi(text.substr( idx, f - idx).c_str())); text = text.substr(0, pos1).append(str).append(text.substr(f + 1)); pos1 += 1; } else { pos1 = f + 1; } pos1 = text.find('&', pos1); } } std::string normalize(const std::string &name) { std::string normalized = name; return toLower(trim(normalized)); } void splitToIntSet(std::set &tokens, const std::string &text, const char separator) { std::stringstream ss(text); std::string item; while (std::getline(ss, item, separator)) tokens.insert(atoi(item.c_str())); } std::list splitToIntList(const std::string &text, const char separator) { std::list tokens; std::stringstream ss(text); std::string item; while (std::getline(ss, item, separator)) tokens.push_back(atoi(item.c_str())); return tokens; } std::list splitToStringList(const std::string &text, const char separator) { std::list tokens; std::stringstream ss(text); std::string item; while (std::getline(ss, item, separator)) tokens.push_back(item); return tokens; } void splitToStringVector(StringVect &tokens, const std::string &text, const char separator) { std::stringstream ss(text); std::string item; while (std::getline(ss, item, separator)) { item = trim(item); if (!item.empty()) tokens.push_back(item); } } void splitToStringSet(std::set &tokens, const std::string &text, const char separator) { std::stringstream ss(text); std::string item; while (std::getline(ss, item, separator)) { item = trim(item); if (!item.empty()) tokens.insert(item); } } void splitToIntVector(STD_VECTOR &tokens, const std::string &text, const char separator) { std::stringstream ss(text); std::string item; while (std::getline(ss, item, separator)) { item = trim(item); if (!item.empty()) tokens.push_back(atoi(item.c_str())); } } std::string combineDye(std::string file, const std::string &dye) { if (dye.empty()) return file; const size_t pos = file.find_last_of('|'); if (pos != std::string::npos) return file.substr(0, pos).append("|").append(dye); return file.append("|").append(dye); } std::string combineDye2(std::string file, const std::string &dye) { if (dye.empty()) return file; const size_t pos = file.find_last_of('|'); if (pos != std::string::npos) { const std::string dye1 = file.substr(pos + 1); std::string str; file = file.substr(0, pos); const std::list list1 = splitToStringList(dye1, ';'); const std::list list2 = splitToStringList(dye, ';'); for (std::list::const_iterator it1 = list1.begin(), it2 = list2.begin(), it1_end = list1.end(), it2_end = list2.end(); it1 != it1_end && it2 != it2_end; ++it1, ++it2) { str.append(*it1).append(":").append(*it2).append(";"); } return file.append("|").append(str); } return file; } std::string combineDye3(std::string file, const std::string &dye) { if (dye.empty()) return file; const size_t pos = file.find_last_of('|'); if (pos != std::string::npos) { const std::string dye1 = file.substr(pos + 1); std::string str; file = file.substr(0, pos); const std::list list1 = splitToStringList(dye1, ';'); const std::list list2 = splitToStringList(dye, ';'); for (std::list::const_iterator it1 = list1.begin(), it2 = list2.begin(), it1_end = list1.end(), it2_end = list2.end(); it1 != it1_end && it2 != it2_end; ++it1, ++it2) { str.append(*it1).append(":").append(*it2).append(";"); } return file.append("|").append(str); } if (file.empty()) return file; return file.append("|").append(dye); } std::string packList(const std::list &list) { std::list::const_iterator i = list.begin(); std::string str; while (i != list.end()) { str.append(*i).append("|"); ++ i; } const size_t sz = str.size(); if (sz > 1) str = str.substr(0, sz - 1); return str; } std::list unpackList(const std::string &str) { return splitToStringList(str, '|'); } std::string stringToHexPath(const std::string &str) { if (str.empty()) return ""; std::string hex = strprintf("%%%2x/", CAST_U32(str[0])); for (unsigned f = 1, fsz = CAST_U32(str.size()); f < fsz; f ++) { hex.append(strprintf("%%%2x", CAST_U32(str[f]))); } return hex; } void deleteCharLeft(std::string &str, unsigned *const pos) { if (pos == nullptr) return; while (*pos > 0) { (*pos)--; const int v = str[*pos]; str.erase(*pos, 1); if ((v & 192) != 128) break; } } bool findLast(const std::string &restrict str1, const std::string &restrict str2) { const size_t s1 = str1.size(); const size_t s2 = str2.size(); if (s1 < s2) return false; if (str1.substr(s1 - s2) == str2) return true; return false; } bool findFirst(const std::string &restrict str1, const std::string &restrict str2) { const size_t s1 = str1.size(); const size_t s2 = str2.size(); if (s1 < s2) return false; if (str1.substr(0, s2) == str2) return true; return false; } bool findCutLast(std::string &restrict str1, const std::string &restrict str2) { const size_t s1 = str1.size(); const size_t s2 = str2.size(); if (s1 < s2) return false; if (str1.substr(s1 - s2) == str2) { str1 = str1.substr(0, s1 - s2); return true; } return false; } void cutLast(std::string &restrict str1, const std::string &restrict str2) { const size_t s1 = str1.size(); const size_t s2 = str2.size(); if (s1 < s2) return; if (str1.substr(s1 - s2) == str2) str1 = str1.substr(0, s1 - s2); } bool findCutFirst(std::string &restrict str1, const std::string &restrict str2) { const size_t s1 = str1.size(); const size_t s2 = str2.size(); if (s1 < s2) return false; if (str1.substr(0, s2) == str2) { str1 = str1.substr(s2); return true; } return false; } void cutFirst(std::string &restrict str1, const std::string &restrict str2) { const size_t s1 = str1.size(); const size_t s2 = str2.size(); if (s1 < s2) return; if (str1.substr(0, s2) == str2) str1 = str1.substr(s2); } std::string &removeProtocol(std::string &url) { const size_t i = url.find("://"); if (i != std::string::npos) url = url.substr(i + 3); return url; } bool strStartWith(const std::string &restrict str1, const std::string &restrict str2) { const size_t sz2 = str2.size(); if (str1.size() < sz2) return false; return str1.substr(0, sz2) == str2; } std::string getDateString() { char buffer[80]; time_t rawtime; time(&rawtime); const tm *const timeinfo = localtime(&rawtime); strftime(buffer, 79, "%Y-%m-%d", timeinfo); return std::string(buffer); } std::string getDateTimeString() { char buffer[80]; time_t rawtime; time(&rawtime); const tm *const timeinfo = localtime(&rawtime); strftime(buffer, 79, "%Y-%m-%d %H:%M:%S", timeinfo); return std::string(buffer); } signed char parseBoolean(const std::string &value) { std::string txt = value; toLower(trim(txt)); if (txt == "true" || txt == "yes" || txt == "on" || txt == "1") return 1; else if (txt == "false" || txt == "no" || txt == "off" || txt == "0") return 0; else return -1; } std::string encodeLinkText(std::string data) { return replaceAll(data, "|", "\342\235\230"); } std::string decodeLinkText(std::string data) { return replaceAll(data, "\342\235\230", "|"); } std::string toStringPrint(const unsigned int val) { static char str[100]; snprintf(str, sizeof(str), "%u 0x%x", val, val); str[99] = 0; return str; } std::string toString(uint32_t num) { char buf[30]; buf[29] = '\0'; size_t idx = 28; do buf[idx--] = CAST_8((num % 10) + '0'); while ((num /= 10) != 0); return buf + idx + 1; } std::string toString(uint64_t num) { char buf[100]; buf[99] = '\0'; size_t idx = 98; do buf[idx--] = CAST_8((num % 10) + '0'); while ((num /= 10) != 0); return buf + idx + 1; } std::string toString(uint16_t num) { char buf[10]; buf[9] = '\0'; size_t idx = 8; do buf[idx--] = CAST_8((num % 10) + '0'); while ((num /= 10) != 0); return buf + idx + 1; } std::string toString(unsigned char num) { char buf[5]; buf[4] = '\0'; size_t idx = 3; do buf[idx--] = CAST_8((num % 10) + '0'); while ((num /= 10) != 0); return buf + idx + 1; } std::string toString(int32_t num) { char buf[30]; bool useSign(false); buf[29] = '\0'; size_t idx = 28; if (num < 0) { useSign = true; num = -num; } do buf[idx--] = CAST_8((num % 10) + '0'); while ((num /= 10) != 0); if (useSign) buf[idx--] = '-'; return buf + idx + 1; } std::string toString(const float num) { return strprintf("%f", num); } std::string toString(const double num) { return strprintf("%f", static_cast(num)); } bool isDigit(const std::string &str) { if (str.empty()) return false; const size_t sz = str.size(); for (size_t f = 0; f < sz; f ++) { const char &chr = str[f]; if (chr < '0' || chr > '9') return false; } return true; } void secureChatCommand(std::string &str) { if (str[0] == '/' || str[0] == '@' || str[0] == '#') str = "_" + str; } bool parse2Int(const std::string &args, int &x, int &y) { bool isValid = false; size_t pos = args.find(' '); if (pos == std::string::npos) pos = args.find(','); if (pos != std::string::npos) { if (pos + 1 < args.length()) { x = atoi(args.substr(0, pos).c_str()); y = atoi(args.substr(pos + 1, args.length()).c_str()); isValid = true; } } return isValid; } bool parse2Str(const std::string &args, std::string &str1, std::string &str2) { bool isValid = false; size_t pos = args.find(' '); if (pos == std::string::npos) pos = args.find(','); if (pos != std::string::npos) { if (pos + 1 < args.length()) { str1 = args.substr(0, pos); str2 = args.substr(pos + 1, args.length()); isValid = true; } } return isValid; } uint32_t parseNumber(const std::string &str) { uint32_t i = 0; int idx = 0; if (strStartWith(str, "0x")) idx = 2; else if (str[0] == 'h' || str[0] == 'x') idx = 1; if (idx > 0) sscanf(str.substr(idx).c_str(), "%10x", &i); else i = atoi(str.c_str()); return i; } std::string removeToken(std::string &str, const std::string &token) { const size_t idx = str.find(token); if (idx > 0 && idx != std::string::npos) str = str.substr(idx + 1); else str.clear(); return str; } std::string timeToStr(const uint32_t time) { char buf[101]; const time_t tempTime = time; tm *const timeInfo = localtime(&tempTime); PRAGMA8(GCC diagnostic push) PRAGMA8(GCC diagnostic ignored "-Wformat-y2k") // %c is locale-defined format. gcc8 complains: // '%c' yields only last 2 digits of year in some locales. // However, mails *currently, on ML* expire in way less than a year. if (strftime(&buf[0], 100, "%c", timeInfo) != 0U) return std::string(buf); PRAGMA8(GCC diagnostic pop) return "unknown"; } std::string timeDiffToString(int timeDiff) { std::string str; const int weeks = timeDiff / 60 / 60 / 24 / 7; if (weeks > 0) { // TRANSLATORS: uptime command str = strprintf(ngettext(N_("%d week"), N_("%d weeks"), weeks), weeks); timeDiff -= weeks * 60 * 60 * 24 * 7; } const int days = timeDiff / 60 / 60 / 24; if (days > 0) { if (!str.empty()) str.append(", "); // TRANSLATORS: uptime command str.append(strprintf(ngettext(N_("%d day"), N_("%d days"), days), days)); timeDiff -= days * 60 * 60 * 24; } const int hours = timeDiff / 60 / 60; if (hours > 0) { if (!str.empty()) str.append(", "); // TRANSLATORS: uptime command str.append(strprintf(ngettext(N_("%d hour"), N_("%d hours"), hours), hours)); timeDiff -= hours * 60 * 60; } const int min = timeDiff / 60; if (min > 0) { if (!str.empty()) str.append(", "); // TRANSLATORS: uptime command str.append(strprintf(ngettext(N_("%d minute"), N_("%d minutes"), min), min)); timeDiff -= min * 60; } if (timeDiff > 0) { if (!str.empty()) str.append(", "); // TRANSLATORS: uptime command str.append(strprintf(ngettext(N_("%d second"), N_("%d seconds"), timeDiff), timeDiff)); } if (str.empty()) { // TRANSLATORS: uptime command str.append(strprintf(ngettext(N_("%d second"), N_("%d seconds"), 0), 0)); } return str; } std::string escapeString(std::string str) { replaceAll(str, "\"", "\\\""); return "\"" + str + "\""; } void sanitizePath(std::string &path) { #ifdef WIN32 const char sepStr = '\\'; const std::string sep2Str = "\\\\"; const std::string sepWrongStr = "/"; #else const char sepStr = '/'; const std::string sep2Str = "//"; const std::string sepWrongStr = "\\"; #endif replaceRecursiveAll(path, sepWrongStr, sepStr); replaceRecursiveAll(path, sep2Str, sepStr); } std::string pathJoin(std::string str1, const std::string &str2) { #ifdef WIN32 const char sep = '\\'; std::string sepStr = "\\"; #else const char sep = '/'; std::string sepStr = "/"; #endif if (str1.empty()) { if (str2[0] == sep) return str2; return sepStr.append(str2); } const size_t sz1 = str1.size(); if (str2.empty()) { if (str1[sz1 - 1] == sep) return str1; return str1.append(sepStr); } if (str1[sz1 - 1] == sep) { if (str2[0] == sep) return str1.append(str2.substr(1)); return str1.append(str2); } else { if (str2[0] == sep) return str1.append(str2); return str1.append(sepStr).append(str2); } } std::string pathJoin(std::string str1, const std::string &str2, const std::string &str3) { #ifdef WIN32 const char sep = '\\'; std::string sepStr = "\\"; #else const char sep = '/'; std::string sepStr = "/"; #endif if (str1.empty()) { return pathJoin(str2, str3); } size_t sz1 = str1.size(); if (str2.empty()) { return pathJoin(str1, str3); } if (str3.empty()) { return pathJoin(str1, str2); } if (str1[sz1 - 1] == sep) { if (str2[0] == sep) str1.append(str2.substr(1)); else str1.append(str2); } else { if (str2[0] == sep) str1.append(str2); else str1.append(sepStr).append(str2); } sz1 = str1.size(); if (str1[sz1 - 1] == sep) { if (str3[0] == sep) return str1.append(str3.substr(1)); return str1.append(str3); } else { if (str3[0] == sep) return str1.append(str3); return str1.append(sepStr).append(str3); } } std::string urlJoin(std::string str1, const std::string &str2) { const char sep = '/'; std::string sepStr = "/"; if (str1.empty()) { if (str2[0] == sep) return str2; return sepStr.append(str2); } const size_t sz1 = str1.size(); if (str2.empty()) { if (str1[sz1 - 1] == sep) return str1; return str1.append(sepStr); } if (str1[sz1 - 1] == sep) { if (str2[0] == sep) return str1.append(str2.substr(1)); return str1.append(str2); } else { if (str2[0] == sep) return str1.append(str2); return str1.append(sepStr).append(str2); } } size_t rfindSepatator(const std::string &str1) { const size_t idx1 = str1.rfind('/'); const size_t idx2 = str1.rfind('\\'); if (idx1 != std::string::npos) { // idx1 if (idx2 != std::string::npos) { // idx1, idx2 if (idx1 >= idx2) return idx1; else return idx2; } else { // idx1, not idx2 return idx1; } } else { // not idx1 if (idx2 != std::string::npos) { // not idx1, idx2 return idx2; } else { // not idx1, not idx2 return std::string::npos; } } } #ifndef DYECMD void replaceItemLinks(std::string &msg) { // Check for item link size_t start2 = msg.find('['); size_t sz = msg.size(); while (start2 + 1 < sz && start2 != std::string::npos && msg[start2 + 1] != '@') { const size_t end = msg.find(']', start2); if (start2 + 1 != end && end != std::string::npos) { // excludes timestamps to get parsed if (msg[start2 + 3] == ':') return; // Catch multiple embeds and ignore them // so it doesn't crash the client. while ((msg.find('[', start2 + 1) != std::string::npos) && (msg.find('[', start2 + 1) < end)) { start2 = msg.find('[', start2 + 1); } if (start2 + 1 < sz && end < sz && end > start2 + 1) { std::string itemStr = msg.substr(start2 + 1, end - start2 - 1); StringVect parts; splitToStringVector(parts, itemStr, ','); if (parts.empty()) return; const ItemInfo &itemInfo = ItemDB::get(parts[0]); const int itemId = itemInfo.getId(); if (itemId != 0) { std::string temp = strprintf("@@%d", itemId); std::string name = parts[0]; msg.erase(start2 + 1, end - start2 - 1); parts.erase(parts.begin()); if (!parts.empty()) name.clear(); FOR_EACH (StringVectCIter, it, parts) { std:: string str = *it; trim(str); const ItemInfo &itemInfo2 = ItemDB::get(str); const int cardId = itemInfo2.getId(); if (cardId != 0) temp.append(strprintf(",%d", cardId)); } temp.append("|"); temp.append(name); temp.append("@@"); msg.insert(start2 + 1, temp); sz = msg.size(); } } } start2 = msg.find('[', start2 + 1); } } #else // DYECMD void replaceItemLinks(std::string &msg A_UNUSED) { } #endif // DYECMD