luau-lang/luau
1
0
Fork 0
mirror of https://github.com/luau-lang/luau.git synced 2025-04-10 22:00:54 +01:00
Code Issues Projects Releases Packages Wiki Activity

Use size_t in getDocumentOffsets

Browse source
This commit is contained in:
Hunter Goldstein 2024-11-08 12:32:51 -08:00
parent df67e4d62c
commit 9dc829b584
1 changed files with 8 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
Analysis/src/FragmentAutocomplete.cpp
View file

@ -99,14 +99,14 @@ FragmentAutocompleteAncestryResult findAncestryForFragmentParse(AstStatBlock* ro
* Example - your document is "foo bar baz" and getDocumentOffsets is passed (1, 4) - (1, 8). This function returns the pair {3, 7}, * Example - your document is "foo bar baz" and getDocumentOffsets is passed (1, 4) - (1, 8). This function returns the pair {3, 7},
* which corresponds to the string " bar " * which corresponds to the string " bar "
*/ */
std::pair<unsigned int, unsigned int> getDocumentOffsets(const std::string_view& src, const Position& startPos, const Position& endPos) std::pair<size_t, size_t> getDocumentOffsets(const std::string_view& src, const Position& startPos, const Position& endPos)
{ {
unsigned int lineCount = 0; size_t lineCount = 0;
unsigned int colCount = 0; size_t colCount = 0;
unsigned int docOffset = 0; size_t docOffset = 0;
unsigned int startOffset = 0; size_t startOffset = 0;
unsigned int endOffset = 0; size_t endOffset = 0;
bool foundStart = false; bool foundStart = false;
bool foundEnd = false; bool foundEnd = false;
for (char c : src) for (char c : src)
@ -146,8 +146,8 @@ std::pair<unsigned int, unsigned int> getDocumentOffsets(const std::string_view&
if (foundStart && !foundEnd) if (foundStart && !foundEnd)
endOffset = src.length(); endOffset = src.length();
unsigned int min = std::min(startOffset, endOffset); size_t min = std::min(startOffset, endOffset);
unsigned int len = std::max(startOffset, endOffset) - min; size_t len = std::max(startOffset, endOffset) - min;
return {min, len}; return {min, len};
} }