forked from nhibernate/nhibernate-core
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathIntermediateHqlTree.cs
299 lines (261 loc) · 8.07 KB
/
IntermediateHqlTree.cs
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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;
using NHibernate.Hql.Ast;
using NHibernate.Hql.Ast.ANTLR;
using NHibernate.Transform;
using NHibernate.Type;
namespace NHibernate.Linq
{
public class IntermediateHqlTree
{
/* NOTE:
* Because common understanding of our users, we are flatting the behavior of Skip and Take methods.
* In RAM a query like primeNumbers.Skip(2).Take(6).Where(x=> x > 10) has a completely different results than primeNumbers.Where(x=> x > 10).Skip(2).Take(6) that has
* different results than primeNumbers.Take(6).Where(x=> x > 10).Skip(2) and so on.
* We are flatting/override even the double-usage of Skip and Take in the same query as: primeNumbers.Skip(2).Where(x=> x > 10).Take(6).Skip(3)
* We ***shouldn't*** change the behavior of the query just because we are translating it in SQL.
*/
private readonly bool _isRoot;
private readonly List<Action<IQuery, IDictionary<string, Tuple<object, IType>>>> _additionalCriteria = new List<Action<IQuery, IDictionary<string, Tuple<object, IType>>>>();
private readonly List<LambdaExpression> _listTransformers = new List<LambdaExpression>();
private readonly List<LambdaExpression> _itemTransformers = new List<LambdaExpression>();
private readonly List<LambdaExpression> _postExecuteTransformers = new List<LambdaExpression>();
private bool _hasDistinctRootOperator;
private HqlExpression _skipCount;
private HqlExpression _takeCount;
private HqlHaving _hqlHaving;
private HqlTreeNode _root;
private HqlOrderBy _orderBy;
private HqlInsert _insertRoot;
public bool IsRoot
{
get
{
return _isRoot;
}
}
public HqlTreeNode Root
{
get
{
//Strange side effects in a property getter...
AddPendingHqlClausesToRoot();
return _root;
}
}
private void AddPendingHqlClausesToRoot()
{
ExecuteAddHavingClause(_hqlHaving);
ExecuteAddOrderBy(_orderBy);
ExecuteAddSkipClause(_skipCount);
ExecuteAddTakeClause(_takeCount);
}
/// <summary>
/// If execute result type does not match expected final result type (implying a post execute transformer
/// will yield expected result type), the intermediate execute type.
/// </summary>
public System.Type ExecuteResultTypeOverride { get; set; }
public HqlTreeBuilder TreeBuilder { get; }
public IntermediateHqlTree(bool root, QueryMode mode)
{
_isRoot = root;
TreeBuilder = new HqlTreeBuilder();
if (mode == QueryMode.Delete)
{
_root = TreeBuilder.Delete(TreeBuilder.From());
}
else if (mode == QueryMode.Update)
{
_root = TreeBuilder.Update(TreeBuilder.From(), TreeBuilder.Set());
}
else if (mode == QueryMode.UpdateVersioned)
{
_root = TreeBuilder.Update(TreeBuilder.Versioned(), TreeBuilder.From(), TreeBuilder.Set());
}
else if (mode == QueryMode.Insert)
{
_root = TreeBuilder.Query(TreeBuilder.SelectFrom(TreeBuilder.From()));
_insertRoot = TreeBuilder.Insert(TreeBuilder.Into(), _root as HqlQuery);
}
else
{
_root = TreeBuilder.Query(TreeBuilder.SelectFrom(TreeBuilder.From()));
}
}
public ExpressionToHqlTranslationResults GetTranslation()
{
AddPendingHqlClausesToRoot();
var translationRoot = _insertRoot ?? _root;
return new ExpressionToHqlTranslationResults(translationRoot,
_itemTransformers,
_listTransformers,
_postExecuteTransformers,
_additionalCriteria,
ExecuteResultTypeOverride);
}
public void AddDistinctRootOperator()
{
if (!_hasDistinctRootOperator)
{
Expression<Func<IEnumerable<object>, IList>> x =
l => DistinctRootEntityResultTransformer.TransformList(l);
_listTransformers.Add(x);
_hasDistinctRootOperator = true;
}
}
public void AddItemTransformer(LambdaExpression transformer)
{
_itemTransformers.Add(transformer);
}
public void AddFromClause(HqlTreeNode from)
{
_root.NodesPreOrder.OfType<HqlFrom>().First().AddChild(from);
}
internal HqlRange GetFromRangeClause()
{
return _root.NodesPreOrder.OfType<HqlFrom>().First().Children.OfType<HqlRange>().FirstOrDefault();
}
public void AddSelectClause(HqlTreeNode select)
{
_root.NodesPreOrder.OfType<HqlSelectFrom>().First().AddChild(select);
}
public void AddFromLastChildClause(params HqlTreeNode[] nodes)
{
var fromChild = _root.NodesPreOrder.OfType<HqlFrom>().First().Children.Last();
foreach (var node in nodes)
{
fromChild.AddChild(node);
}
}
public void AddInsertClause(HqlIdent target, HqlRange columnSpec)
{
var into = _insertRoot.NodesPreOrder.OfType<HqlInto>().Single();
into.AddChild(target);
into.AddChild(columnSpec);
}
public void AddGroupByClause(HqlGroupBy groupBy)
{
_root.AddChild(groupBy);
}
public void AddOrderByClause(HqlExpression orderBy, HqlDirectionStatement direction)
{
if (_orderBy == null)
_orderBy = TreeBuilder.OrderBy();
_orderBy.AddChild(orderBy);
_orderBy.AddChild(direction);
}
public void AddSkipClause(HqlExpression toSkip)
{
_skipCount = toSkip;
}
public void AddTakeClause(HqlExpression toTake)
{
_takeCount = toTake;
}
private void ExecuteAddOrderBy(HqlTreeNode orderBy)
{
if (orderBy == null)
return;
if (_root.NodesPreOrder.All(x => x != orderBy))
_root.AddChild(orderBy);
}
private void ExecuteAddTakeClause(HqlExpression toTake)
{
if (toTake == null)
{
return;
}
var hqlQuery = _root.NodesPreOrder.OfType<HqlQuery>().First();
var takeRoot = hqlQuery.Children.OfType<HqlTake>().FirstOrDefault();
// were present we ignore the new value
if (takeRoot == null)
{
//We should check the value instead delegate the behavior to the result SQL-> MSDN: If count is less than or equal to zero, source is not enumerated and an empty IEnumerable<T> is returned.
takeRoot = TreeBuilder.Take(toTake);
hqlQuery.AddChild(takeRoot);
}
}
private void ExecuteAddSkipClause(HqlExpression toSkip)
{
if (toSkip == null)
{
return;
}
// We should check the value instead delegate the behavior to the result SQL-> MSDN: If count is less than or equal to zero, all elements of source are yielded.
var hqlQuery = _root.NodesPreOrder.OfType<HqlQuery>().First();
var skipRoot = hqlQuery.Children.OfType<HqlSkip>().FirstOrDefault();
if (skipRoot == null)
{
skipRoot = TreeBuilder.Skip(toSkip);
hqlQuery.AddChild(skipRoot);
}
}
private void ExecuteAddHavingClause(HqlHaving hqlHaving)
{
if (hqlHaving == null)
return;
if (!_root.NodesPreOrder.OfType<HqlHaving>().Any())
_root.AddChild(hqlHaving);
}
public void AddWhereClause(HqlBooleanExpression where)
{
var currentWhere = _root.NodesPreOrder.OfType<HqlWhere>().FirstOrDefault();
if (currentWhere == null)
{
currentWhere = TreeBuilder.Where(where);
_root.AddChild(currentWhere);
}
else
{
var currentClause = (HqlBooleanExpression)currentWhere.Children.Single();
currentWhere.ClearChildren();
currentWhere.AddChild(TreeBuilder.BooleanAnd(currentClause, where));
}
}
public void AddHavingClause(HqlBooleanExpression where)
{
if (_hqlHaving == null)
{
_hqlHaving = TreeBuilder.Having(where);
}
else
{
var currentClause = (HqlBooleanExpression)_hqlHaving.Children.Single();
_hqlHaving.ClearChildren();
_hqlHaving.AddChild(TreeBuilder.BooleanAnd(currentClause, where));
}
}
public void AddSet(HqlEquality equality)
{
var currentSet = _root.NodesPreOrder.OfType<HqlSet>().FirstOrDefault();
if (currentSet == null)
{
currentSet = TreeBuilder.Set(equality);
_root.AddChild(currentSet);
}
else
{
currentSet.AddChild(equality);
}
}
public void AddAdditionalCriteria(Action<IQuery, IDictionary<string, Tuple<object, IType>>> criteria)
{
_additionalCriteria.Add(criteria);
}
public void AddPostExecuteTransformer(LambdaExpression lambda)
{
_postExecuteTransformers.Add(lambda);
}
public void AddListTransformer(LambdaExpression lambda)
{
_listTransformers.Add(lambda);
}
public void SetRoot(HqlTreeNode newRoot)
{
_root = newRoot;
}
}
}