Avoid O(n) complexity using Any() instead of Count()

We only want to know if IEnumerable has at least one element that is an O(1) operation but you are using Count() that is an O(n) operation. Any() fetchs an iterator and checks if MoveNext() return true:

public static bool Any<TSource>(this IEnumerable<TSource> source)
{
    if (source == null)
    {
        throw Error.ArgumentNull("source");
    }
    using (IEnumerator<TSource> enumerator = source.GetEnumerator())
    {
        if (enumerator.MoveNext())
        {
            return true;
        }
    }
    return false;
}

Imagine that bower returns a huge numbers of packages :)

Regards!