ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-06 23:58:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove pointless #no_bounds_check

Browse Source
This commit is contained in:
Nia
2024-09-29 15:51:30 +03:00
parent 3337d6b264
commit 3c80f15a7a
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/slice/slice.odin
+4 -4
View File
@@ -106,7 +106,7 @@ contains :: proc(array: $T/[]$E, value: E) -> bool where intrinsics.type_is_comp
*/ */
@(require_results) @(require_results)
linear_search :: proc(array: $A/[]$T, key: T) -> (index: int, found: bool) linear_search :: proc(array: $A/[]$T, key: T) -> (index: int, found: bool)
where intrinsics.type_is_comparable(T) #no_bounds_check { where intrinsics.type_is_comparable(T) {
for x, i in array { for x, i in array {
if x == key { if x == key {
return i, true return i, true
@@ -122,7 +122,7 @@ linear_search :: proc(array: $A/[]$T, key: T) -> (index: int, found: bool)
or -1 if it is not present. or -1 if it is not present.
*/ */
@(require_results) @(require_results)
linear_search_proc :: proc(array: $A/[]$T, f: proc(T) -> bool) -> (index: int, found: bool) #no_bounds_check { linear_search_proc :: proc(array: $A/[]$T, f: proc(T) -> bool) -> (index: int, found: bool) {
for x, i in array { for x, i in array {
if f(x) { if f(x) {
return i, true return i, true
@@ -160,7 +160,7 @@ linear_search_proc :: proc(array: $A/[]$T, f: proc(T) -> bool) -> (index: int, f
*/ */
@(require_results) @(require_results)
linear_search_reverse :: proc(array: $A/[]$T, key: T) -> (index: int, found: bool) linear_search_reverse :: proc(array: $A/[]$T, key: T) -> (index: int, found: bool)
where intrinsics.type_is_comparable(T) #no_bounds_check { where intrinsics.type_is_comparable(T) {
#reverse for x, i in array { #reverse for x, i in array {
if x == key { if x == key {
return i, true return i, true
@@ -177,7 +177,7 @@ linear_search_reverse :: proc(array: $A/[]$T, key: T) -> (index: int, found: boo
or -1 if it is not present or -1 if it is not present
*/ */
@(require_results) @(require_results)
linear_search_reverse_proc :: proc(array: $A/[]$T, f: proc(T) -> bool) -> (index: int, found: bool) #no_bounds_check { linear_search_reverse_proc :: proc(array: $A/[]$T, f: proc(T) -> bool) -> (index: int, found: bool) {
#reverse for x, i in array { #reverse for x, i in array {
if f(x) { if f(x) {
return i, true return i, true