intersectsIterableDeep function
Implementation
bool intersectsIterableDeep(
Iterable? it1,
Iterable? it2, {
ValueEquality? valueEquality,
}) {
if (identical(it1, it2)) return true;
if (it1 == null || it2 == null) return false;
if (it1.isEmpty || it2.isEmpty) return false;
// `it2` is scanned once per `it1` element: a lazy `Iterable` is
// materialized once (a `List`/`Set` is already cheap to re-iterate).
// (`elementAt(i)` on a non-`List` walked from the start every time.)
var all2 = it2 is List || it2 is Set ? it2 : it2.toList(growable: false);
for (var v1 in it1) {
for (var v2 in all2) {
if (isEqualsDeep(v1, v2, valueEquality: valueEquality)) return true;
}
}
return false;
}