#pragma once #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace nall { struct string; struct string_format; struct string_view { using type = string_view; //view.hpp inline string_view(); inline string_view(const string_view& source); inline string_view(string_view&& source); inline string_view(const char* data); inline string_view(const char* data, uint size); inline string_view(const string& source); template inline string_view(P&&... p); inline ~string_view(); inline auto operator=(const string_view& source) -> type&; inline auto operator=(string_view&& source) -> type&; inline explicit operator bool() const; inline operator const char*() const; inline auto data() const -> const char*; inline auto size() const -> uint; inline auto begin() const { return &_data[0]; } inline auto end() const { return &_data[size()]; } protected: string* _string; const char* _data; mutable int _size; }; //adaptive (SSO + COW) is by far the best choice, the others exist solely to: //1) demonstrate the performance benefit of combining SSO + COW //2) rule out allocator bugs by trying different allocators when needed #define NALL_STRING_ALLOCATOR_ADAPTIVE //#define NALL_STRING_ALLOCATOR_COPY_ON_WRITE //#define NALL_STRING_ALLOCATOR_SMALL_STRING_OPTIMIZATION //#define NALL_STRING_ALLOCATOR_VECTOR //cast.hpp template struct stringify; //format.hpp template inline auto print(P&&...) -> void; template inline auto print(FILE*, P&&...) -> void; template inline auto pad(const T& value, long precision = 0, char padchar = ' ') -> string; inline auto hex(uintmax value, long precision = 0, char padchar = '0') -> string; inline auto octal(uintmax value, long precision = 0, char padchar = '0') -> string; inline auto binary(uintmax value, long precision = 0, char padchar = '0') -> string; //match.hpp inline auto tokenize(const char* s, const char* p) -> bool; inline auto tokenize(vector& list, const char* s, const char* p) -> bool; //utf8.hpp inline auto characters(string_view self, int offset = 0, int length = -1) -> uint; //utility.hpp inline auto slice(string_view self, int offset = 0, int length = -1) -> string; template inline auto fromInteger(char* result, T value) -> char*; template inline auto fromNatural(char* result, T value) -> char*; template inline auto fromReal(char* str, T value) -> uint; struct string { using type = string; protected: #if defined(NALL_STRING_ALLOCATOR_ADAPTIVE) enum : uint { SSO = 24 }; union { struct { //copy-on-write char* _data; uint* _refs; }; struct { //small-string-optimization char _text[SSO]; }; }; inline auto _allocate() -> void; inline auto _copy() -> void; inline auto _resize() -> void; #endif #if defined(NALL_STRING_ALLOCATOR_COPY_ON_WRITE) char* _data; mutable uint* _refs; inline auto _allocate() -> char*; inline auto _copy() -> char*; #endif #if defined(NALL_STRING_ALLOCATOR_SMALL_STRING_OPTIMIZATION) enum : uint { SSO = 24 }; union { char* _data; char _text[SSO]; }; #endif #if defined(NALL_STRING_ALLOCATOR_VECTOR) char* _data; #endif uint _capacity; uint _size; public: inline string(); inline string(string& source) : string() { operator=(source); } inline string(const string& source) : string() { operator=(source); } inline string(string&& source) : string() { operator=(move(source)); } template inline auto get() -> T*; template inline auto data() const -> const T*; template auto size() const -> uint { return _size / sizeof(T); } template auto capacity() const -> uint { return _capacity / sizeof(T); } inline auto reset() -> type&; inline auto reserve(uint) -> type&; inline auto resize(uint) -> type&; inline auto operator=(const string&) -> type&; inline auto operator=(string&&) -> type&; template string(T&& s, P&&... p) : string() { append(forward(s), forward

