/
vector.go
133 lines (108 loc) · 2.19 KB
/
vector.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
package vector
import (
"log"
)
const (
VectorBlockSize = 16
)
type (
Vector[T any] struct {
count int32
size int32
array []T
}
)
func assert(x bool, y string) {
if bool(x) == false {
log.Printf("\nFatal :{%s}", y)
}
}
func (v *Vector[T]) shift(pos int32) {
assert(pos <= v.count, "vector shift out of bounds")
if pos == v.size {
v.resize(v.count + 1)
} else {
v.count++
}
for i := v.count - 1; i > pos; i-- {
v.array[i] = v.array[i-1]
}
}
func (v *Vector[T]) resize(count int32) {
blocks := count / VectorBlockSize
if count%VectorBlockSize != 0 {
blocks++
}
v.count = count
v.size = blocks * VectorBlockSize
array := make([]T, v.size+1)
copy(array, v.array)
v.array = array
}
func (v *Vector[T]) incr() {
if v.count == v.size {
v.resize(v.count + 1)
} else {
v.count++
}
}
func (v *Vector[T]) decr() {
assert(v.count > 0, "vector decr count is zero")
v.count--
}
func (v *Vector[T]) PushFront(val T) {
v.shift(0)
v.array[0] = val
}
func (v *Vector[T]) PushBack(val T) {
v.incr()
v.array[v.count-1] = val
}
func (v *Vector[T]) PopFront() {
assert(v.count > 0, "Vector popFront count is zero")
v.Erase(0)
}
func (v *Vector[T]) PopBack() {
assert(v.count > 0, "Vector popBack count is zero")
v.decr()
}
func (v *Vector[T]) WithInRange(index int32) bool {
return index >= 0 && index < v.count
}
func (v *Vector[T]) Erase(pos int32) {
assert(pos < v.count, "Vector erase out of bounds")
if pos < v.count-1 {
copy(v.array[pos:v.count], v.array[pos+1:v.count])
}
v.count--
}
func (v *Vector[T]) Front() T {
assert(v.count > 0, "Vector front count is zero")
return v.array[0]
}
func (v *Vector[T]) Back() T {
assert(v.count > 0, "Vector back count is zero")
return v.array[v.count-1]
}
func (v *Vector[T]) Empty() bool {
return v.count == 0
}
func (v *Vector[T]) Size() int32 {
return v.size
}
func (v *Vector[T]) Count() int32 {
return v.count
}
func (v *Vector[T]) Clear() {
v.count = 0
}
func (v *Vector[T]) Get(pos int32) T {
assert(pos < v.count, "Vector get out of bounds")
return v.array[pos]
}
func (v *Vector[T]) Values() []T {
return v.array[0:v.count]
}
func (v *Vector[T]) Swap(i, j int32) {
v.array[i], v.array[j] = v.array[j], v.array[i]
}