mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-11 01:06:01 +03:00
ebf308d413
It's a bit faster than g++ and seems to generate perfectly fine code. The kernel is also roughly 10% smaller(!)
55 lines
1.5 KiB
C++
55 lines
1.5 KiB
C++
#pragma once
|
|
|
|
#include "Retainable.h"
|
|
#include "RetainPtr.h"
|
|
#include "Types.h"
|
|
|
|
namespace AK {
|
|
|
|
enum ShouldChomp { NoChomp, Chomp };
|
|
|
|
class StringImpl : public Retainable<StringImpl> {
|
|
public:
|
|
static RetainPtr<StringImpl> createUninitialized(size_t length, char*& buffer);
|
|
static RetainPtr<StringImpl> create(const char* cstring, ShouldChomp = NoChomp);
|
|
static RetainPtr<StringImpl> create(const char* cstring, size_t length, ShouldChomp = NoChomp);
|
|
RetainPtr<StringImpl> toLowercase() const;
|
|
RetainPtr<StringImpl> toUppercase() const;
|
|
|
|
static StringImpl& theEmptyStringImpl();
|
|
static void initializeGlobals();
|
|
|
|
~StringImpl();
|
|
|
|
size_t length() const { return m_length; }
|
|
const char* characters() const { return m_characters; }
|
|
char operator[](size_t i) const { ASSERT(i < m_length); return m_characters[i]; }
|
|
|
|
unsigned hash() const
|
|
{
|
|
if (!m_hasHash)
|
|
computeHash();
|
|
return m_hash;
|
|
}
|
|
|
|
private:
|
|
enum ConstructTheEmptyStringImplTag { ConstructTheEmptyStringImpl };
|
|
explicit StringImpl(ConstructTheEmptyStringImplTag) : m_characters("") { }
|
|
|
|
enum ConstructWithInlineBufferTag { ConstructWithInlineBuffer };
|
|
explicit StringImpl(ConstructWithInlineBufferTag, size_t length) : m_length(length), m_characters(m_inlineBuffer) { }
|
|
|
|
void computeHash() const;
|
|
|
|
size_t m_length { 0 };
|
|
mutable bool m_hasHash { false };
|
|
const char* m_characters { nullptr };
|
|
mutable unsigned m_hash { 0 };
|
|
char m_inlineBuffer[0];
|
|
};
|
|
|
|
}
|
|
|
|
using AK::StringImpl;
|
|
using AK::Chomp;
|