gpt4 book ai didi

linq - 打印出 Linq 表达式树层次结构

转载 作者:行者123 更新时间:2023-12-03 22:31:01 25 4
gpt4 key购买 nike

dynamic language runtime (DLR)有一些非常酷的表达式代码,包括一些非常好的代码来打印我想要使用的表达式树,以便:

int a = 1;
int b = 2;
Expression<Func<int, int>> expression = (c) => a + (b * c)
expression.Evaluate(5, stringBuilder)

输出:
(5) => a + (b * c) = 11 Where
a = 1
b * c = 10 Where
b = 2
c = 5

我在网上找到了一些代码来做到这一点,但发现它只有在表达式不带参数时才有效。

http://incrediblejourneysintotheknown.blogspot.com/2009/02/displaying-nested-evaluation-tree-from.html

然后我发现了类似方法的 DLR 实现。然而,DLR 有自己的 Expression 类和许多其他标准 C# 类型的自定义实现,所以我有点困惑。有谁知道我如何实现上述内容?

最佳答案

怎么样:

using System;
using System.Linq;
using System.Linq.Expressions;
using System.Text;
using System.Text.RegularExpressions;

static class Program
{
static void Main()
{
int a = 1, b = 2;
StringBuilder sb = new StringBuilder();
Expression<Func<int, int>> expression = (c) => a + (b * c);
expression.Evaluate(sb, 5);
// now fix the capture class names (from a and b)
string s = sb.ToString();
s = Regex.Replace(s, @"value\([^)]+\)\.", "");
Console.WriteLine(s);
}
public static void Evaluate(this LambdaExpression expr, StringBuilder builder, params object[] args)
{
var parameters = expr.Parameters.ToArray();
if (args == null || parameters.Length != args.Length) throw new ArgumentException("args");
Evaluate(expr.Body, 0, builder, parameters, args);
}
private static StringBuilder Indent(this StringBuilder builder, int depth)
{
for (int i = 0; i < depth; i++) builder.Append(" ");
return builder;
}
private static void Evaluate(this Expression expr, int depth, StringBuilder builder, ParameterExpression[] parameters, object[] args)
{
builder.Indent(depth).Append(expr).Append(" = ").Append(Expression.Lambda(expr, parameters).Compile().DynamicInvoke(args));

UnaryExpression ue;
BinaryExpression be;
ConditionalExpression ce;

if ((ue = expr as UnaryExpression) != null)
{
builder.AppendLine(" where");
Evaluate(ue.Operand, depth + 1, builder, parameters, args);
}
if ((be = expr as BinaryExpression) != null)
{
builder.AppendLine(" where");
Evaluate(be.Left, depth + 1, builder, parameters, args);
Evaluate(be.Right, depth + 1, builder, parameters, args);
}
else if ((ce = expr as ConditionalExpression) != null)
{
builder.AppendLine(" where");
Evaluate(ce.Test, depth + 1, builder, parameters, args);
Evaluate(ce.IfTrue, depth + 1, builder, parameters, args);
Evaluate(ce.IfFalse, depth + 1, builder, parameters, args);
}
else
{
builder.AppendLine();
}
}

}

关于linq - 打印出 Linq 表达式树层次结构,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/697463/

25 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com