HashSet<T>.SymmetricExceptWith(IEnumerable<T>) HashSet<T>.SymmetricExceptWith(IEnumerable<T>) HashSet<T>.SymmetricExceptWith(IEnumerable<T>) HashSet<T>.SymmetricExceptWith(IEnumerable<T>) Method

Définition

Modifie l'objet HashSet<T> actif afin qu'il contienne uniquement les éléments présents dans cet objet ou dans la collection spécifiée, mais pas dans les deux à la fois.Modifies the current HashSet<T> object to contain only elements that are present either in that object or in the specified collection, but not both.

public:
 void SymmetricExceptWith(System::Collections::Generic::IEnumerable<T> ^ other);
[System.Security.SecurityCritical]
public void SymmetricExceptWith (System.Collections.Generic.IEnumerable<T> other);
member this.SymmetricExceptWith : seq<'T> -> unit
Public Sub SymmetricExceptWith (other As IEnumerable(Of T))

Paramètres

other
IEnumerable<T> IEnumerable<T> IEnumerable<T> IEnumerable<T>

Collection à comparer à l'objet HashSet<T> actif.The collection to compare to the current HashSet<T> object.

Implémente

Exceptions

Exemples

L’exemple suivant crée deux HashSet<T> collections avec des jeux de données qui se chevauchent.The following example creates two HashSet<T> collections with overlapping sets of data. L’ensemble qui contient les valeurs inférieures est ensuite modifié, à l' SymmetricExceptWith aide de la méthode, pour contenir uniquement les valeurs qui ne sont pas présentes dans les deux ensembles.The set that contains the lower values is then modified, using the SymmetricExceptWith method, to contain only the values that are not present in both sets.

HashSet<int> lowNumbers = new HashSet<int>();
HashSet<int> highNumbers = new HashSet<int>();

for (int i = 0; i < 6; i++)
{
    lowNumbers.Add(i);
}

for (int i = 3; i < 10; i++)
{
    highNumbers.Add(i);
}

Console.Write("lowNumbers contains {0} elements: ", lowNumbers.Count);
DisplaySet(lowNumbers);

Console.Write("highNumbers contains {0} elements: ", highNumbers.Count);
DisplaySet(highNumbers);

Console.WriteLine("lowNumbers SymmetricExceptWith highNumbers...");
lowNumbers.SymmetricExceptWith(highNumbers);

Console.Write("lowNumbers contains {0} elements: ", lowNumbers.Count);
DisplaySet(lowNumbers);

void DisplaySet(HashSet<int> set)
{
    Console.Write("{");
    foreach (int i in set)
    {
        Console.Write(" {0}", i);
    }
    Console.WriteLine(" }");
}

/* This example provides output similar to the following:
* lowNumbers contains 6 elements: { 0 1 2 3 4 5 }
* highNumbers contains 7 elements: { 3 4 5 6 7 8 9 }
* lowNumbers SymmetricExceptWith highNumbers...
* lowNumbers contains 7 elements: { 0 1 2 8 7 6 9 }
*/
Shared Sub Main()

    Dim lowNumbers As HashSet(Of Integer) = New HashSet(Of Integer)()
    Dim highNumbers As HashSet(Of Integer) = New HashSet(Of Integer)()

    For i As Integer = 0 To 5
        lowNumbers.Add(i)
    Next i

    For i As Integer = 3 To 9
        highNumbers.Add(i)
    Next i

    Console.Write("lowNumbers contains {0} elements: ", lowNumbers.Count)
    DisplaySet(lowNumbers)

    Console.Write("highNumbers contains {0} elements: ", highNumbers.Count)
    DisplaySet(highNumbers)

    Console.WriteLine("lowNumbers SymmetricExceptWith highNumbers...")
    lowNumbers.SymmetricExceptWith(highNumbers)

    Console.Write("lowNumbers contains {0} elements: ", lowNumbers.Count)
    DisplaySet(lowNumbers)
End Sub
' This example produces output similar to the following:
' lowNumbers contains 6 elements: { 0 1 2 3 4 5 }
' highNumbers contains 7 elements: { 3 4 5 6 7 8 9 }
' lowNumbers SymmetricExceptWith highNumbers...
' lowNumbers contains 7 elements: { 0 1 2 8 7 6 9 }

Remarques

Si le other paramètre est une HashSet<T> collection avec le même comparateur d’égalité que HashSet<T> l’objet actuel, cette méthode est unenopération O ().If the other parameter is a HashSet<T> collection with the same equality comparer as the current HashSet<T> object, this method is an O(n) operation. Sinon, cette méthode est une opération On( n m + ), où est le nombre d’éléments dans other et m est Count.Otherwise, this method is an O(n + m) operation, where n is the number of elements in other and m is Count.

S’applique à