mirror of
https://github.com/gbdev/rgbds.git
synced 2025-11-20 18:22:07 +00:00
Use std::vector for charmap output
This commit is contained in:
@@ -139,17 +139,13 @@ bool charmap_HasChar(char const *input)
|
||||
return charmap.nodes[nodeIdx].isTerminal;
|
||||
}
|
||||
|
||||
size_t charmap_Convert(char const *input, uint8_t *output)
|
||||
void charmap_Convert(char const *input, std::vector<uint8_t> &output)
|
||||
{
|
||||
uint8_t *start = output;
|
||||
|
||||
while (charmap_ConvertNext(&input, &output))
|
||||
;
|
||||
|
||||
return output - start;
|
||||
}
|
||||
|
||||
size_t charmap_ConvertNext(char const **input, uint8_t **output)
|
||||
size_t charmap_ConvertNext(char const **input, std::vector<uint8_t> *output)
|
||||
{
|
||||
// The goal is to match the longest mapping possible.
|
||||
// For that, advance through the trie with each character read.
|
||||
@@ -181,22 +177,20 @@ size_t charmap_ConvertNext(char const **input, uint8_t **output)
|
||||
|
||||
if (matchIdx) { // A match was found, use it
|
||||
if (output)
|
||||
*(*output)++ = charmap.nodes[matchIdx].value;
|
||||
output->push_back(charmap.nodes[matchIdx].value);
|
||||
|
||||
return 1;
|
||||
|
||||
} else if (**input) { // No match found, but there is some input left
|
||||
int firstChar = **input;
|
||||
// This will write the codepoint's value to `output`, little-endian
|
||||
size_t codepointLen = readUTF8Char(output ? *output : NULL, *input);
|
||||
size_t codepointLen = readUTF8Char(output, *input);
|
||||
|
||||
if (codepointLen == 0)
|
||||
error("Input string is not valid UTF-8\n");
|
||||
|
||||
// OK because UTF-8 has no NUL in multi-byte chars
|
||||
*input += codepointLen;
|
||||
if (output)
|
||||
*output += codepointLen;
|
||||
|
||||
// Warn if this character is not mapped but any others are
|
||||
if (charmap.nodes.size() > 1)
|
||||
|
||||
Reference in New Issue
Block a user