-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello,
I'm writing an Expression Parser to make my API more refactor friendly and less error prone.
basicaly, I want the user to write code like that:
repository.Get(entity => entity.Id == 10);
instead of:
repository.Get<Entity>("Id", 10);
Extracting the member name from the left side…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello, is there any way how to return lambda from another lambda recursively?
All I want to do is finite state machine, implemented as lambda, which returns lambda implementing another state (or null).
nesting Func< won't work as I want.
C#, .NET 3.5
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi All,
I have following query on lambda calculus which am not able to understand:
Here is the lambda calculus representation for the AND operator:
lambda(m).lambda(n).lambda (a).lambda (b). m(n a b) b
Can anyone help me in understanding this representation?
Regards,
darkie
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm trying to implement method Find that searches the database.
I want it to be like that:
var user = User.Find(a => a.LastName == "Brown");
Like it's done in List class. But when I go to List's source code (thanks, Reflector), I see this:
public T Find(Predicate<T> match)
{
if (match…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi All,
I have following query on lambda calculus which am not able to understand:
Here is the lambda calculus representation for the AND operator:
lambda(m).lambda(n).lambda (a).lambda (b). m(n a b) b
Can anyone help me in understanding this representation?
Regards,
darkie
>>> More
