ImmutableHashSet<T>.Intersect(IEnumerable<T>) Method
Important
Some information relates to prerelease product that may be substantially modified before it’s released. Microsoft makes no warranties, express or implied, with respect to the information provided here.
Creates an immutable hash set that contains elements that exist in both this set and the specified set.
public:
System::Collections::Immutable::ImmutableHashSet<T> ^ Intersect(System::Collections::Generic::IEnumerable<T> ^ other);C#
public System.Collections.Immutable.ImmutableHashSet<T> Intersect(System.Collections.Generic.IEnumerable<T> other);member this.Intersect : seq<'T> -> System.Collections.Immutable.ImmutableHashSet<'T>Public Function Intersect (other As IEnumerable(Of T)) As ImmutableHashSet(Of T)- other
- IEnumerable<T>
The collection to compare to the current set.
A new immutable set that contains any elements that exist in both sets.
| Product | Versions |
|---|---|
| .NET | Core 1.0, Core 1.1, Core 2.0, Core 2.1, Core 2.2, Core 3.0, Core 3.1, 5, 6, 7, 8 (package-provided), 8, 9 (package-provided), 9, 10 (package-provided), 10 |
| .NET Standard | 2.0 (package-provided) |
| UWP | 10.0 |
Collaborate with us on GitHub
The source for this content can be found on GitHub, where you can also create and review issues and pull requests. For more information, see our contributor guide.
.NET feedback
.NET is an open source project. Select a link to provide feedback: