X-Git-Url: http://Server1/repobrowser/?a=blobdiff_plain;f=source%2Fcommon%2Ftext.cpp;h=d223993cb34bc556b343f2213df0d9369e7511a8;hb=d22dbc7054f255d8df75b273f8f2df625aab5aa2;hp=377377b89825c5a0163b3753ea540e0e3b60bf2d;hpb=8c6ddbc4432ea4d19709599cc1fa58d4effe0ec1;p=xestiacalendar%2F.git diff --git a/source/common/text.cpp b/source/common/text.cpp index 377377b..d223993 100644 --- a/source/common/text.cpp +++ b/source/common/text.cpp @@ -53,6 +53,16 @@ multimap ProcessTextVectors(vector *TextProperties, ProcessResult.insert(make_pair((*TextProperties)[PropertySeekCount], (*TextValues)[PropertySeekCount])); + // Check to continue if one is found. + + if (SearchMultiple == false){ + + // Found one, don't search for anymore. + + break; + + } + } PropertySeekCount++; @@ -64,4 +74,186 @@ multimap ProcessTextVectors(vector *TextProperties, return ProcessResult; +} + +map SplitValues(string InputData){ + + map FinalSplitValues; + map SplitPoints; + map SplitLength; + size_t intPropertyLen = InputData.size(); + int intSplitsFound = 0; + int intSplitSize = 0; + int intSplitSeek = 0; + int intPrevSplitFound = 0; + + // Get the split points. + + for (int i = 0; i <= intPropertyLen; i++){ + + intSplitSize++; + + InputData.substr(intPrevSplitFound, intSplitSize); + + if (InputData.substr(i, 1) == ";" && + InputData.substr((i - 1), 1) != "\\"){ + + if (intSplitsFound > 0){ + + // Split the value into two. + + PropertyNameValue NVData = SplitNameValue(InputData.substr(intPrevSplitFound, (intSplitSize - 1))); + + if (FinalSplitValues.find(NVData.Name) != FinalSplitValues.end()){ + FinalSplitValues.insert(make_pair(NVData.Name, NVData.Value)); + } else { + FinalSplitValues[NVData.Name] = NVData.Value; + } + + } + + intPrevSplitFound = i + 1; + intSplitSize = 0; + intSplitsFound++; + + } + + } + + if (intSplitsFound > 0){ + + PropertyNameValue NVData = SplitNameValue(InputData.substr(intPrevSplitFound, (intSplitSize - 1))); + + if (FinalSplitValues.find(NVData.Name) != FinalSplitValues.end()){ + FinalSplitValues.insert(make_pair(NVData.Name, NVData.Value)); + } else { + FinalSplitValues[NVData.Name] = NVData.Value; + } + + } + + return FinalSplitValues; + +} + +PropertyNameValue SplitNameValue(string InputData){ + + PropertyNameValue FinalNameValue; + int InputDataLength = InputData.size(); + int SeekCount = 0; + bool QuoteMode = false; + bool DataFound = false; + + while (SeekCount < InputDataLength){ + + if (InputData[SeekCount] == '='){ + + FinalNameValue.Name = InputData.substr(0, SeekCount); + + try{ + FinalNameValue.Value = InputData.substr((SeekCount + 1)); + } + + catch (const out_of_range &oor){ + // Do nothing. Have an empty final value. + } + + DataFound = true; + break; + } + + SeekCount++; + + } + + if (DataFound == false){ + + FinalNameValue.Name = InputData; + + } + + // Check if the value has quotes at the start and end. + // Remove them if this is the case. + + if (FinalNameValue.Value.front() == '\"' && + FinalNameValue.Value.back() == '\"'){ + + FinalNameValue.Value.erase(0, 1); + FinalNameValue.Value.erase((FinalNameValue.Value.size() - 1), 1); + + } + + return FinalNameValue; + +} + +bool HexToInt(std::string *HexString, int *Number){ + + // Check that each character in the string is a number + // or a letter (a-f/A-F). + + char Char = 0; + int CharNum = 0; + + for (int CharSeek = 0; + CharSeek < HexString->size(); CharSeek++){ + + // Check if character is a number (0-9). + + Char = HexString->at(CharSeek); + CharNum = Char; + + if (CharNum >= 48 && + CharNum <= 57){ + + continue; + + } + + // Check if character is a letter (A-F) + + if (CharNum >= 65 && + CharNum <= 70){ + + continue; + + } + + // Check if character is a letter (a-f). + + if (CharNum >= 97 && + CharNum <= 102){ + + continue; + + } + + // Exit from subroutine as character is invalid. + + return false; + + } + + // Convert a Hex value that is in string to integer. + + try { + + *Number = stoi((*HexString), nullptr, 16); + + } + + catch (const std::invalid_argument &err){ + + return false; + + } + + catch (const std::out_of_range &err){ + + return false; + + } + + return true; + } \ No newline at end of file