aboutsummaryrefslogtreecommitdiff
path: root/core/container
diff options
context:
space:
mode:
authorgingerBill <bill@gingerbill.org>2024-06-29 19:50:51 +0100
committergingerBill <bill@gingerbill.org>2024-06-29 19:50:51 +0100
commite296d6fb902083fac534bdd4c804e6dbad2fc458 (patch)
tree18e0875791d202dc4dde1d148c0786494e2b2b14 /core/container
parent90244a0849afe9f17e011dc8c3bae571c9f5bb26 (diff)
Fix loads of indentation issues with mixing spaces and tabs
Diffstat (limited to 'core/container')
-rw-r--r--core/container/small_array/small_array.odin8
-rw-r--r--core/container/topological_sort/topological_sort.odin2
2 files changed, 5 insertions, 5 deletions
diff --git a/core/container/small_array/small_array.odin b/core/container/small_array/small_array.odin
index ecec7b80c..b2068469d 100644
--- a/core/container/small_array/small_array.odin
+++ b/core/container/small_array/small_array.odin
@@ -119,20 +119,20 @@ consume :: proc "odin" (a: ^$A/Small_Array($N, $T), count: int, loc := #caller_l
}
ordered_remove :: proc "contextless" (a: ^$A/Small_Array($N, $T), index: int, loc := #caller_location) #no_bounds_check {
- runtime.bounds_check_error_loc(loc, index, a.len)
- if index+1 < a.len {
+ runtime.bounds_check_error_loc(loc, index, a.len)
+ if index+1 < a.len {
copy(a.data[index:], a.data[index+1:])
}
a.len -= 1
}
unordered_remove :: proc "contextless" (a: ^$A/Small_Array($N, $T), index: int, loc := #caller_location) #no_bounds_check {
- runtime.bounds_check_error_loc(loc, index, a.len)
+ runtime.bounds_check_error_loc(loc, index, a.len)
n := a.len-1
if index != n {
a.data[index] = a.data[n]
}
- a.len -= 1
+ a.len -= 1
}
clear :: proc "contextless" (a: ^$A/Small_Array($N, $T)) {
diff --git a/core/container/topological_sort/topological_sort.odin b/core/container/topological_sort/topological_sort.odin
index 0d34e8d02..10765958e 100644
--- a/core/container/topological_sort/topological_sort.odin
+++ b/core/container/topological_sort/topological_sort.odin
@@ -61,7 +61,7 @@ add_dependency :: proc(sorter: ^$S/Sorter($K), key, dependency: K) -> bool {
}
find.dependents[key] = true
- find = &sorter.relations[key]
+ find = &sorter.relations[key]
if find == nil {
find = map_insert(&sorter.relations, key, make_relations(sorter))
}