/* * libjingle * Copyright 2004--2005, Google Inc. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * 2. 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. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. */ #include "talk/base/stringutils.h" #include "talk/base/common.h" namespace talk_base { bool memory_check(const void* memory, int c, size_t count) { const char* char_memory = static_cast(memory); char char_c = static_cast(c); for (size_t i = 0; i < count; ++i) { if (char_memory[i] != char_c) { return false; } } return true; } bool string_match(const char* target, const char* pattern) { while (*pattern) { if (*pattern == '*') { if (!*++pattern) { return true; } while (*target) { if ((toupper(*pattern) == toupper(*target)) && string_match(target + 1, pattern + 1)) { return true; } ++target; } return false; } else { if (toupper(*pattern) != toupper(*target)) { return false; } ++target; ++pattern; } } return !*target; } #ifdef WIN32 int ascii_string_compare(const wchar_t* s1, const char* s2, size_t n, CharacterTransformation transformation) { wchar_t c1, c2; while (true) { if (n-- == 0) return 0; c1 = transformation(*s1); // Double check that characters are not UTF-8 ASSERT(static_cast(*s2) < 128); // Note: *s2 gets implicitly promoted to wchar_t c2 = transformation(*s2); if (c1 != c2) return (c1 < c2) ? -1 : 1; if (!c1) return 0; ++s1; ++s2; } } size_t asccpyn(wchar_t* buffer, size_t buflen, const char* source, size_t srclen) { if (buflen <= 0) return 0; if (srclen == SIZE_UNKNOWN) { srclen = strlenn(source, buflen - 1); } else if (srclen >= buflen) { srclen = buflen - 1; } #if _DEBUG // Double check that characters are not UTF-8 for (size_t pos = 0; pos < srclen; ++pos) ASSERT(static_cast(source[pos]) < 128); #endif // _DEBUG std::copy(source, source + srclen, buffer); buffer[srclen] = 0; return srclen; } #endif // WIN32 void replace_substrs(const char *search, size_t search_len, const char *replace, size_t replace_len, std::string *s) { size_t pos = 0; while ((pos = s->find(search, pos, search_len)) != std::string::npos) { s->replace(pos, search_len, replace, replace_len); pos += replace_len; } } bool starts_with(const char *s1, const char *s2) { return strncmp(s1, s2, strlen(s2)) == 0; } bool ends_with(const char *s1, const char *s2) { size_t s1_length = strlen(s1); size_t s2_length = strlen(s2); if (s2_length > s1_length) { return false; } const char* start = s1 + (s1_length - s2_length); return strncmp(start, s2, s2_length) == 0; } static const char kWhitespace[] = " \n\r\t"; std::string string_trim(const std::string& s) { std::string::size_type first = s.find_first_not_of(kWhitespace); std::string::size_type last = s.find_last_not_of(kWhitespace); if (first == std::string::npos || last == std::string::npos) { return std::string(""); } return s.substr(first, last - first + 1); } } // namespace talk_base