forked from glennliao/apijson-go
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnode_struct.go
More file actions
executable file
·165 lines (126 loc) · 3.24 KB
/
node_struct.go
File metadata and controls
executable file
·165 lines (126 loc) · 3.24 KB
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
package query
import (
"path/filepath"
"strings"
"github.com/glennliao/apijson-go/consts"
"github.com/glennliao/apijson-go/model"
)
type structNode struct {
node *Node
}
func newStructNode(n *Node) *structNode {
return &structNode{node: n}
}
func (h *structNode) parse() {
n := h.node
for _, childNode := range n.children {
childNode.parse()
}
if n.isList { // []节点
hasPrimary := false // 是否存在主查询表
for _, child := range n.children {
if child.err != nil {
n.err = child.err
return
}
if child.primaryTableKey != "" {
if hasPrimary {
n.err = consts.NewValidReqErr("node must only one primary table: " + n.Path)
return
}
hasPrimary = true
n.primaryTableKey = filepath.Base(child.Key)
child.page = n.page
}
}
if n.Key == consts.ListKeySuffix && !hasPrimary {
n.err = consts.NewValidReqErr("node must have primary table: " + n.Path)
return
}
}
}
func (h *structNode) fetch() {
n := h.node
// 目前结构节点组装数据在result, 如果被依赖的是组装后的, 则无法查询。 如遇到此情况再看
if n.isList && n.needTotal {
n.total = n.children[n.primaryTableKey].total
}
}
func (h *structNode) result() {
n := h.node
if n.isList {
var retList []model.Map
var primaryList []model.Map
if n.children[n.primaryTableKey].ret != nil {
primaryList = n.children[n.primaryTableKey].ret.([]model.Map)
for i := 0; i < len(primaryList); i++ {
pItem := primaryList[i]
item := model.Map{
n.primaryTableKey: pItem,
}
// 遍历组装数据, 后续考虑使用别的方案优化 (暂未简单使用map的id->item ,主要考虑多字段问题)
for childK, childNode := range n.children {
if childNode.primaryTableKey == "" {
if childNode.ret != nil {
var resultList []model.Map
for _, depRetItem := range childNode.ret.([]model.Map) {
match := true
for refK, refNode := range childNode.refKeyMap {
if pItem[refNode.column] != depRetItem[refK] {
match = false
break
}
}
if match {
resultList = append(resultList, depRetItem)
}
}
if len(resultList) > 0 {
if strings.HasSuffix(childK, consts.ListKeySuffix) {
item[childK] = resultList
} else {
item[childK] = resultList[0]
}
}
}
}
}
retList = append(retList, item)
}
}
n.ret = retList
if len(n.ret.([]model.Map)) == 0 {
n.ret = []model.Map{}
}
} else {
retMap := model.Map{}
for k, node := range n.children {
var err error
if strings.HasSuffix(k, consts.RefKeySuffix) {
k = k[0 : len(k)-1]
}
if strings.HasSuffix(k, consts.FunctionsKeySuffix) {
k = k[0 : len(k)-2]
}
// 增加alias 用来重命名返回的key，避免前端调整取值
if node.req[consts.Alias] != nil {
k = node.req[consts.Alias].(string)
}
retMap[k], err = node.Result()
if node.Type == NodeTypeFunc && retMap[k] == nil {
delete(retMap, k)
}
if err != nil {
n.err = err
}
}
if len(retMap) > 0 && n.simpleReqVal == "" {
n.ret = retMap
} else {
n.ret = n.simpleReqVal
}
}
}
func (h *structNode) nodeType() int {
return NodeTypeStruct
}