Question

I need to create a function that receives a list of strings, and returns a list of all the items that match (i.e., SQL “LIKE”, case-insensitive and ignoring diacritics):

// Pseudocode example
IEnumerable<Item> Search(List<String> patterns)
{
    var result = new List<Item>();

    foreach (var Item in context.Items)
    {
        bool matches = true;

        foreach (var pattern in patterns)
        {
            if (!Item.Name.Contains(pattern))
            {
                matches = false;
                break;
            }
        }

        if (matches)
        {
            result.Add(Item);
        }
    }

    return result;
}

While something similar to this works, it’s less than ideal (it seems horribly inefficient).

Is it possible to create a (possibly LINQ) query that generates something similar to the following SQL?:

SELECT *
FROM items
WHERE items.name LIKE :pattern1
  AND items.name LIKE :pattern2
  ...
  AND items.name LIKE :patternN

Answer 1

You can simply iterate your patterns and apply a WHERE clause for each.

var patterns = new List<string>();
using (var context = new MyDataContext())
{
    var query = (IQueryable<Area>)context.Areas;

    foreach (var pattern in patterns)
    {
        query = query.Where(a => a.Description.Contains(pattern));
    }

    return query.ToList();
}

As you probably know, the query is lazy-executed, and in this case won’t be executed until the ToList call after all patterns are applied.