HashSet<T>.Remove(T) Méthode

Définition

Espace de noms:
System.Collections.Generic
Assemblys:
System.Collections.dll, System.Core.dll, netstandard.dll

Supprime l'élément spécifié d'un objet HashSet<T>.Removes the specified element from a HashSet<T> object.

public:
 virtual bool Remove(T item);
public bool Remove (T item);
abstract member Remove : 'T -> bool
override this.Remove : 'T -> bool
Public Function Remove (item As T) As Boolean

Paramètres

item
T

Élément à supprimer.The element to remove.

Retours

Boolean

true si la recherche et la suppression de l'élément réussissent ; sinon, false.true if the element is successfully found and removed; otherwise, false. Cette méthode retourne false si item est introuvable dans l'objet HashSet<T>.This method returns false if item is not found in the HashSet<T> object.

Implémente

Remove(T)

Exemples

L’exemple suivant montre comment supprimer des valeurs d’une collection HashSet<T> à l’aide de la méthode Remove.The following example demonstrates how to remove values from a HashSet<T> collection using the Remove method. Dans cet exemple, zéro est supprimé arbitrairement de la collection HashSet<T>.In this example, zero is arbitrarily removed from the HashSet<T> collection.

HashSet<int> numbers = new HashSet<int>();

for (int i = 0; i < 20; i++) {
    numbers.Add(i);
}

// Display all the numbers in the hash table.
Console.Write("numbers contains {0} elements: ", numbers.Count);
DisplaySet(numbers);

// Remove all odd numbers.
numbers.RemoveWhere(IsOdd);
Console.Write("numbers contains {0} elements: ", numbers.Count);
DisplaySet(numbers);

// Check if the hash table contains 0 and, if so, remove it.
if (numbers.Contains(0)) {
    numbers.Remove(0);
}
Console.Write("numbers contains {0} elements: ", numbers.Count);
DisplaySet(numbers);

bool IsOdd(int i)
{
    return ((i % 2) == 1);
}

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

    Console.WriteLine(" }");
}

// This example displays the following output:
//    numbers contains 20 elements: { 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 }
//    numbers contains 10 elements: { 0 2 4 6 8 10 12 14 16 18 }
//    numbers contains 9 elements: { 2 4 6 8 10 12 14 16 18 }

Imports System.Collections.Generic

Module Example
    Public Sub Main()
        Dim numbers As New HashSet(Of Integer)()

        For i As Integer = 0 To 19
            numbers.Add(i)
        Next i

        ' Display all the numbers in the hash table.
        Console.Write("numbers contains {0} elements: ", numbers.Count)
        DisplaySet(numbers)

        ' Remove all odd numbers.
        numbers.RemoveWhere(AddressOf IsOdd)
        Console.Write("numbers contains {0} elements: ", numbers.Count)
        DisplaySet(numbers)

        ' Check if the hash table contains 0 and, if so, remove it.
        If numbers.Contains(0) Then
            numbers.Remove(0)
        End If
        Console.Write("numbers contains {0} elements: ", numbers.Count)
        DisplaySet(numbers)
    End Sub

    Private Function IsOdd(ByVal i As Integer) As Boolean
        Return ((i Mod 2) = 1)
    End Function

    Private Sub DisplaySet(ByVal coll As HashSet(Of Integer))
        Console.Write("{")
        For Each i As Integer In coll
            Console.Write(" {0}", i)
        Next
        Console.WriteLine(" }")
    End Sub
End Module
' The example displays the following output:
'    numbers contains 20 elements: { 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 }
'    numbers contains 10 elements: { 0 2 4 6 8 10 12 14 16 18 }
'    numbers contains 9 elements: { 2 4 6 8 10 12 14 16 18 }

Remarques

Si l’objet HashSet<T> ne contient pas l’élément spécifié, l’objet reste inchangé.If the HashSet<T> object does not contain the specified element, the object remains unchanged. Aucune exception n'est levée.No exception is thrown.

Cette méthode est une opération O (1).This method is an O(1) operation.

S’applique à