forked from ulule/loukoum
/
infix.go
60 lines (50 loc) · 1.73 KB
/
infix.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
package stmt
import (
"github.com/ulule/loukoum/types"
)
// InfixExpression is an Expression that has a left and right operand with an operator.
// For example, the expression 'id >= 30' is an infix expression.
type InfixExpression struct {
Left Expression
Operator Operator
Right Expression
}
// NewInfixExpression returns a new InfixExpression instance.
func NewInfixExpression(left Expression, operator Operator, right Expression) InfixExpression {
return InfixExpression{
Left: left,
Operator: operator,
Right: right,
}
}
func (InfixExpression) expression() {}
// Write exposes statement as a SQL query.
func (expression InfixExpression) Write(ctx types.Context) {
if expression.IsEmpty() {
panic("loukoum: expression is undefined")
}
ctx.Write("(")
expression.Left.Write(ctx)
ctx.Write(" ")
expression.Operator.Write(ctx)
ctx.Write(" ")
expression.Right.Write(ctx)
ctx.Write(")")
}
// IsEmpty returns true if statement is undefined.
func (expression InfixExpression) IsEmpty() bool {
return expression.Left == nil || expression.Operator == nil || expression.Right == nil ||
expression.Left.IsEmpty() || expression.Operator.IsEmpty() || expression.Right.IsEmpty()
}
// And creates a new InfixExpression using given Expression.
func (expression InfixExpression) And(value Expression) InfixExpression {
operator := NewAndOperator()
return NewInfixExpression(expression, operator, NewWrapper(value))
}
// Or creates a new InfixExpression using given Expression.
func (expression InfixExpression) Or(value Expression) InfixExpression {
operator := NewOrOperator()
return NewInfixExpression(expression, operator, NewWrapper(value))
}
// Ensure that InfixExpression is an Expression
var _ Expression = InfixExpression{}