This repository has been archived by the owner on Aug 16, 2022. It is now read-only.
/
util.go
155 lines (148 loc) · 2.99 KB
/
util.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
148
149
150
151
152
153
154
155
package mongodoc
import "go.mongodb.org/mongo-driver/bson"
func convertDToM(i interface{}) interface{} {
if i == nil {
return nil
}
switch i2 := i.(type) {
case bson.D:
return i2.Map()
case bson.A:
a := make([]interface{}, 0, len(i2))
for _, e := range i2 {
a = append(a, convertDToM(e))
}
return a
case []bson.M:
a := make([]interface{}, 0, len(i2))
for _, e := range i2 {
a = append(a, convertDToM(e))
}
return a
case []bson.D:
a := make([]interface{}, 0, len(i2))
for _, e := range i2 {
a = append(a, convertDToM(e))
}
return a
case []bson.A:
a := make([]interface{}, 0, len(i2))
for _, e := range i2 {
a = append(a, convertDToM(e))
}
return a
case []interface{}:
a := make([]interface{}, 0, len(i2))
for _, e := range i2 {
a = append(a, convertDToM(e))
}
return a
}
return i
}
func appendI(f interface{}, elements ...interface{}) interface{} {
switch f2 := f.(type) {
case []bson.D:
res := make([]interface{}, 0, len(f2))
for _, e := range f2 {
res = append(res, e)
}
return append(res, elements...)
case []bson.M:
res := make([]interface{}, 0, len(f2)+len(elements))
for _, e := range f2 {
res = append(res, e)
}
return append(res, elements...)
case bson.A:
res := make([]interface{}, 0, len(f2)+len(elements))
return append(res, append(f2, elements...)...)
case []interface{}:
res := make([]interface{}, 0, len(f2)+len(elements))
return append(res, append(f2, elements...)...)
}
return f
}
func appendE(f interface{}, elements ...bson.E) interface{} {
switch f2 := f.(type) {
case bson.D:
for _, e := range elements {
f2 = append(f2, e)
}
return f2
case bson.M:
f3 := make(bson.M, len(f2))
for k, v := range f2 {
f3[k] = v
}
for _, e := range elements {
f3[e.Key] = e.Value
}
return f3
}
return f
}
func getE(f interface{}, k string) interface{} {
switch g := f.(type) {
case bson.D:
for _, e := range g {
if e.Key == k {
return e.Value
}
}
case bson.M:
return g[k]
}
return nil
}
func And(filter interface{}, key string, f interface{}) interface{} {
if f == nil {
return filter
}
if g, ok := f.(bson.M); ok && g == nil {
return filter
}
if g, ok := f.(bson.D); ok && g == nil {
return filter
}
if g, ok := f.(bson.A); ok && g == nil {
return filter
}
if g, ok := f.([]interface{}); ok && g == nil {
return filter
}
if g, ok := f.([]bson.M); ok && g == nil {
return filter
}
if g, ok := f.([]bson.D); ok && g == nil {
return filter
}
if g, ok := f.([]bson.A); ok && g == nil {
return filter
}
if key != "" && getE(filter, key) != nil {
return filter
}
var g interface{}
if key == "" {
g = f
} else {
g = bson.M{key: f}
}
if getE(filter, "$or") != nil {
return bson.M{
"$and": []interface{}{filter, g},
}
}
if and := getE(filter, "$and"); and != nil {
return bson.M{
"$and": appendI(and, g),
}
}
if key == "" {
return bson.M{
"$and": []interface{}{filter, g},
}
}
return appendE(filter, bson.E{Key: key, Value: f})
}