ArrayList.Remove(Object) Methode
Definition
Wichtig
Einige Informationen beziehen sich auf Vorabversionen, die vor dem Release ggf. grundlegend überarbeitet werden. Microsoft übernimmt hinsichtlich der hier bereitgestellten Informationen keine Gewährleistungen, seien sie ausdrücklich oder konkludent.
Entfernt das erste Vorkommen eines angegebenen Objekts aus der ArrayList.
public:
virtual void Remove(System::Object ^ obj);
public virtual void Remove (object obj);
public virtual void Remove (object? obj);
abstract member Remove : obj -> unit
override this.Remove : obj -> unit
Public Overridable Sub Remove (obj As Object)
Parameter
Implementiert
Ausnahmen
Beispiele
Im folgenden Codebeispiel wird veranschaulicht, wie Elemente aus entfernt werden ArrayList.
using namespace System;
using namespace System::Collections;
void PrintValues( IEnumerable^ myList );
int main()
{
// Creates and initializes a new ArrayList.
ArrayList^ myAL = gcnew ArrayList;
myAL->Add( "The" );
myAL->Add( "quick" );
myAL->Add( "brown" );
myAL->Add( "fox" );
myAL->Add( "jumps" );
myAL->Add( "over" );
myAL->Add( "the" );
myAL->Add( "lazy" );
myAL->Add( "dog" );
// Displays the ArrayList.
Console::WriteLine( "The ArrayList initially contains the following:" );
PrintValues( myAL );
// Removes the element containing "lazy".
myAL->Remove( "lazy" );
// Displays the current state of the ArrayList.
Console::WriteLine( "After removing \"lazy\":" );
PrintValues( myAL );
// Removes the element at index 5.
myAL->RemoveAt( 5 );
// Displays the current state of the ArrayList.
Console::WriteLine( "After removing the element at index 5:" );
PrintValues( myAL );
// Removes three elements starting at index 4.
myAL->RemoveRange( 4, 3 );
// Displays the current state of the ArrayList.
Console::WriteLine( "After removing three elements starting at index 4:" );
PrintValues( myAL );
}
void PrintValues( IEnumerable^ myList )
{
IEnumerator^ myEnum = myList->GetEnumerator();
while ( myEnum->MoveNext() )
{
Object^ obj = safe_cast<Object^>(myEnum->Current);
Console::Write( " {0}", obj );
}
Console::WriteLine();
}
/*
This code produces the following output.
The ArrayList initially contains the following:
The quick brown fox jumps over the lazy dog
After removing "lazy":
The quick brown fox jumps over the dog
After removing the element at index 5:
The quick brown fox jumps the dog
After removing three elements starting at index 4:
The quick brown fox
*/
using System;
using System.Collections;
public class SamplesArrayList {
public static void Main() {
// Creates and initializes a new ArrayList.
ArrayList myAL = new ArrayList();
myAL.Add( "The" );
myAL.Add( "quick" );
myAL.Add( "brown" );
myAL.Add( "fox" );
myAL.Add( "jumps" );
myAL.Add( "over" );
myAL.Add( "the" );
myAL.Add( "lazy" );
myAL.Add( "dog" );
// Displays the ArrayList.
Console.WriteLine( "The ArrayList initially contains the following:" );
PrintValues( myAL );
// Removes the element containing "lazy".
myAL.Remove( "lazy" );
// Displays the current state of the ArrayList.
Console.WriteLine( "After removing \"lazy\":" );
PrintValues( myAL );
// Removes the element at index 5.
myAL.RemoveAt( 5 );
// Displays the current state of the ArrayList.
Console.WriteLine( "After removing the element at index 5:" );
PrintValues( myAL );
// Removes three elements starting at index 4.
myAL.RemoveRange( 4, 3 );
// Displays the current state of the ArrayList.
Console.WriteLine( "After removing three elements starting at index 4:" );
PrintValues( myAL );
}
public static void PrintValues( IEnumerable myList ) {
foreach ( Object obj in myList )
Console.Write( " {0}", obj );
Console.WriteLine();
}
}
/*
This code produces the following output.
The ArrayList initially contains the following:
The quick brown fox jumps over the lazy dog
After removing "lazy":
The quick brown fox jumps over the dog
After removing the element at index 5:
The quick brown fox jumps the dog
After removing three elements starting at index 4:
The quick brown fox
*/
Imports System.Collections
Public Class SamplesArrayList
Public Shared Sub Main()
' Creates and initializes a new ArrayList.
Dim myAL As New ArrayList()
myAL.Add("The")
myAL.Add("quick")
myAL.Add("brown")
myAL.Add("fox")
myAL.Add("jumps")
myAL.Add("over")
myAL.Add("the")
myAL.Add("lazy")
myAL.Add("dog")
' Displays the ArrayList.
Console.WriteLine("The ArrayList initially contains the following:")
PrintValues(myAL)
' Removes the element containing "lazy".
myAL.Remove("lazy")
' Displays the current state of the ArrayList.
Console.WriteLine("After removing ""lazy"":")
PrintValues(myAL)
' Removes the element at index 5.
myAL.RemoveAt(5)
' Displays the current state of the ArrayList.
Console.WriteLine("After removing the element at index 5:")
PrintValues(myAL)
' Removes three elements starting at index 4.
myAL.RemoveRange(4, 3)
' Displays the current state of the ArrayList.
Console.WriteLine("After removing three elements starting at index 4:")
PrintValues(myAL)
End Sub
Public Shared Sub PrintValues(myList As IEnumerable)
Dim obj As [Object]
For Each obj In myList
Console.Write(" {0}", obj)
Next obj
Console.WriteLine()
End Sub
End Class
' This code produces the following output.
'
' The ArrayList initially contains the following:
' The quick brown fox jumps over the lazy dog
' After removing "lazy":
' The quick brown fox jumps over the dog
' After removing the element at index 5:
' The quick brown fox jumps the dog
' After removing three elements starting at index 4:
' The quick brown fox
Hinweise
Wenn das das ArrayList angegebene Objekt nicht enthält, bleibt der ArrayList unverändert. Es wird keine Ausnahme ausgelöst.
Diese Methode führt eine lineare Suche durch. daher ist diese Methode ein O(n)
Vorgang, wobei n
ist Count.
Diese Methode bestimmt die Gleichheit durch Aufrufen Object.Equalsvon .
In Auflistungen mit zusammenhängenden Elementen, beispielsweise Listen, wird die nach dem Entfernen eines Elements entstandene Lücke durch Verschieben aller nachfolgenden Elemente gefüllt. Wenn die Auflistung indiziert ist, werden auch die Indizes der verschobenen Elemente aktualisiert. Dies gilt nicht für Auflistungen, in denen die Elemente konzeptionell in Buckets gruppiert sind, beispielsweise Hashtabellen.