11. An expression tree is a data representation of the lambdaexpression in a form that is easy for you to read and reason about the lambdaexpression in.
表达式树是lambda表达式的一种数据表示形式,它能使你更方便地读取和推断lambda表达式。
来自互联网
12. Item 2 is interesting, because it means that you can write a lambdaexpression into an expression tree, reason about it, etc, and then turn it into a callable delegate.
13. Here, the first lambdaexpression is the mapper (mapping each element to its size), and the second lambda expression is the reducer, which takes two sizes and adds them.
14. Function types are indeed the natural way to represent the type of a lambda expression, but unfortunately they interact badly with an existing language "feature" : erasure.
15. Because the lambdaexpression has the right argument and return types, the compiler verifies that it can be converted into a Comparator and generates the appropriate code for doing so.
16. If capture of mutable locals were allowed, the platform would need to extend the local variable's lifetime for as long as the dynamic lifetime of any lambdaexpression that captures it.
17. A lambda function is a function definition that you use to pass higher-order functions into Lisp functions. For example, the lambda expression in Listing 10 computes the sum of two integers.
lambda函数是用于将高阶函数传入lisp函数的函数定义。
来自互联网
18. Expression closures are a shorthand method of defining simple functions that mimics lambda notation.
表达式闭包是定义简单函数的一种便捷方式,用来模仿lambda符号。
来自互联网
19. In general, a lambda function is a function that takes any number of arguments and returns the value of a single expression.
一般来说,lambda函数接收任何数目的参数,并返回单个表达式的值。
来自互联网
20. In general, a lambda function is a function that takes any number of arguments and returns the value of a single expression.