forked from shunfei/godruid
-
Notifications
You must be signed in to change notification settings - Fork 0
/
havings.go
73 lines (63 loc) · 1.37 KB
/
havings.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
package godruid
type Having struct {
Type string `json:"type"`
Aggregation string `json:"aggregation,omitempty"`
Value interface{} `json:"value,omitempty"`
HavingSpec *Having `json:"havingSpec,omitempty"`
HavingSpecs []*Having `json:"havingSpecs,omitempty"`
}
func HavingEqualTo(agg string, value interface{}) *Having {
return &Having{
Type: "equalTo",
Aggregation: agg,
Value: value,
}
}
func HavingGreaterThan(agg string, value interface{}) *Having {
return &Having{
Type: "greaterThan",
Aggregation: agg,
Value: value,
}
}
func HavingLessThan(agg string, value interface{}) *Having {
return &Having{
Type: "lessThan",
Aggregation: agg,
Value: value,
}
}
func HavingAnd(havings ...*Having) *Having {
return joinHavings(havings, "and")
}
func HavingOr(havings ...*Having) *Having {
return joinHavings(havings, "or")
}
func HavingNot(having *Having) *Having {
return &Having{
Type: "not",
HavingSpec: having,
}
}
func joinHavings(havings []*Having, connector string) *Having {
// Remove null havings.
p := 0
for _, h := range havings {
if h != nil {
havings[p] = h
p++
}
}
havings = havings[0:p]
fLen := len(havings)
if fLen == 0 {
return nil
}
if fLen == 1 {
return havings[0]
}
return &Having{
Type: connector,
HavingSpecs: havings,
}
}