mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-10 13:00:29 +03:00
3bbf4610d2
You can now #include <AK/Forward.h> to get most of the AK types as forward declarations. Header dependency explosion is one of the main contributors to compile times at the moment, so this is a step towards smaller include graphs.
116 lines
3.1 KiB
C++
116 lines
3.1 KiB
C++
/*
|
|
* 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/PrintfImplementation.h>
|
|
#include <AK/StdLibExtras.h>
|
|
#include <AK/StringBuilder.h>
|
|
#include <AK/String.h>
|
|
|
|
namespace AK {
|
|
|
|
inline void StringBuilder::will_append(size_t size)
|
|
{
|
|
if ((m_length + size) > (size_t)m_buffer.size())
|
|
m_buffer.grow(max((size_t)16, (size_t)m_buffer.size() * 2 + size));
|
|
}
|
|
|
|
StringBuilder::StringBuilder(size_t initial_capacity)
|
|
{
|
|
m_buffer.grow((int)initial_capacity);
|
|
}
|
|
|
|
void StringBuilder::append(const StringView& str)
|
|
{
|
|
if (str.is_empty())
|
|
return;
|
|
will_append(str.length());
|
|
memcpy(m_buffer.data() + m_length, str.characters_without_null_termination(), str.length());
|
|
m_length += str.length();
|
|
}
|
|
|
|
void StringBuilder::append(const char* characters, size_t length)
|
|
{
|
|
if (!length)
|
|
return;
|
|
will_append(length);
|
|
memcpy(m_buffer.data() + m_length, characters, length);
|
|
m_length += length;
|
|
}
|
|
|
|
void StringBuilder::append(char ch)
|
|
{
|
|
will_append(1);
|
|
m_buffer.data()[m_length] = ch;
|
|
m_length += 1;
|
|
}
|
|
|
|
void StringBuilder::appendvf(const char* fmt, va_list ap)
|
|
{
|
|
printf_internal([this](char*&, char ch) {
|
|
append(ch);
|
|
},
|
|
nullptr, fmt, ap);
|
|
}
|
|
|
|
void StringBuilder::appendf(const char* fmt, ...)
|
|
{
|
|
va_list ap;
|
|
va_start(ap, fmt);
|
|
will_append(strlen(fmt));
|
|
appendvf(fmt, ap);
|
|
va_end(ap);
|
|
}
|
|
|
|
ByteBuffer StringBuilder::to_byte_buffer()
|
|
{
|
|
m_buffer.trim(m_length);
|
|
m_length = 0;
|
|
return move(m_buffer);
|
|
}
|
|
|
|
String StringBuilder::to_string()
|
|
{
|
|
return String((const char*)m_buffer.data(), m_length);
|
|
}
|
|
|
|
String StringBuilder::build()
|
|
{
|
|
return to_string();
|
|
}
|
|
|
|
StringView StringBuilder::string_view() const
|
|
{
|
|
return StringView { (const char*)m_buffer.data(), m_length };
|
|
}
|
|
|
|
void StringBuilder::clear()
|
|
{
|
|
m_buffer.clear();
|
|
m_length = 0;
|
|
}
|
|
|
|
}
|