forked from legion-zver/go-docx-templates
-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph.go
147 lines (141 loc) · 3.5 KB
/
graph.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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
package graph
import (
"fmt"
"reflect"
"strconv"
)
// Node - элeмент графа
type Node struct {
name string
values map[string]interface{}
nodes []*Node
}
func (n *Node) String() string {
return fmt.Sprintln(n.ListMap())
}
// ListMap - перевод в лист
func (n *Node) ListMap() []map[string]interface{} {
var m = make([]map[string]interface{}, 0)
n.toListMap("", make(map[string]interface{}), &m)
return m
}
func (n *Node) toListMap(name string, current map[string]interface{}, out *[]map[string]interface{}) {
for key, value := range n.values {
if len(n.name) > 0 {
key = n.name + "_" + key
}
if len(name) > 0 {
key = name + "_" + key
}
current[key] = value
}
if len(n.nodes) > 0 {
path := name
if len(n.name) > 0 {
if len(path) > 0 {
path += "_"
}
path += n.name
}
// Проходимся и формируем счетчик
var counter = make(map[string]int)
for _, node := range n.nodes {
nname := path
if len(nname) > 0 {
if len(node.name) > 0 {
nname += "_"
}
}
nname += node.name
if cv, ok := counter[nname+"_length"]; ok {
counter[nname+"_length"] = cv + 1
} else {
counter[nname+"_length"] = 1
}
}
for key, cv := range counter {
current[key] = cv
}
// Формируем строки
for _, node := range n.nodes {
var nw = make(map[string]interface{})
for k, v := range current {
nw[k] = v
}
node.toListMap(path, nw, out)
}
} else {
*out = append(*out, current)
}
}
// FromObject (Node) - разложение объекта на граф
func (n *Node) FromObject(obj interface{}) {
if n.values == nil {
n.values = make(map[string]interface{}, 0)
}
if n.nodes == nil {
n.nodes = make([]*Node, 0)
}
val := reflect.ValueOf(obj)
kind := val.Type().Kind()
if kind == reflect.Ptr || kind == reflect.Interface {
val = val.Elem()
kind = val.Type().Kind()
}
if kind == reflect.Struct {
t := val.Type()
for i := 0; i < t.NumField(); i++ {
field := t.Field(i)
fv := val.FieldByIndex(field.Index)
kind = fv.Type().Kind()
if kind == reflect.Ptr || kind == reflect.Interface {
fv = fv.Elem()
kind = fv.Type().Kind()
}
if kind == reflect.Array || kind == reflect.Slice {
for j := 0; j < fv.Len(); j++ {
node := new(Node)
node.name = field.Name
node.FromObject(fv.Index(j).Interface())
n.nodes = append(n.nodes, node)
}
} else {
n.values[field.Name] = val.FieldByIndex(field.Index).Interface()
}
}
} else if kind == reflect.Map {
for _, key := range val.MapKeys() {
mapItem := val.MapIndex(key)
kind = mapItem.Type().Kind()
if kind == reflect.Ptr || kind == reflect.Interface {
mapItem = mapItem.Elem()
kind = mapItem.Type().Kind()
}
if kind == reflect.Map {
node := new(Node)
node.name = key.String()
node.FromObject(mapItem.Interface())
n.nodes = append(n.nodes, node)
} else if kind == reflect.Array || kind == reflect.Slice {
for j := 0; j < mapItem.Len(); j++ {
node := new(Node)
node.name = key.String()
node.FromObject(mapItem.Index(j).Interface())
n.nodes = append(n.nodes, node)
}
} else {
n.values[key.String()] = mapItem.Interface()
}
}
} else if kind == reflect.Array || kind == reflect.Slice {
for i := 0; i < val.Len(); i++ {
node := new(Node)
node.name = n.name
if len(node.name) > 0 {
node.name += "_" + strconv.FormatInt(int64(i), 10)
}
node.FromObject(val.Index(i).Interface())
n.nodes = append(n.nodes, node)
}
}
}