predicate

I have a String as "ishant" and a Set<String> as ["Ishant", "Gaurav", "sdnj"] . I need to write the Predicate for this. I have tried as below code, but it is not working Predicate<Set<String>,String> checkIfCurrencyPresent = (currencyList,currency) -> currencyList.contains(currency); How can I create a Predicate which will take Set<String> and String as a parameter and can give the result? A Predicate<T> which you're currently using represents a predicate (boolean-valued function) of one argument . You're looking for a BiPredicate<T,U> which essentially represents a predicate (boolean-valued

I am building my query using PredicateBuilder from LinqKit. it is great and does exactly what i am looking for. To make my code more reusable (tables and views) i created a generic predicate builder class: public class LocalPredicateBuilder<T> where T : IResort ... var predicate = PredicateBuilder.True<T>( which exposes BuildPredicate method. I can use it like this: var predicate = new LocalPredicateBuilder<Resort>().BuildPredicate(); var resorts = _entities.Resorts.Where(predicate).ToList(); however when i try to do this, i get this runtime error (btw entity objects implement IResort): Unable

I have to simulate family tree in prolog. And i have problem of symetrical predicates. Facts: parent(x,y). male(x). female(y). age(x, number). Rules: blood_relation is giving me headache. this is what i have done: blood_relation(X,Y):-ancestor(X,Y). blood_relation(X,Y):-uncle(X,Y);brother(X,Y);sister(X,Y);(mother(Z,Y),sister(X,Z));(father(Z,Y),sister(X,Z));(father(Z,Y),brother(X,Z)). blood_relation(X,Y):-uncle(X,Z),blood_relation(Z,Y). and I am getting i think satisfactory results(i have double prints - can i fix this), problem is that i want that this relation be symmetrical. It is not now.

Is possible to convert a Predicate<T> to Expression<Func<T, bool>> in some way? I would like to use the next IQueryable function using the filters of the my ICollectionView: public static System.Linq.IQueryable<TSource> Where<TSource>(this System.Linq.IQueryable<TSource> source, System.Linq.Expressions.Expression<System.Func<TSource, bool>> predicate) Thanks In theory it is possible to convert a delegate 'back' to an expression, because you can request the emitted IL of a delegate, which gives you the information you need to transform it back. However, it's for a reason that neither LINQ to

I have the following problem in scala. I have to find the first element in al list which satisfies a predicate function with two conditions in OR. The problem is that I would like to get the element but also know which of the two conditions has been satisfied. Here is a simple example: val l1 = List("A", "B", "AA", "BB") val l2 = List("AA", "BB", "A", "B") def c1(s: String) = s.startsWith("B") def c2(s: String) = s.length == 2 println(l1.find(s => c1(s) || c2(s))) println(l2.find(s => c1(s) || c2(s))) result is: Some(B) Some(AA) For the l1 case I would like to have some return value (a String

This site makes the following claim: http://hyperpolyglot.wikidot.com/lisp#ten-primitives McCarthy introduced the ten primitives of lisp in 1960. All other pure lisp functions (i.e. all functions which don't do I/O or interact with the environment) can be implemented with these primitives. Thus, when implementing or porting lisp, these are the only functions which need to be implemented in a lower language. The way the non-primitives of lisp can be constructed from primitives is analogous to the way theorems can be proven from axioms in mathematics. The primitives are: atom, quote, eq, car,