Skip to content

String manipulation functions added #259

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

String manipulation functions added #259

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f0bd16b
String manipulation functions added
NemesisWasAlien Jun 8, 2022
8e996a2
Merge branch 'main' into dev
NemesisWasAlienToo Jun 8, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
167 changes: 167 additions & 0 deletions include/ctll/fixed_string.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -207,6 +207,173 @@ template <> class fixed_string<0> {
template <typename CharT, size_t N> fixed_string(const CharT (&)[N]) -> fixed_string<N-1>;
template <size_t N> fixed_string(fixed_string<N>) -> fixed_string<N>;

template <ctll::fixed_string... Strings>
constexpr auto Concatenate() noexcept
{
char32_t Data[(Strings.size() + ...) + 1];

size_t Index = 0;

([&](auto &Item) mutable
{
for (size_t i = 0; i < Item.size(); i++)
{
Data[Index++] = Item[i];
} }(Strings),
...);

return ctll::fixed_string<(Strings.size() + ...)>(Data);
}

template <size_t Index, ctll::fixed_string String>
constexpr auto Split() noexcept
{
char32_t First[Index + 1];
char32_t Second[String.size() - Index + 1];

size_t Counter = 0;

for (size_t i = 0; i < (sizeof(First) / sizeof(char32_t)) - 1; i++)
{
First[i] = String[Counter++];
}

for (size_t i = 0; i < (sizeof(Second) / sizeof(char32_t)) - 1; i++)
{
Second[i] = String[Counter++];
}

return std::make_tuple(ctll::fixed_string(First), ctll::fixed_string(Second));
}

template <ctll::fixed_string Original, ctll::fixed_string Text>
constexpr size_t Find(size_t Index)
{
if (!Original.size())
return static_cast<size_t>(-1);

for (size_t i = Index; i < Original.size() - Text.size() + 1; i++)
{
if (Original[i] != Text[0])
continue;

bool found = true;

for (size_t j = 1; j < Text.size(); j++)
{
if (Original[i + j] != Text[j])
{
found = false;
break;
}
}

if (found)
{
return i;
}
}

return static_cast<size_t>(-1);
}

// Make Lenght use a struct

template <ctll::fixed_string Original, ctll::fixed_string Phrase>
constexpr size_t FindCount()
{
if (!Original.size())
return static_cast<size_t>(-1);

size_t Count = 0;
size_t Index = 0;

while ((Index = Find<Original, Phrase>(Index)) != static_cast<size_t>(-1))
{
Count++;
Index += Phrase.size();
}

return Count;
}

template <size_t Original, size_t Count, size_t PSize, size_t TSize>
constexpr size_t ReplacedSize() noexcept
{
if (!Original)
return 0;

if (PSize == TSize)
return Original;

if constexpr (TSize > PSize)
{
return Original + Count * (TSize - PSize);
}
else
{
return Original - Count * (PSize - TSize);
}
}

template <ctll::fixed_string Original, ctll::fixed_string Phrase, ctll::fixed_string Text>
constexpr auto Replace(size_t Index)
{
char32_t Data[ReplacedSize<Original.size(), FindCount<Original, Phrase>(), Phrase.size(), Text.size()>() + 1];
size_t OCounter = 0, RCounter = 0;

while ((Index = Find<Original, Phrase>(Index + 1)) != static_cast<size_t>(-1))
{
for (; RCounter < Index; RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

for (size_t i = 0; i < Text.size(); i++)
{
Data[OCounter++] = Text[i];
}

RCounter += Phrase.size();
}

for (; RCounter < Original.size(); RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

return ctll::fixed_string(Data);
}

template <size_t L, size_t N, size_t M>
constexpr auto Replace(ctll::fixed_string<L> Original, ctll::fixed_string<N> Phrase, ctll::fixed_string<M> Text, size_t Index)
{
char32_t Data[ReplacedSize<Original.size(), FindCount<Original, Phrase>(), Phrase.size(), Text.size()>() + 1];
size_t OCounter = 0, RCounter = 0;

while ((Index = Find(Original, Phrase, Index + 1)) != static_cast<size_t>(-1))
{
for (; RCounter < Index; RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

for (size_t i = 0; i < M; i++)
{
Data[OCounter++] = Text[i];
}

RCounter += N;
}

for (; RCounter < L; RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

return ctll::fixed_string(Data);
}

}

#endif
167 changes: 167 additions & 0 deletions single-header/ctre-unicode.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -442,6 +442,173 @@ template <> class fixed_string<0> {
template <typename CharT, size_t N> fixed_string(const CharT (&)[N]) -> fixed_string<N-1>;
template <size_t N> fixed_string(fixed_string<N>) -> fixed_string<N>;

template <ctll::fixed_string... Strings>
constexpr auto Concatenate() noexcept
{
char32_t Data[(Strings.size() + ...) + 1];

size_t Index = 0;

([&](auto &Item) mutable
{
for (size_t i = 0; i < Item.size(); i++)
{
Data[Index++] = Item[i];
} }(Strings),
...);

return ctll::fixed_string<(Strings.size() + ...)>(Data);
}

template <size_t Index, ctll::fixed_string String>
constexpr auto Split() noexcept
{
char32_t First[Index + 1];
char32_t Second[String.size() - Index + 1];

size_t Counter = 0;

for (size_t i = 0; i < (sizeof(First) / sizeof(char32_t)) - 1; i++)
{
First[i] = String[Counter++];
}

for (size_t i = 0; i < (sizeof(Second) / sizeof(char32_t)) - 1; i++)
{
Second[i] = String[Counter++];
}

return std::make_tuple(ctll::fixed_string(First), ctll::fixed_string(Second));
}

template <ctll::fixed_string Original, ctll::fixed_string Text>
constexpr size_t Find(size_t Index)
{
if (!Original.size())
return static_cast<size_t>(-1);

for (size_t i = Index; i < Original.size() - Text.size() + 1; i++)
{
if (Original[i] != Text[0])
continue;

bool found = true;

for (size_t j = 1; j < Text.size(); j++)
{
if (Original[i + j] != Text[j])
{
found = false;
break;
}
}

if (found)
{
return i;
}
}

return static_cast<size_t>(-1);
}

// Make Lenght use a struct

template <ctll::fixed_string Original, ctll::fixed_string Phrase>
constexpr size_t FindCount()
{
if (!Original.size())
return static_cast<size_t>(-1);

size_t Count = 0;
size_t Index = 0;

while ((Index = Find<Original, Phrase>(Index)) != static_cast<size_t>(-1))
{
Count++;
Index += Phrase.size();
}

return Count;
}

template <size_t Original, size_t Count, size_t PSize, size_t TSize>
constexpr size_t ReplacedSize() noexcept
{
if (!Original)
return 0;

if (PSize == TSize)
return Original;

if constexpr (TSize > PSize)
{
return Original + Count * (TSize - PSize);
}
else
{
return Original - Count * (PSize - TSize);
}
}

template <ctll::fixed_string Original, ctll::fixed_string Phrase, ctll::fixed_string Text>
constexpr auto Replace(size_t Index)
{
char32_t Data[ReplacedSize<Original.size(), FindCount<Original, Phrase>(), Phrase.size(), Text.size()>() + 1];
size_t OCounter = 0, RCounter = 0;

while ((Index = Find<Original, Phrase>(Index + 1)) != static_cast<size_t>(-1))
{
for (; RCounter < Index; RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

for (size_t i = 0; i < Text.size(); i++)
{
Data[OCounter++] = Text[i];
}

RCounter += Phrase.size();
}

for (; RCounter < Original.size(); RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

return ctll::fixed_string(Data);
}

template <size_t L, size_t N, size_t M>
constexpr auto Replace(ctll::fixed_string<L> Original, ctll::fixed_string<N> Phrase, ctll::fixed_string<M> Text, size_t Index)
{
char32_t Data[ReplacedSize<Original.size(), FindCount<Original, Phrase>(), Phrase.size(), Text.size()>() + 1];
size_t OCounter = 0, RCounter = 0;

while ((Index = Find(Original, Phrase, Index + 1)) != static_cast<size_t>(-1))
{
for (; RCounter < Index; RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

for (size_t i = 0; i < M; i++)
{
Data[OCounter++] = Text[i];
}

RCounter += N;
}

for (; RCounter < L; RCounter++)
{
Data[OCounter++] = Original[RCounter];
}

return ctll::fixed_string(Data);
}

}

#endif
Expand Down
Loading