Add fast path for Overlaps when other is HashSet with same equality comparer and has more items

[Advitalitum]

What do you think about this optimization?

[azure-pipelines]

Azure Pipelines:
Successfully started running 3 pipeline(s).
13 pipeline(s) were filtered out due to trigger conditions.
There may be pipelines that require an authorized user to comment /azp run to run.

[dotnet-policy-service]

Tagging subscribers to this area: @dotnet/area-system-collections
See info in area-owners.md if you want to be subscribed.

[eiriktsarpalis]

@EgorBot -linux_amd -osx_arm64

usingSystem.Collections.Generic;usingSystem.Linq;usingBenchmarkDotNet.Attributes;usingBenchmarkDotNet.Running;BenchmarkSwitcher.FromAssembly(typeof(Benchmarks).Assembly).Run(args);[MemoryDiagnoser]publicclassBenchmarks{privateHashSet<int>_set=null!;privateIEnumerable<int>_largerDisjointHashSet=null!;privateIEnumerable<int>_largerHashSetWithLateMatch=null!;privateIEnumerable<int>_listWithImmediateMatch=null!;privateIEnumerable<int>_largerDisjointList=null!;[GlobalSetup]publicvoidSetup(){_set=newHashSet<int>(Enumerable.Range(0,100));_largerDisjointHashSet=newHashSet<int>(Enumerable.Range(100,10_000));HashSet<int>largerHashSetWithLateMatch=new(Enumerable.Range(100,9_999));largerHashSetWithLateMatch.Add(0);_largerHashSetWithLateMatch=largerHashSetWithLateMatch;_listWithImmediateMatch=newList<int>{0};_largerDisjointList=newList<int>(Enumerable.Range(100,10_000));}[Benchmark]publicboolLargerHashSet_Disjoint()=>_set.Overlaps(_largerDisjointHashSet);[Benchmark]publicboolLargerHashSet_MatchLastInOther()=>_set.Overlaps(_largerHashSetWithLateMatch);[Benchmark]publicboolList_MatchFirst()=>_set.Overlaps(_listWithImmediateMatch);[Benchmark]publicboolLargerList_Disjoint()=>_set.Overlaps(_largerDisjointList);}

Note

This benchmark request was generated with GitHub Copilot.