-
Notifications
You must be signed in to change notification settings - Fork 0
/
stage.go
82 lines (66 loc) · 1.64 KB
/
stage.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
package friendlymongo
import (
"fmt"
"go.mongodb.org/mongo-driver/bson"
)
type stage struct {
Priority int8
typ string
filters interface{}
}
func newStage(stageType string, priority int8, filters interface{}) *stage {
return &stage{
Priority: priority,
typ: stageType,
filters: filters,
}
}
func (s *stage) append(filters interface{}) *stage {
switch s.filters.(type) {
case bson.M:
s.filters = mergeBSON(s.filters.(bson.M), filters.(bson.M))
case bson.D:
s.filters = mergeBSOND(s.filters.(bson.D), filters.(bson.D))
case string:
panic(fmt.Errorf("cannot append to a string filter of stage of type %s", s.typ))
}
return s
}
func (s *stage) toBsonD() bson.D {
return bson.D{{
Key: s.typ,
Value: s.filters,
}}
}
// mergeBSOND merges two BSON documents represented as bson.D
func mergeBSOND(d1, d2 bson.D) bson.D {
// Create a map to store unique keys
mergedKeys := make(map[string]struct{})
// Create a new bson.D slice to store merged elements
merged := append(bson.D{}, d1...)
// Iterate over the elements of the second document
for _, e := range d2 {
// Check if the key is already present in the merged document
if _, ok := mergedKeys[e.Key]; !ok {
// If not present, append the element to the merged document
merged = append(merged, e)
mergedKeys[e.Key] = struct{}{}
} else {
// If present, update the value in the merged document
for i, existing := range merged {
if existing.Key == e.Key {
merged[i] = e
break
}
}
}
}
return merged
}
// mergeBSON merges two BSON maps
func mergeBSON(m1, m2 bson.M) bson.M {
for k, v := range m2 {
m1[k] = v
}
return m1
}