-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstring_array.go
77 lines (60 loc) · 1010 Bytes
/
string_array.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
package asdf
import (
"strings"
)
func NewStringArrayEx(n int) StringArray {
return StringArray{
ss: make([]string, n),
}
}
func NewStringArray(n int) StringArray {
const (
min = 128
max = 1024
)
if n < min {
n = min
} else if n > max {
n = max
}
return NewStringArrayEx(n)
}
type StringArray struct {
ss []string
cur int
}
func (me *StringArray) grow(n int) {
count := len(me.ss)
if count > n {
n += count
} else {
n += n
}
ss := make([]string, n)
copy(ss, me.ss)
me.ss = ss
}
func (me *StringArray) Add(v ...string) {
count := len(v)
// BUGFIX: bug is <
// fuck! fuck!! fuck!!!
if me.cur+count > len(me.ss) {
me.grow(count)
}
for i := 0; i < count; i++ {
me.ss[me.cur+i] = v[i]
// BUGFIX: out of memory
// me.cur++
}
me.cur += count
}
func (me *StringArray) Build(sep string) string {
if me.cur > 0 {
return strings.Join(me.ss[:me.cur], sep)
} else {
return Empty
}
}
func (me *StringArray) String() string {
return me.Build(", ")
}