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
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379  /* ****************************************************************************
*
* Copyright (c) Microsoft Corporation.
*
* This source code is subject to terms and conditions of the Microsoft Public License. A
* copy of the license can be found in the License.html file at the root of this distribution. If
* you cannot locate the Microsoft Public License, please send an email to
* dlr@microsoft.com. By using this source code in any fashion, you are agreeing to be bound
* by the terms of the Microsoft Public License.
*
* You must not remove this notice, or any other, from this software.
*
*
* ***************************************************************************/
using System; using Microsoft;
#if CODEPLEX_40
namespace System.Linq.Expressions {
#else
namespace Microsoft.Linq.Expressions {
#endif
/// <summary>
/// Describes the node types for the nodes of an expression tree.
/// </summary>
public enum ExpressionType {
#region Generated Expression Tree Node Types
// *** BEGIN GENERATED CODE ***
// generated by function: gen_tree_nodes from: generate_tree.py
/// <summary>
/// A node that represents arithmetic addition without overflow checking.
/// </summary>
Add,
/// <summary>
/// A node that represents arithmetic addition with overflow checking.
/// </summary>
AddChecked,
/// <summary>
/// A node that represents a bitwise AND operation.
/// </summary>
And,
/// <summary>
/// A node that represents a shortcircuiting conditional AND operation.
/// </summary>
AndAlso,
/// <summary>
/// A node that represents getting the length of a onedimensional array.
/// </summary>
ArrayLength,
/// <summary>
/// A node that represents indexing into a onedimensional array.
/// </summary>
ArrayIndex,
/// <summary>
/// A node that represents represents a method call.
/// </summary>
Call,
/// <summary>
/// A node that represents a null coalescing operation.
/// </summary>
Coalesce,
/// <summary>
/// A node that represents a conditional operation.
/// </summary>
Conditional,
/// <summary>
/// A node that represents an expression that has a constant value.
/// </summary>
Constant,
/// <summary>
/// A node that represents a cast or conversion operation. If the operation is a numeric conversion, it overflows silently if the converted value does not fit the target type.
/// </summary>
Convert,
/// <summary>
/// A node that represents a cast or conversion operation. If the operation is a numeric conversion, an exception is thrown if the converted value does not fit the target type.
/// </summary>
ConvertChecked,
/// <summary>
/// A node that represents arithmetic division.
/// </summary>
Divide,
/// <summary>
/// A node that represents an equality comparison.
/// </summary>
Equal,
/// <summary>
/// A node that represents a bitwise XOR operation.
/// </summary>
ExclusiveOr,
/// <summary>
/// A node that represents a "greater than" numeric comparison.
/// </summary>
GreaterThan,
/// <summary>
/// A node that represents a "greater than or equal" numeric comparison.
/// </summary>
GreaterThanOrEqual,
/// <summary>
/// A node that represents applying a delegate or lambda expression to a list of argument expressions.
/// </summary>
Invoke,
/// <summary>
/// A node that represents a lambda expression.
/// </summary>
Lambda,
/// <summary>
/// A node that represents a bitwise leftshift operation.
/// </summary>
LeftShift,
/// <summary>
/// A node that represents a "less than" numeric comparison.
/// </summary>
LessThan,
/// <summary>
/// A node that represents a "less than or equal" numeric comparison.
/// </summary>
LessThanOrEqual,
/// <summary>
/// A node that represents creating a new IEnumerable object and initializing it from a list of elements.
/// </summary>
ListInit,
/// <summary>
/// A node that represents reading from a field or property.
/// </summary>
MemberAccess,
/// <summary>
/// A node that represents creating a new object and initializing one or more of its members.
/// </summary>
MemberInit,
/// <summary>
/// A node that represents an arithmetic remainder operation.
/// </summary>
Modulo,
/// <summary>
/// A node that represents arithmetic multiplication without overflow checking.
/// </summary>
Multiply,
/// <summary>
/// A node that represents arithmetic multiplication with overflow checking.
/// </summary>
MultiplyChecked,
/// <summary>
/// A node that represents an arithmetic negation operation.
/// </summary>
Negate,
/// <summary>
/// A node that represents a unary plus operation. The result of a predefined unary plus operation is simply the value of the operand, but userdefined implementations may have nontrivial results.
/// </summary>
UnaryPlus,
/// <summary>
/// A node that represents an arithmetic negation operation that has overflow checking.
/// </summary>
NegateChecked,
/// <summary>
/// A node that represents calling a constructor to create a new object.
/// </summary>
New,
/// <summary>
/// A node that represents creating a new onedimensional array and initializing it from a list of elements.
/// </summary>
NewArrayInit,
/// <summary>
/// A node that represents creating a new array where the bounds for each dimension are specified.
/// </summary>
NewArrayBounds,
/// <summary>
/// A node that represents a bitwise complement operation.
/// </summary>
Not,
/// <summary>
/// A node that represents an inequality comparison.
/// </summary>
NotEqual,
/// <summary>
/// A node that represents a bitwise OR operation.
/// </summary>
Or,
/// <summary>
/// A node that represents a shortcircuiting conditional OR operation.
/// </summary>
OrElse,
/// <summary>
/// A node that represents a reference to a parameter or variable defined in the context of the expression.
/// </summary>
Parameter,
/// <summary>
/// A node that represents raising a number to a power.
/// </summary>
Power,
/// <summary>
/// A node that represents an expression that has a constant value of type Expression. A Quote node can contain references to parameters defined in the context of the expression it represents.
/// </summary>
Quote,
/// <summary>
/// A node that represents a bitwise rightshift operation.
/// </summary>
RightShift,
/// <summary>
/// A node that represents arithmetic subtraction without overflow checking.
/// </summary>
Subtract,
/// <summary>
/// A node that represents arithmetic subtraction with overflow checking.
/// </summary>
SubtractChecked,
/// <summary>
/// A node that represents an explicit reference or boxing conversion where null reference (Nothing in Visual Basic) is supplied if the conversion fails.
/// </summary>
TypeAs,
/// <summary>
/// A node that represents a type test.
/// </summary>
TypeIs,
/// <summary>
/// A node that represents an assignment.
/// </summary>
Assign,
/// <summary>
/// A node that represents a block of expressions.
/// </summary>
Block,
/// <summary>
/// A node that represents a debugging information.
/// </summary>
DebugInfo,
/// <summary>
/// A node that represents a unary decrement.
/// </summary>
Decrement,
/// <summary>
/// A node that represents a dynamic operation.
/// </summary>
Dynamic,
/// <summary>
/// A node that represents a default value.
/// </summary>
Default,
/// <summary>
/// A node that represents an extension expression.
/// </summary>
Extension,
/// <summary>
/// A node that represents a goto.
/// </summary>
Goto,
/// <summary>
/// A node that represents a unary increment.
/// </summary>
Increment,
/// <summary>
/// A node that represents an index operation.
/// </summary>
Index,
/// <summary>
/// A node that represents a label.
/// </summary>
Label,
/// <summary>
/// A node that represents a list of runtime variables.
/// </summary>
RuntimeVariables,
/// <summary>
/// A node that represents a loop.
/// </summary>
Loop,
/// <summary>
/// A node that represents a switch operation.
/// </summary>
Switch,
/// <summary>
/// A node that represents a throwing of an exception.
/// </summary>
Throw,
/// <summary>
/// A node that represents a trycatch expression.
/// </summary>
Try,
/// <summary>
/// A node that represents an unbox value type operation.
/// </summary>
Unbox,
/// <summary>
/// A node that represents an arithmetic addition compound assignment without overflow checking.
/// </summary>
AddAssign,
/// <summary>
/// A node that represents a bitwise AND compound assignment.
/// </summary>
AndAssign,
/// <summary>
/// A node that represents an arithmetic division compound assignment .
/// </summary>
DivideAssign,
/// <summary>
/// A node that represents a bitwise XOR compound assignment.
/// </summary>
ExclusiveOrAssign,
/// <summary>
/// A node that represents a bitwise leftshift compound assignment.
/// </summary>
LeftShiftAssign,
/// <summary>
/// A node that represents an arithmetic remainder compound assignment.
/// </summary>
ModuloAssign,
/// <summary>
/// A node that represents arithmetic multiplication compound assignment without overflow checking.
/// </summary>
MultiplyAssign,
/// <summary>
/// A node that represents a bitwise OR compound assignment.
/// </summary>
OrAssign,
/// <summary>
/// A node that represents raising a number to a power compound assignment.
/// </summary>
PowerAssign,
/// <summary>
/// A node that represents a bitwise rightshift compound assignment.
/// </summary>
RightShiftAssign,
/// <summary>
/// A node that represents arithmetic subtraction compound assignment without overflow checking.
/// </summary>
SubtractAssign,
/// <summary>
/// A node that represents an arithmetic addition compound assignment with overflow checking.
/// </summary>
AddAssignChecked,
/// <summary>
/// A node that represents arithmetic multiplication compound assignment with overflow checking.
/// </summary>
MultiplyAssignChecked,
/// <summary>
/// A node that represents arithmetic subtraction compound assignment with overflow checking.
/// </summary>
SubtractAssignChecked,
/// <summary>
/// A node that represents an unary prefix increment.
/// </summary>
PreIncrementAssign,
/// <summary>
/// A node that represents an unary prefix decrement.
/// </summary>
PreDecrementAssign,
/// <summary>
/// A node that represents an unary postfix increment.
/// </summary>
PostIncrementAssign,
/// <summary>
/// A node that represents an unary postfix decrement.
/// </summary>
PostDecrementAssign,
/// <summary>
/// A node that represents a exact type test.
/// </summary>
TypeEqual,
/// <summary>
/// A node that represents a ones complement.
/// </summary>
OnesComplement,
/// <summary>
/// A node that represents a true condition value.
/// </summary>
IsTrue,
/// <summary>
/// A node that represents a false condition value.
/// </summary>
IsFalse,
// *** END GENERATED CODE ***
#endregion
}
}
