forked from chuckpreslar/codex
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathselect_manager.go
More file actions
257 lines (213 loc) · 7.02 KB
/
select_manager.go
File metadata and controls
257 lines (213 loc) · 7.02 KB
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
package codex
import (
"fmt"
)
// SelectManager manages a tree that compiles to a SQL select statement.
type SelectManager struct {
Tree *SelectStatementNode // The AST for the SQL SELECT statement.
Adapter adapter // The SQL adapter.
}
var _ Scoper = (*SelectManager)(nil)
func (self *SelectManager) Scopes(scopes ...ScopeFunc) *SelectManager {
for _, scope := range scopes {
scope(self)
}
return self
}
func (self *SelectManager) Scope(expr interface{}, args ...interface{}) {
self.Where(expr, args...)
}
// // Clone returns
// func (m *SelectManager) Clone() *SelectManager{
// newMng := deepcopy.Copy(m)
// return newMng.(*SelectManager)
// }
// Appends a projection to the current Context's Cols slice,
// typically an AttributeNode or string. If a string is provided, it is
// inserted as a LiteralNode.
func (self *SelectManager) Select(cols ...interface{}) *SelectManager {
for _, col := range cols {
if _, ok := col.(string); ok {
col = Column(col)
}
self.Tree.Cols = append(self.Tree.Cols, col)
}
return self
}
// Where Appends an expression to the current Context's Wheres slice,
// typically a comparison, i.e. 1 = 1
//
// Where("a") // no args -> Group(Literal("a"))
// Where("a = ?", 123) // with args -> Group(Literal("a = ?", 123))
// Where("a = ? AND b = ?", 123, true) // with args -> Group(Literal("a = ? AND b = ?", 123, true))
// Where(Equal(Column("a"), Column("b"))) // no args -> Group(Equal(Column("a"), Column("b")))
//
//
func (self *SelectManager) Where(expr interface{}, args ...interface{}) *SelectManager {
if str, ok := expr.(string); ok {
expr = Literal(str, args...)
}
// enclose expr in Grouping - except if expr is already a Grouping
if _, ok := expr.(*GroupingNode); !ok {
expr = Grouping(expr)
}
self.Tree.Wheres = append(self.Tree.Wheres, expr)
return self
}
// Sets the Tree's Offset to the given integer.
func (self *SelectManager) Offset(skip int) *SelectManager {
self.Tree.Offset = Offset(skip)
return self
}
// Sets the Tree's Limit to the given integer.
func (self *SelectManager) Limit(take int) *SelectManager {
self.Tree.Limit = Limit(take)
return self
}
// Appends a new InnerJoin to the current Context's SourceNode.
func (self *SelectManager) InnerJoin(table interface{}) *SelectManager {
switch table.(type) {
case Accessor:
self.Tree.Source.Right = append(self.Tree.Source.Right, InnerJoin(table.(Accessor).Table(), nil))
case *TableNode:
self.Tree.Source.Right = append(self.Tree.Source.Right, InnerJoin(table.(*TableNode), nil))
default:
panic(fmt.Sprintf("code.SelectManager.InnerJoin() type not expected! %#v", table))
}
return self
}
// Appends a new InnerJoin to the current Context's SourceNode.
func (self *SelectManager) OuterJoin(table interface{}) *SelectManager {
switch table.(type) {
case Accessor:
self.Tree.Source.Right = append(self.Tree.Source.Right, OuterJoin(table.(Accessor).Table(), nil))
case *TableNode:
self.Tree.Source.Right = append(self.Tree.Source.Right, OuterJoin(table.(*TableNode), nil))
default:
panic(fmt.Sprintf("code.SelectManager.OuterJoin() type not expected! %#v", table))
}
return self
}
// Sets the last stored Join's Right leaf to a OnNode containing the
// given expression.
func (self *SelectManager) On(expr interface{}) *SelectManager {
joins := self.Tree.Source.Right
if 0 == len(joins) {
return self
}
last := joins[len(joins)-1]
switch last.(type) {
case *InnerJoinNode:
last.(*InnerJoinNode).Right = On(expr)
case *OuterJoinNode:
last.(*OuterJoinNode).Right = On(expr)
}
return self
}
// Appends an expression to the current Context's Orders slice,
// typically an attribute.
func (self *SelectManager) Order(expr interface{}) *SelectManager {
if str, ok := expr.(string); ok {
expr = Literal(str)
}
self.Tree.Orders = append(self.Tree.Orders, expr)
return self
}
// Appends a node to the current Context's Groups slice,
// typically an attribute or column.
func (self *SelectManager) Group(groupings ...interface{}) *SelectManager {
for _, group := range groupings {
if str, ok := group.(string); ok {
group = Literal(str)
}
self.Tree.Groups = append(self.Tree.Groups, group)
}
return self
}
// Sets the Tree's Having member to the given expression.
func (self *SelectManager) Having(expr interface{}) *SelectManager {
if str, ok := expr.(string); ok {
expr = Literal(str)
}
self.Tree.Having = Having(expr)
return self
}
// Count returns a pointer to an new SelectManager, while keeping Wheres, Havings...
func (self *SelectManager) Count(expr interface{}) *SelectManager {
if str, ok := expr.(string); ok {
expr = Column(str)
}
cols := make([]interface{}, 1)
cols[0] = Count(expr)
tree := &SelectStatementNode{
Table: self.Tree.Table,
Source: self.Tree.Source,
Cols: cols,
Wheres: self.Tree.Wheres,
Groups: self.Tree.Groups,
Having: self.Tree.Having,
Orders: make([]interface{}, 0),
Combinator: self.Tree.Combinator,
}
m := &SelectManager{
Tree: tree,
Adapter: self.Adapter,
}
return m
}
// Union sets the SelectManager's Tree's Combination member to a
// UnionNode of itself and the parameter `manager`'s Tree.
func (self *SelectManager) Union(manager *SelectManager) *SelectManager {
self.Tree.Combinator = Union(self.Tree, manager.Tree)
return self
}
// Intersect sets the SelectManager's Tree's Combination member to a
// IntersectNode of itself and the parameter `manager`'s Tree.
func (self *SelectManager) Intersect(manager *SelectManager) *SelectManager {
self.Tree.Combinator = Intersect(self.Tree, manager.Tree)
return self
}
// Except sets the SelectManager's Tree's Combination member to a
// ExceptNode of itself and the parameter `manager`'s Tree.
func (self *SelectManager) Except(manager *SelectManager) *SelectManager {
self.Tree.Combinator = Except(self.Tree, manager.Tree)
return self
}
// Modification returns an *UpdateManager while keeping
// wheres, limit and adapter
func (self *SelectManager) Modification() *UpdateManager {
m := Modification(self.Tree.Table)
m.Tree.Wheres = self.Tree.Wheres
m.Tree.Limit = self.Tree.Limit
m.Adapter = self.Adapter
return m
}
func (self *SelectManager) Insertion() *InsertManager {
m := Insertion(self.Tree.Table)
m.Adapter = self.Adapter
return m
}
func (self *SelectManager) Deletion() *DeleteManager {
m := Deletion(self.Tree.Table)
m.Tree.Wheres = self.Tree.Wheres
m.Tree.Limit = self.Tree.Limit
m.Adapter = self.Adapter
return m
}
// ToSql calls a visitor's Accept method based on the manager's SQL adapter.
func (self *SelectManager) ToSql() (string, []interface{}, error) {
if 0 == len(self.Tree.Cols) {
self.Tree.Cols = append(self.Tree.Cols, Attribute(Star(), self.Tree.Table))
}
return VisitorFor(self.Adapter).Accept(self.Tree)
}
func (self *SelectManager) Table() *TableNode {
return self.Tree.Table
}
// SelectManager factory method.
func Selection(relation *TableNode) (m *SelectManager) {
m = new(SelectManager)
m.Tree = SelectStatement(relation)
m.Adapter = relation.Adapter
return
}