/
slice.go
115 lines (105 loc) · 2.58 KB
/
slice.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
package simple_util
import (
"strings"
)
func Slice2MapArray(slice [][]string) ([]string, []map[string]string) {
var data []map[string]string
var keys []string
for i, row := range slice {
if i == 0 {
keys = row
} else {
var dataHash = make(map[string]string)
for j, cell := range row {
dataHash[keys[j]] = cell
}
data = append(data, dataHash)
}
}
return keys, data
}
func Slice2MapMap(slice [][]string, key string) ([]string, map[string]map[string]string) {
var data = make(map[string]map[string]string)
var keys []string
for i, row := range slice {
if i == 0 {
keys = row
} else {
var dataHash = make(map[string]string)
for j, cell := range row {
dataHash[keys[j]] = cell
}
data[dataHash[key]] = dataHash
}
}
return keys, data
}
func Slice2MapMapMerge(slice [][]string, key, sep string) ([]string, map[string]map[string]string) {
var data = make(map[string]map[string]string)
var keys []string
for i, row := range slice {
if i == 0 {
keys = row
} else {
var dataHash = make(map[string]string)
for j, cell := range row {
dataHash[keys[j]] = cell
}
mainKey := dataHash[key]
if data[mainKey] == nil {
data[mainKey] = dataHash
} else {
for _, subKey := range keys {
data[mainKey][subKey] = data[mainKey][subKey] + sep + dataHash[subKey]
}
}
}
}
return keys, data
}
func Slice2MapMapMergeTrim(slice [][]string, key, sep string) ([]string, map[string]map[string]string) {
var data = make(map[string]map[string]string)
var keys []string
for i, row := range slice {
if i == 0 {
keys = row
} else {
var dataHash = make(map[string]string)
for j, cell := range row {
dataHash[keys[j]] = strings.Split(cell, sep)[0]
}
mainKey := dataHash[key]
if data[mainKey] == nil {
data[mainKey] = dataHash
} else {
for _, subKey := range keys {
data[mainKey][subKey] = data[mainKey][subKey] + sep + dataHash[subKey]
}
}
}
}
return keys, data
}
func Slice2MapMapMergeReplace(slice [][]string, key, sep, replace string) ([]string, map[string]map[string]string) {
var data = make(map[string]map[string]string)
var keys []string
for i, row := range slice {
if i == 0 {
keys = row
} else {
var dataHash = make(map[string]string)
for j, cell := range row {
dataHash[keys[j]] = strings.Replace(cell, sep, replace, -1)
}
mainKey := dataHash[key]
if data[mainKey] == nil {
data[mainKey] = dataHash
} else {
for _, subKey := range keys {
data[mainKey][subKey] = data[mainKey][subKey] + sep + dataHash[subKey]
}
}
}
}
return keys, data
}