-
Notifications
You must be signed in to change notification settings - Fork 0
/
After.go
54 lines (45 loc) · 1.61 KB
/
After.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
// =================================================================
//
// Copyright (C) 2019 Spatial Current, Inc. - All Rights Reserved
// Released as open source under the MIT License. See LICENSE file.
//
// =================================================================
package dfl
// After is a TemporalBinaryOperator evaluating to true if the left value is after the right value.
// The left and right values must be string, time.Time, or *time.Time.
type After struct {
*TemporalBinaryOperator // Extends the TemporalBinaryOperator struct
}
func (a After) Dfl(quotes []string, pretty bool, tabs int) string {
return a.BinaryOperator.Dfl("after", quotes, pretty, tabs)
}
// Sql returns the SQL representation of this node as a string
func (a After) Sql(pretty bool, tabs int) string {
return a.BinaryOperator.Sql(">", pretty, tabs)
}
func (a After) Map() map[string]interface{} {
return a.BinaryOperator.Map("after", a.Left, a.Right)
}
func (a After) Compile() Node {
left := a.Left.Compile()
right := a.Right.Compile()
switch left.(type) {
case Literal:
switch right.(type) {
case Literal:
v, err := CompareTimes(left.(Literal).Value, right.(Literal).Value)
if err != nil {
panic(err)
}
return Literal{Value: (v > 0)}
}
}
return After{&TemporalBinaryOperator{&BinaryOperator{Left: left, Right: right}}}
}
func (a After) Evaluate(vars map[string]interface{}, ctx interface{}, funcs FunctionMap, quotes []string) (map[string]interface{}, interface{}, error) {
vars, v, err := a.EvaluateAndCompare(vars, ctx, funcs, quotes)
if err != nil {
return vars, false, err
}
return vars, v > 0, nil
}