ladybird/AK/String.cpp

339 lines
8.5 KiB
C++
Raw Normal View History

/*
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
* All rights reserved.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT HOLDER 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.
*/
#include <AK/StdLibExtras.h>
#include <AK/String.h>
#include <AK/StringBuilder.h>
#include <AK/Vector.h>
#ifndef KERNEL
# include <inttypes.h>
#endif
#ifdef KERNEL
extern "C" char* strstr(const char* haystack, const char* needle);
#endif
static inline char to_lowercase(char c)
{
if (c >= 'A' && c <= 'Z')
return c | 0x20;
return c;
}
namespace AK {
bool String::operator==(const String& other) const
{
if (!m_impl)
return !other.m_impl;
if (!other.m_impl)
return false;
if (length() != other.length())
return false;
2019-05-26 02:08:36 +00:00
return !memcmp(characters(), other.characters(), length());
}
bool String::operator==(const StringView& other) const
{
if (!m_impl)
return !other.m_characters;
if (!other.m_characters)
return false;
if (length() != other.length())
return false;
return !memcmp(characters(), other.characters_without_null_termination(), length());
}
bool String::operator<(const String& other) const
{
if (!m_impl)
return other.m_impl;
if (!other.m_impl)
return false;
return strcmp(characters(), other.characters()) < 0;
}
2019-10-19 18:50:55 +00:00
bool String::operator>(const String& other) const
{
if (!m_impl)
return other.m_impl;
if (!other.m_impl)
return false;
return strcmp(characters(), other.characters()) > 0;
}
String String::empty()
{
2018-12-21 01:10:45 +00:00
return StringImpl::the_empty_stringimpl();
}
2018-12-21 01:10:45 +00:00
String String::isolated_copy() const
2018-10-26 07:54:29 +00:00
{
if (!m_impl)
return {};
2018-10-26 07:54:29 +00:00
if (!m_impl->length())
return empty();
char* buffer;
2018-12-21 01:10:45 +00:00
auto impl = StringImpl::create_uninitialized(length(), buffer);
2018-10-26 07:54:29 +00:00
memcpy(buffer, m_impl->characters(), m_impl->length());
return String(move(*impl));
}
String String::substring(size_t start, size_t length) const
2018-10-16 09:42:39 +00:00
{
if (!length)
return {};
2018-10-16 09:42:39 +00:00
ASSERT(m_impl);
ASSERT(start + length <= m_impl->length());
// FIXME: This needs some input bounds checking.
return { characters() + start, length };
}
StringView String::substring_view(size_t start, size_t length) const
{
ASSERT(m_impl);
ASSERT(start + length <= m_impl->length());
// FIXME: This needs some input bounds checking.
return { characters() + start, length };
2018-10-16 09:42:39 +00:00
}
Vector<String> String::split(char separator, bool keep_empty) const
{
return split_limit(separator, 0, keep_empty);
}
Vector<String> String::split_limit(char separator, size_t limit, bool keep_empty) const
{
2018-12-21 01:10:45 +00:00
if (is_empty())
return {};
2018-10-16 09:42:39 +00:00
Vector<String> v;
size_t substart = 0;
for (size_t i = 0; i < length() && (v.size() + 1) != limit; ++i) {
2018-10-16 09:42:39 +00:00
char ch = characters()[i];
if (ch == separator) {
size_t sublen = i - substart;
if (sublen != 0 || keep_empty)
2018-10-16 09:42:39 +00:00
v.append(substring(substart, sublen));
substart = i + 1;
}
}
size_t taillen = length() - substart;
if (taillen != 0 || keep_empty)
2018-10-16 09:42:39 +00:00
v.append(substring(substart, taillen));
return v;
}
Vector<StringView> String::split_view(const char separator, bool keep_empty) const
{
if (is_empty())
return {};
Vector<StringView> v;
size_t substart = 0;
for (size_t i = 0; i < length(); ++i) {
char ch = characters()[i];
if (ch == separator) {
size_t sublen = i - substart;
if (sublen != 0 || keep_empty)
v.append(substring_view(substart, sublen));
substart = i + 1;
}
}
size_t taillen = length() - substart;
if (taillen != 0 || keep_empty)
v.append(substring_view(substart, taillen));
return v;
}
2018-12-21 01:10:45 +00:00
ByteBuffer String::to_byte_buffer() const
{
if (!m_impl)
return nullptr;
return ByteBuffer::copy(reinterpret_cast<const u8*>(characters()), length());
}
int String::to_int(bool& ok) const
{
return StringUtils::convert_to_int(this->view(), ok);
}
unsigned String::to_uint(bool& ok) const
{
return StringUtils::convert_to_uint(this->view(), ok);
}
String String::number(unsigned long long value)
{
int size;
char buffer[32];
size = sprintf(buffer, "%llu", value);
return String(buffer, size);
}
String String::number(unsigned long value)
{
int size;
char buffer[32];
size = sprintf(buffer, "%lu", value);
return String(buffer, size);
}
String String::number(unsigned value)
{
char buffer[32];
int size = sprintf(buffer, "%u", value);
return String(buffer, size);
}
String String::number(long long value)
{
char buffer[32];
int size = sprintf(buffer, "%lld", value);
return String(buffer, size);
}
String String::number(long value)
{
char buffer[32];
int size = sprintf(buffer, "%ld", value);
return String(buffer, size);
}
String String::number(int value)
{
char buffer[32];
int size = sprintf(buffer, "%d", value);
return String(buffer, size);
}
String String::format(const char* fmt, ...)
{
StringBuilder builder;
va_list ap;
va_start(ap, fmt);
builder.appendvf(fmt, ap);
va_end(ap);
return builder.to_string();
}
bool String::starts_with(const StringView& str) const
{
if (str.is_empty())
return true;
if (is_empty())
return false;
if (str.length() > length())
return false;
return !memcmp(characters(), str.characters_without_null_termination(), str.length());
}
bool String::starts_with(char ch) const
{
if (is_empty())
return false;
return characters()[0] == ch;
}
bool String::ends_with(const StringView& str) const
{
if (str.is_empty())
return true;
if (is_empty())
return false;
if (str.length() > length())
return false;
return !memcmp(characters() + (length() - str.length()), str.characters_without_null_termination(), str.length());
}
bool String::ends_with(char ch) const
{
if (is_empty())
return false;
return characters()[length() - 1] == ch;
}
String String::repeated(char ch, size_t count)
{
if (!count)
return empty();
char* buffer;
auto impl = StringImpl::create_uninitialized(count, buffer);
memset(buffer, ch, count);
return *impl;
}
bool String::matches(const StringView& mask, CaseSensitivity case_sensitivity) const
{
return StringUtils::matches(*this, mask, case_sensitivity);
}
bool String::contains(const String& needle) const
{
return strstr(characters(), needle.characters());
}
bool String::equals_ignoring_case(const StringView& other) const
{
if (other.m_impl == impl())
return true;
if (length() != other.length())
return false;
for (size_t i = 0; i < length(); ++i) {
if (::to_lowercase(characters()[i]) != ::to_lowercase(other.characters_without_null_termination()[i]))
return false;
}
return true;
}
String escape_html_entities(const StringView& html)
{
StringBuilder builder;
for (size_t i = 0; i < html.length(); ++i) {
if (html[i] == '<')
builder.append("&lt;");
else if (html[i] == '>')
builder.append("&gt;");
else if (html[i] == '&')
builder.append("&amp;");
else
builder.append(html[i]);
}
return builder.to_string();
}
}