small_array.odin 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. package container_small_array
  2. import "core:builtin"
  3. Small_Array :: struct($N: int, $T: typeid) where N >= 0 {
  4. data: [N]T,
  5. len: int,
  6. }
  7. len :: proc(a: $A/Small_Array) -> int {
  8. return a.len
  9. }
  10. cap :: proc(a: $A/Small_Array) -> int {
  11. return builtin.len(a.data)
  12. }
  13. space :: proc(a: $A/Small_Array) -> int {
  14. return builtin.len(a.data) - a.len
  15. }
  16. slice :: proc(a: ^$A/Small_Array($N, $T)) -> []T {
  17. return a.data[:a.len]
  18. }
  19. get :: proc(a: $A/Small_Array($N, $T), index: int) -> T {
  20. return a.data[index]
  21. }
  22. get_ptr :: proc(a: ^$A/Small_Array($N, $T), index: int) -> ^T {
  23. return &a.data[index]
  24. }
  25. set :: proc(a: ^$A/Small_Array($N, $T), index: int, item: T) {
  26. a.data[index] = item
  27. }
  28. resize :: proc(a: ^$A/Small_Array, length: int) {
  29. a.len = min(length, builtin.len(a.data))
  30. }
  31. push_back :: proc(a: ^$A/Small_Array($N, $T), item: T) -> bool {
  32. if a.len < cap(a^) {
  33. a.data[a.len] = item
  34. a.len += 1
  35. return true
  36. }
  37. return false
  38. }
  39. push_front :: proc(a: ^$A/Small_Array($N, $T), item: T) -> bool {
  40. if a.len < cap(a^) {
  41. a.len += 1
  42. data := slice(a)
  43. copy(data[1:], data[:])
  44. data[0] = item
  45. return true
  46. }
  47. return false
  48. }
  49. pop_back :: proc(a: ^$A/Small_Array($N, $T), loc := #caller_location) -> T {
  50. assert(condition=(N > 0 && a.len > 0), loc=loc)
  51. item := a.data[a.len-1]
  52. a.len -= 1
  53. return item
  54. }
  55. pop_front :: proc(a: ^$A/Small_Array($N, $T), loc := #caller_location) -> T {
  56. assert(condition=(N > 0 && a.len > 0), loc=loc)
  57. item := a.data[0]
  58. s := slice(a)
  59. copy(s[:], s[1:])
  60. a.len -= 1
  61. return item
  62. }
  63. pop_back_safe :: proc(a: ^$A/Small_Array($N, $T)) -> (item: T, ok: bool) {
  64. if N > 0 && a.len > 0 {
  65. item = a.data[a.len-1]
  66. a.len -= 1
  67. ok = true
  68. }
  69. return
  70. }
  71. pop_front_safe :: proc(a: ^$A/Small_Array($N, $T)) -> (item: T, ok: bool) {
  72. if N > 0 && a.len > 0 {
  73. item = a.data[0]
  74. s := slice(a)
  75. copy(s[:], s[1:])
  76. a.len -= 1
  77. ok = true
  78. }
  79. return
  80. }
  81. consume :: proc(a: ^$A/Small_Array($N, $T), count: int, loc := #caller_location) {
  82. assert(condition=a.len >= count, loc=loc)
  83. a.len -= count
  84. }
  85. clear :: proc(a: ^$A/Small_Array($N, $T)) {
  86. resize(a, 0)
  87. }
  88. push_back_elems :: proc(a: ^$A/Small_Array($N, $T), items: ..T) {
  89. n := copy(a.data[a.len:], items[:])
  90. a.len += n
  91. }
  92. append_elem :: push_back
  93. append_elems :: push_back_elems
  94. push :: proc{push_back, push_back_elems}
  95. append :: proc{push_back, push_back_elems}