summaryrefslogtreecommitdiff
path: root/source/core/token-reader.h
diff options
context:
space:
mode:
authorjsmall-nvidia <jsmall@nvidia.com>2019-04-29 17:03:46 -0400
committerTim Foley <tfoleyNV@users.noreply.github.com>2019-04-29 14:03:46 -0700
commit4880789e3003441732cca4471091563f36531635 (patch)
tree8e0d3ed58a561373b35729d24787afe6b39732e3 /source/core/token-reader.h
parentded340beb4b5197b559626acc39920abb2d39e77 (diff)
String/List closer to conventions, and use Index type (#959)
* List made members m_ Tweaked types to closer match conventions. * Use asserts for checking conditions on List. Other small improvements. * List<T>.Count() -> getSize() * List<T> Add -> add First -> getFirst Last -> getLast RemoveLast -> removeLast ReleaseBuffer -> detachBuffer GetArrayView -> getArrayView * List<T>:: AddRange -> addRange Capacity -> getCapacity Insert -> insert InsertRange -> insertRange AddRange -> addRange RemoveRange -> removeRange RemoveAt -> removeAt Remove -> remove Reverse -> reverse FastRemove -> fastRemove FastRemoveAt -> fastRemoveAt Clear -> clear * List<T> FreeBuffer -> _deallocateBuffer Free -> clearAndDeallocate SwapWith -> swapWith * List<T> SetSize -> setSize Reserve -> reserve GrowToSize growToSize * UnsafeShrinkToSize -> unsafeShrinkToSize Compress -> compress FindLast -> findLastIndex FindLast -> findLastIndex Simplify Contains * List<T> Removed m_allocator (wasn't used) Swap -> swapElements Sort -> sort Contains -> contains ForEach -> forEach QuickSort -> quickSort InsertionSort -> insertionSort BinarySearch -> binarySearch Max -> calcMax Min -> calcMin * Initializer::Initialize -> initialize List<T>:: Allocate -> _allocate Init -> _init IndexOf -> indexOf * * Put #include <assert.h> in common.h, and remove unneeded inclusions * Small refactor of ArrayView - remove stride as not used * getSize -> getCount setSize -> setCount unsafeShrinkToSize->unsafeShrinkToCount growToSize -> growToCount m_size -> m_count * Some tidy up around Allocator. * Use Index type on List. * Refactor of IntSet. First tentative look at using Index. * Made Index an Int Did preliminary fixes. Made String use Index. * Partial refactor of String. * String::Buffer -> getBuffer ToWString -> toWString * Small improvements to String. String:: Buffer() -> getBuffer() Equals() -> equals * Try to use Index where appropriate. * Fix warnings on windows x86 builds.
Diffstat (limited to 'source/core/token-reader.h')
-rw-r--r--source/core/token-reader.h20
1 files changed, 10 insertions, 10 deletions
diff --git a/source/core/token-reader.h b/source/core/token-reader.h
index 48391738c..a5b9b3694 100644
--- a/source/core/token-reader.h
+++ b/source/core/token-reader.h
@@ -189,7 +189,7 @@ namespace Slang
}
Token ReadToken()
{
- if (tokenPtr < (int)tokens.Count())
+ if (tokenPtr < (int)tokens.getCount())
{
auto &rs = tokens[tokenPtr];
tokenPtr++;
@@ -199,7 +199,7 @@ namespace Slang
}
Token NextToken(int offset = 0)
{
- if (tokenPtr + offset < (int)tokens.Count())
+ if (tokenPtr + offset < (int)tokens.getCount())
return tokens[tokenPtr + offset];
else
{
@@ -210,7 +210,7 @@ namespace Slang
}
bool LookAhead(String token)
{
- if (tokenPtr < (int)tokens.Count())
+ if (tokenPtr < (int)tokens.getCount())
{
auto next = NextToken();
return next.Content == token;
@@ -222,7 +222,7 @@ namespace Slang
}
bool IsEnd()
{
- return tokenPtr == (int)tokens.Count();
+ return tokenPtr == (int)tokens.getCount();
}
public:
bool IsLegalText()
@@ -235,24 +235,24 @@ namespace Slang
{
List<String> result;
StringBuilder sb;
- for (int i = 0; i < (int)text.Length(); i++)
+ for (Index i = 0; i < text.getLength(); i++)
{
if (text[i] == c)
{
auto str = sb.ToString();
- if (str.Length() != 0)
- result.Add(str);
+ if (str.getLength() != 0)
+ result.add(str);
sb.Clear();
}
else
sb << text[i];
}
auto lastStr = sb.ToString();
- if (lastStr.Length())
- result.Add(lastStr);
+ if (lastStr.getLength())
+ result.add(lastStr);
return result;
}
}
-#endif \ No newline at end of file
+#endif