I have a block of code where a piece of the lambda expression is used again and again. How can store this logic so that i can reuse this expression piece?
Eg: lets take
The easiest way is to reuse a single lamda expression, like so:
Expression<Func<User, bool>> KeysMatch =
map => map.User.Key == _users.PublicUser.Key
|| map.User.Key == _users.CurrentUser.Key;
Session.Query<DimensionGroup>()(dimgroup=>(
dimgroup.Users.Where(KeysMatch)
.Where(map => map.AccessLevel.ToAccessLevel() == AccessLevel.Write))
.Count() > 0
));
The next step up is to actually modify expression trees themselves by invoking lambda expressions. This is more complicated, and unless you want to get down and dirty with it is easier with a toolkit. I suggest LinqKit.
You haven't told us if the lambda expressions are being converted to expression-trees or to delegates, but assuming the former, I recommend using PredicateBuilder.
Expression<Map, bool> predicate = map => map.User.Key == _users.PublicUser.Key
|| map.User.Key == _users.CurrentUser.Key;
Then your first query becomes:
var pred1 = predicate.And
(map => map.AccessLevel.ToAccessLevel() == AccessLevel.Write);
var query1 = Session.Query<DimensionGroup>
(dimgroup => dimgroup.Users.Where(pred1).Count() > 0);
And your second:
var pred2 = predicate.And
(map => map.AccessLevel.ToAccessLevel() == AccessLevel.Read);
var query2 = Session.Query<DimensionGroup>
(dimgroup => dimgroup.Users.Where(pred2).Count() > 0);
As you can see, there is scope for factoring out even more commonalities; since the queries appear to only differ by different AccessLevel
s.
Func<Map, bool> func = (map => ((((map.User.Key ==_users.PublicUser.Key || map.User.Key == _users.CurrentUser.Key) && map.AccessLevel.ToAccessLevel() == AccessLevel.Read)).Count() > 0));
EDIT:
you could try something like this.
class MyClass{
Func<Map, bool> func = null;
MyClass()
{
func = (map => ((((map.User.Key ==_users.PublicUser.Key || map.User.Key == _users.CurrentUser.Key) && map.AccessLevel.ToAccessLevel() == AccessLevel.Read)).Count() > 0));
}
...
...
}