56611604b2
Sometimes we really need to have a String instead of a StringView, but some of those strings might not need to own their data. Make it possible to explicitely construct a String that does not own the underlying buffer. Use it when parsing balanced strings.
171 lines
3.3 KiB
C++
171 lines
3.3 KiB
C++
#include "string.hh"
|
|
|
|
#include <cstdio>
|
|
#include <cstring>
|
|
|
|
namespace Kakoune
|
|
{
|
|
|
|
String::Data::Data(String::NoCopy, const char* data, size_t size)
|
|
{
|
|
l.ptr = const_cast<char*>(data);
|
|
l.size = size;
|
|
l.capacity = 0;
|
|
}
|
|
|
|
String::Data::Data(const char* data, size_t size, size_t capacity)
|
|
{
|
|
if (capacity > Short::capacity)
|
|
{
|
|
if (capacity & 1)
|
|
++capacity;
|
|
|
|
kak_assert(capacity < Long::max_capacity);
|
|
l.ptr = Alloc{}.allocate(capacity+1);
|
|
l.size = size;
|
|
l.capacity = capacity;
|
|
|
|
if (data != nullptr)
|
|
memcpy(l.ptr, data, size);
|
|
l.ptr[size] = 0;
|
|
}
|
|
else
|
|
set_short(data, size);
|
|
}
|
|
|
|
String::Data::Data(Data&& other) noexcept
|
|
{
|
|
if (other.is_long())
|
|
{
|
|
l = other.l;
|
|
other.set_empty();
|
|
}
|
|
else
|
|
s = other.s;
|
|
}
|
|
|
|
String::Data& String::Data::operator=(const Data& other)
|
|
{
|
|
if (&other == this)
|
|
return *this;
|
|
|
|
const size_t new_size = other.size();
|
|
reserve<false>(new_size);
|
|
memcpy(data(), other.data(), new_size+1);
|
|
set_size(new_size);
|
|
|
|
return *this;
|
|
}
|
|
|
|
String::Data& String::Data::operator=(Data&& other) noexcept
|
|
{
|
|
if (&other == this)
|
|
return *this;
|
|
|
|
release();
|
|
|
|
if (other.is_long())
|
|
{
|
|
l = other.l;
|
|
other.set_empty();
|
|
}
|
|
else
|
|
s = other.s;
|
|
|
|
return *this;
|
|
}
|
|
|
|
template<bool copy>
|
|
void String::Data::reserve(size_t new_capacity)
|
|
{
|
|
if (capacity() != 0 and new_capacity <= capacity())
|
|
return;
|
|
|
|
if (is_long())
|
|
new_capacity = std::max(l.capacity * 2, new_capacity);
|
|
|
|
if (new_capacity & 1)
|
|
++new_capacity;
|
|
|
|
kak_assert(new_capacity < Long::max_capacity);
|
|
char* new_ptr = Alloc{}.allocate(new_capacity+1);
|
|
if (copy)
|
|
{
|
|
memcpy(new_ptr, data(), size()+1);
|
|
l.size = size();
|
|
}
|
|
release();
|
|
|
|
l.ptr = new_ptr;
|
|
l.capacity = new_capacity;
|
|
}
|
|
|
|
template void String::Data::reserve<true>(size_t);
|
|
template void String::Data::reserve<false>(size_t);
|
|
|
|
void String::Data::force_size(size_t new_size)
|
|
{
|
|
reserve<false>(new_size);
|
|
set_size(new_size);
|
|
}
|
|
|
|
void String::Data::append(const char* str, size_t len)
|
|
{
|
|
if (len == 0)
|
|
return;
|
|
|
|
const size_t new_size = size() + len;
|
|
reserve(new_size);
|
|
|
|
memcpy(data() + size(), str, len);
|
|
set_size(new_size);
|
|
data()[new_size] = 0;
|
|
}
|
|
|
|
void String::Data::clear()
|
|
{
|
|
release();
|
|
set_empty();
|
|
}
|
|
|
|
void String::Data::release()
|
|
{
|
|
if (is_long() and l.capacity != 0)
|
|
Alloc{}.deallocate(l.ptr, l.capacity+1);
|
|
}
|
|
|
|
void String::resize(ByteCount size, char c)
|
|
{
|
|
const size_t target_size = (size_t)size;
|
|
const size_t current_size = m_data.size();
|
|
if (target_size < current_size)
|
|
m_data.set_size(target_size);
|
|
else if (target_size > current_size)
|
|
{
|
|
m_data.reserve(target_size);
|
|
m_data.set_size(target_size);
|
|
for (auto i = current_size; i < target_size; ++i)
|
|
m_data.data()[i] = c;
|
|
}
|
|
}
|
|
|
|
void String::Data::set_size(size_t size)
|
|
{
|
|
if (is_long())
|
|
l.size = size;
|
|
else
|
|
s.size = (size << 1) | 1;
|
|
}
|
|
|
|
void String::Data::set_short(const char* data, size_t size)
|
|
{
|
|
s.size = (size << 1) | 1;
|
|
if (data != nullptr)
|
|
memcpy(s.string, data, size);
|
|
s.string[size] = 0;
|
|
}
|
|
|
|
const String String::ms_empty;
|
|
|
|
}
|