ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-05 15:18:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Prefer ..= over ..

Browse Source
This commit is contained in:
gingerBill
2021-08-04 00:36:10 +01:00
parent af6df7d7c9
commit dd8fa1d690
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/odin/tokenizer/tokenizer.odin
+6 -6
View File
@@ -140,7 +140,7 @@ is_letter :: proc(r: rune) -> bool {
switch r { switch r {
case '_': case '_':
return true; return true;
case 'A'..'Z', 'a'..'z': case 'A'..='Z', 'a'..='z':
return true; return true;
} }
} }
@@ -256,11 +256,11 @@ scan_raw_string :: proc(t: ^Tokenizer) -> string {
digit_val :: proc(r: rune) -> int { digit_val :: proc(r: rune) -> int {
switch r { switch r {
case '0'..'9': case '0'..='9':
return int(r-'0'); return int(r-'0');
case 'A'..'F': case 'A'..='F':
return int(r-'A' + 10); return int(r-'A' + 10);
case 'a'..'f': case 'a'..='f':
return int(r-'a' + 10); return int(r-'a' + 10);
} }
return 16; return 16;
@@ -276,7 +276,7 @@ scan_escape :: proc(t: ^Tokenizer) -> bool {
advance_rune(t); advance_rune(t);
return true; return true;
case '0'..'7': case '0'..='7':
n, base, max = 3, 8, 255; n, base, max = 3, 8, 255;
case 'x': case 'x':
advance_rune(t); advance_rune(t);
@@ -485,7 +485,7 @@ scan :: proc(t: ^Tokenizer) -> Token {
kind = .Ident; kind = .Ident;
check_keyword: if len(lit) > 1 { check_keyword: if len(lit) > 1 {
// TODO(bill): Maybe have a hash table lookup rather than this linear search // TODO(bill): Maybe have a hash table lookup rather than this linear search
for i in Token_Kind.B_Keyword_Begin .. Token_Kind.B_Keyword_End { for i in Token_Kind.B_Keyword_Begin ..= Token_Kind.B_Keyword_End {
if lit == tokens[i] { if lit == tokens[i] {
kind = Token_Kind(i); kind = Token_Kind(i);
break check_keyword; break check_keyword;