blob: 7519c03e94d6d25d7035ba6a6d95af2ccb53ca35 [file] [log] [blame]
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#define __STDC_CONSTANT_MACROS
#include <log4cxx/logstring.h>
#include <log4cxx/helpers/stringhelper.h>
#include <log4cxx/helpers/transcoder.h>
#include <algorithm>
#include <vector>
#include <iterator>
#include <algorithm>
#include <cctype>
using namespace LOG4CXX_NS;
using namespace LOG4CXX_NS::helpers;
bool StringHelper::equalsIgnoreCase(const LogString& s1, const logchar* upper, const logchar* lower)
{
for (LogString::const_iterator iter = s1.begin();
iter != s1.end();
iter++, upper++, lower++)
{
if (*iter != *upper && *iter != * lower)
{
return false;
}
}
return (*upper == 0);
}
bool StringHelper::equalsIgnoreCase(const LogString& s1, const LogString& upper, const LogString& lower)
{
LogString::const_iterator u = upper.begin();
LogString::const_iterator l = lower.begin();
LogString::const_iterator iter = s1.begin();
for (;
iter != s1.end() && u != upper.end() && l != lower.end();
iter++, u++, l++)
{
if (*iter != *u && *iter != *l)
{
return false;
}
}
return u == upper.end() && iter == s1.end();
}
LogString StringHelper::toLowerCase(const LogString& s)
{
LogString d;
std::transform(s.begin(), s.end(),
std::insert_iterator<LogString>(d, d.begin()), tolower);
return d;
}
LogString StringHelper::trim(const LogString& s)
{
LogString::size_type pos = s.find_first_not_of(' ');
if (pos == std::string::npos)
{
return LogString();
}
LogString::size_type n = s.find_last_not_of(' ') - pos + 1;
return s.substr(pos, n);
}
bool StringHelper::startsWith(const LogString& s, const LogString& prefix)
{
if (s.length() < prefix.length())
{
return false;
}
return s.compare(0, prefix.length(), prefix) == 0;
}
bool StringHelper::endsWith(const LogString& s, const LogString& suffix)
{
if (suffix.length() <= s.length())
{
return s.compare(s.length() - suffix.length(), suffix.length(), suffix) == 0;
}
return false;
}
int StringHelper::toInt(const LogString& s)
{
#if LOG4CXX_LOGCHAR_IS_UNICHAR
std::string as;
Transcoder::encode(s, as);
return std::stoi(as);
#else
return std::stoi(s);
#endif
}
int64_t StringHelper::toInt64(const LogString& s)
{
#if LOG4CXX_LOGCHAR_IS_UNICHAR
std::string as;
Transcoder::encode(s, as);
return std::stoll(as);
#else
return std::stoll(s);
#endif
}
void StringHelper::toString(int n, Pool& pool, LogString& dst)
{
#if LOG4CXX_LOGCHAR_IS_WCHAR
dst.append(std::to_wstring(n));
#else
Transcoder::decode(std::to_string(n), dst);
#endif
}
void StringHelper::toString(bool val, LogString& dst)
{
if (val)
{
dst.append(LOG4CXX_STR("true"));
}
else
{
dst.append(LOG4CXX_STR("false"));
}
}
void StringHelper::toString(int64_t n, Pool& pool, LogString& dst)
{
#if LOG4CXX_LOGCHAR_IS_WCHAR
dst.append(std::to_wstring(n));
#else
Transcoder::decode(std::to_string(n), dst);
#endif
}
void StringHelper::toString(size_t n, Pool& pool, LogString& dst)
{
#if LOG4CXX_LOGCHAR_IS_WCHAR
dst.append(std::to_wstring(n));
#else
Transcoder::decode(std::to_string(n), dst);
#endif
}
LogString StringHelper::format(const LogString& pattern, const std::vector<LogString>& params)
{
LogString result;
int i = 0;
while (pattern[i] != 0)
{
if (pattern[i] == 0x7B /* '{' */ && pattern[i + 1] >= 0x30 /* '0' */ &&
pattern[i + 1] <= 0x39 /* '9' */ && pattern[i + 2] == 0x7D /* '}' */)
{
int arg = pattern[i + 1] - 0x30 /* '0' */;
result = result + params[arg];
i += 3;
}
else
{
result = result + pattern[i];
i++;
}
}
return result;
}