diff options
| author | Feoramund <161657516+Feoramund@users.noreply.github.com> | 2024-08-05 03:49:29 -0400 |
|---|---|---|
| committer | Feoramund <161657516+Feoramund@users.noreply.github.com> | 2024-08-05 03:49:29 -0400 |
| commit | 8f5b838a071d010959a3f38a2c73cf49f31a16cf (patch) | |
| tree | b8ebccb85254aa79f48ece86c588e0a2c39450bc /core/text/regex/optimizer | |
| parent | 14858309f082e7fccdeb9859422f7ba1f0ee98c8 (diff) | |
Review manual `for` loops in `core:text/regex`
Diffstat (limited to 'core/text/regex/optimizer')
| -rw-r--r-- | core/text/regex/optimizer/optimizer.odin | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/core/text/regex/optimizer/optimizer.odin b/core/text/regex/optimizer/optimizer.odin index 835e5022c..e23cc1bc5 100644 --- a/core/text/regex/optimizer/optimizer.odin +++ b/core/text/regex/optimizer/optimizer.odin @@ -86,7 +86,7 @@ optimize_subtree :: proc(tree: Node, flags: common.Flags) -> (result: Node, chan } // Only recursive optimizations: - for i := 0; i < len(specific.nodes); i += 1 { + #no_bounds_check for i := 0; i < len(specific.nodes); i += 1 { subnode, subnode_changes := optimize_subtree(specific.nodes[i], flags) changes += subnode_changes if subnode == nil { @@ -194,7 +194,7 @@ optimize_subtree :: proc(tree: Node, flags: common.Flags) -> (result: Node, chan new_range.lower = specific.runes[0] new_range.upper = specific.runes[0] - for i := 1; i < len(specific.runes); i += 1 { + #no_bounds_check for i := 1; i < len(specific.runes); i += 1 { r := specific.runes[i] if new_range.lower == -1 { new_range = { r, r } @@ -228,7 +228,7 @@ optimize_subtree :: proc(tree: Node, flags: common.Flags) -> (result: Node, chan // // DO: `[aa-c]` => `[a-c]` for range in specific.ranges { - for i := 0; i < len(specific.runes); i += 1 { + #no_bounds_check for i := 0; i < len(specific.runes); i += 1 { r := specific.runes[i] if range.lower <= r && r <= range.upper { ordered_remove(&specific.runes, i) @@ -244,7 +244,7 @@ optimize_subtree :: proc(tree: Node, flags: common.Flags) -> (result: Node, chan // DO: `[a-cd-e]` => `[a-e]` // DO: `[a-cb-e]` => `[a-e]` slice.sort_by(specific.ranges[:], class_range_sorter) - for i := 0; i < len(specific.ranges) - 1; i += 1 { + #no_bounds_check for i := 0; i < len(specific.ranges) - 1; i += 1 { for j := i + 1; j < len(specific.ranges); j += 1 { left_range := &specific.ranges[i] right_range := specific.ranges[j] |