(p)...); } ~string() { reset(); } explicit operator bool() const { return _size; } operator const char*() const { return (const char*)data(); } operator array_span() { return {(char*)get(), size()}; } operator array_view() const { return {(const char*)data(), size()}; } operator array_span() { return {(uint8_t*)get(), size()}; } operator array_view() const { return {(const uint8_t*)data(), size()}; } auto operator==(const string& source) const -> bool { return size() == source.size() && memory::compare(data(), source.data(), size()) == 0; } auto operator!=(const string& source) const -> bool { return size() != source.size() || memory::compare(data(), source.data(), size()) != 0; } auto operator==(const char* source) const -> bool { return strcmp(data(), source) == 0; } auto operator!=(const char* source) const -> bool { return strcmp(data(), source) != 0; } auto operator==(string_view source) const -> bool { return compare(source) == 0; } auto operator!=(string_view source) const -> bool { return compare(source) != 0; } auto operator< (string_view source) const -> bool { return compare(source) < 0; } auto operator<=(string_view source) const -> bool { return compare(source) <= 0; } auto operator> (string_view source) const -> bool { return compare(source) > 0; } auto operator>=(string_view source) const -> bool { return compare(source) >= 0; } auto begin() -> char* { return &get()[0]; } auto end() -> char* { return &get()[size()]; } auto begin() const -> const char* { return &data()[0]; } auto end() const -> const char* { return &data()[size()]; } //atoi.hpp inline auto boolean() const -> bool; inline auto integer() const -> intmax; inline auto natural() const -> uintmax; inline auto hex() const -> uintmax; inline auto real() const -> double; //core.hpp inline auto operator[](uint) const -> const char&; inline auto operator()(uint, char = 0) const -> char; template inline auto assign(P&&...) -> type&; template inline auto prepend(const T&, P&&...) -> type&; template inline auto prepend(const nall::string_format&, P&&...) -> type&; template inline auto _prepend(const stringify&) -> type&; template inline auto append(const T&, P&&...) -> type&; template inline auto append(const nall::string_format&, P&&...) -> type&; template inline auto _append(const stringify&) -> type&; inline auto length() const -> uint; //find.hpp inline auto contains(string_view characters) const -> maybe; template inline auto _find(int, string_view) const -> maybe; inline auto find(string_view source) const -> maybe; inline auto ifind(string_view source) const -> maybe; inline auto qfind(string_view source) const -> maybe; inline auto iqfind(string_view source) const -> maybe; inline auto findFrom(int offset, string_view source) const -> maybe; inline auto ifindFrom(int offset, string_view source) const -> maybe; inline auto findNext(int offset, string_view source) const -> maybe; inline auto ifindNext(int offset, string_view source) const -> maybe; inline auto findPrevious(int offset, string_view source) const -> maybe; inline auto ifindPrevious(int offset, string_view source) const -> maybe; //format.hpp inline auto format(const nall::string_format& params) -> type&; //compare.hpp template inline static auto _compare(const char*, uint, const char*, uint) -> int; inline static auto compare(string_view, string_view) -> int; inline static auto icompare(string_view, string_view) -> int; inline auto compare(string_view source) const -> int; inline auto icompare(string_view source) const -> int; inline auto equals(string_view source) const -> bool; inline auto iequals(string_view source) const -> bool; inline auto beginsWith(string_view source) const -> bool; inline auto ibeginsWith(string_view source) const -> bool; inline auto endsWith(string_view source) const -> bool; inline auto iendsWith(string_view source) const -> bool; //convert.hpp inline auto downcase() -> type&; inline auto upcase() -> type&; inline auto qdowncase() -> type&; inline auto qupcase() -> type&; inline auto transform(string_view from, string_view to) -> type&; //match.hpp inline auto match(string_view source) const -> bool; inline auto imatch(string_view source) const -> bool; //replace.hpp template inline auto _replace(string_view, string_view, long) -> type&; inline auto replace(string_view from, string_view to, long limit = LONG_MAX) -> type&; inline auto ireplace(string_view from, string_view to, long limit = LONG_MAX) -> type&; inline auto qreplace(string_view from, string_view to, long limit = LONG_MAX) -> type&; inline auto iqreplace(string_view from, string_view to, long limit = LONG_MAX) -> type&; //split.hpp inline auto split(string_view key, long limit = LONG_MAX) const -> vector; inline auto isplit(string_view key, long limit = LONG_MAX) const -> vector; inline auto qsplit(string_view key, long limit = LONG_MAX) const -> vector; inline auto iqsplit(string_view key, long limit = LONG_MAX) const -> vector; //trim.hpp inline auto trim(string_view lhs, string_view rhs, long limit = LONG_MAX) -> type&; inline auto trimLeft(string_view lhs, long limit = LONG_MAX) -> type&; inline auto trimRight(string_view rhs, long limit = LONG_MAX) -> type&; inline auto itrim(string_view lhs, string_view rhs, long limit = LONG_MAX) -> type&; inline auto itrimLeft(string_view lhs, long limit = LONG_MAX) -> type&; inline auto itrimRight(string_view rhs, long limit = LONG_MAX) -> type&; inline auto strip() -> type&; inline auto stripLeft() -> type&; inline auto stripRight() -> type&; //utf8.hpp inline auto characters(int offset = 0, int length = -1) const -> uint; //utility.hpp inline static auto read(string_view filename) -> string; inline static auto repeat(string_view pattern, uint times) -> string; inline auto fill(char fill = ' ') -> type&; inline auto hash() const -> uint; inline auto remove(uint offset, uint length) -> type&; inline auto reverse() -> type&; inline auto size(int length, char fill = ' ') -> type&; inline auto slice(int offset = 0, int length = -1) const -> string; }; template<> struct vector : vector_base { using type = vector; using vector_base::vector_base; vector(const vector& source) { vector_base::operator=(source); } vector(vector& source) { vector_base::operator=(source); } vector(vector&& source) { vector_base::operator=(move(source)); } template vector(P&&... p) { append(forward

(p)...); } inline auto operator=(const vector& source) -> type& { return vector_base::operator=(source), *this; } inline auto operator=(vector& source) -> type& { return vector_base::operator=(source), *this; } inline auto operator=(vector&& source) -> type& { return vector_base::operator=(move(source)), *this; } //vector.hpp template inline auto append(const string&, P&&...) -> type&; inline auto append() -> type&; inline auto isort() -> type&; inline auto find(string_view source) const -> maybe; inline auto ifind(string_view source) const -> maybe; inline auto match(string_view pattern) const -> vector; inline auto merge(string_view separator) const -> string; inline auto strip() -> type&; //split.hpp template inline auto _split(string_view, string_view, long) -> type&; }; struct string_format : vector { using type = string_format; template string_format(P&&... p) { reserve(sizeof...(p)); append(forward

(p)...); } template inline auto append(const T&, P&&... p) -> type&; inline auto append() -> type&; }; inline auto operator"" _s(const char* value, std::size_t) -> string { return {value}; } } #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include