Known caveats (why this PR is still a draft):
The LC column we receive is const, so we cant' call ReverseIndex::getInsertionPoint as it modifies the index if it's not present.
So I added the const method which throws on such condition.
The problem is, it happens pretty often, and I think there must be another way to do that.

Steps to reproduce:

create table test_lc_array (
 s LowCardinality(String),
 a Array(LowCardinality(String)) default array(s)
) Engine = MergeTree 
PARTITION BY tuple()
ORDER BY tuple();

insert into test_lc_array (s)
select concat('qwertyuiopasdfghjkl', toString(number%10))
from numbers(1000);  

select count() from test_lc_array where has(a, 'qwertyuiopasdfghjkl0');

Resolves #13917

Resolves #10880 ?

Resolves #10880 ?

Yes, the perf tests showed the speedup with right-hand constant arguments.

Probably added regression for queries like:

SELECT * FROM table WHERE has(['a', 'b'], low_cardinality_string_column)

With exception:

Types of array and 2nd argument of function "has" must be identical up to nullability, cardinality, numeric types, or Enum and numeric type. Passed: Array(String) and LowCardinality(String)

Fixed in #16038 ?
@myrrc, could you check?

Probably added regression for queries like:

SELECT * FROM table WHERE has(['a', 'b'], low_cardinality_string_column)