IList.Insert(Int32, Object) 方法
定义
public:
void Insert(int index, System::Object ^ value);
public void Insert (int index, object value);
abstract member Insert : int * obj -> unit
Public Sub Insert (index As Integer, value As Object)
参数
- index
- Int32
应插入 value
的从零开始的索引。The zero-based index at which value
should be inserted.
异常
示例
下面的示例演示IList接口的实现, 以创建一个固定大小的简单列表。The following example demonstrates the implementation of the IList interface to create a simple list, fixed-size list. 此代码是IList接口的更大示例的一部分。This code is part of a larger example for the IList interface.
class SimpleList : IList
{
private object[] _contents = new object[8];
private int _count;
public SimpleList()
{
_count = 0;
}
// IList Members
public int Add(object value)
{
if (_count < _contents.Length)
{
_contents[_count] = value;
_count++;
return (_count - 1);
}
return -1;
}
public void Clear()
{
_count = 0;
}
public bool Contains(object value)
{
for (int i = 0; i < Count; i++)
{
if (_contents[i] == value)
{
return true;
}
}
return false;
}
public int IndexOf(object value)
{
for (int i = 0; i < Count; i++)
{
if (_contents[i] == value)
{
return i;
}
}
return -1;
}
public void Insert(int index, object value)
{
if ((_count + 1 <= _contents.Length) && (index < Count) && (index >= 0))
{
_count++;
for (int i = Count - 1; i > index; i--)
{
_contents[i] = _contents[i - 1];
}
_contents[index] = value;
}
}
public bool IsFixedSize
{
get
{
return true;
}
}
public bool IsReadOnly
{
get
{
return false;
}
}
public void Remove(object value)
{
RemoveAt(IndexOf(value));
}
public void RemoveAt(int index)
{
if ((index >= 0) && (index < Count))
{
for (int i = index; i < Count - 1; i++)
{
_contents[i] = _contents[i + 1];
}
_count--;
}
}
public object this[int index]
{
get
{
return _contents[index];
}
set
{
_contents[index] = value;
}
}
// ICollection members.
public void CopyTo(Array array, int index)
{
for (int i = 0; i < Count; i++)
{
array.SetValue(_contents[i], index++);
}
}
public int Count
{
get
{
return _count;
}
}
public bool IsSynchronized
{
get
{
return false;
}
}
// Return the current instance since the underlying store is not
// publicly available.
public object SyncRoot
{
get
{
return this;
}
}
// IEnumerable Members
public IEnumerator GetEnumerator()
{
// Refer to the IEnumerator documentation for an example of
// implementing an enumerator.
throw new NotImplementedException("The method or operation is not implemented.");
}
public void PrintContents()
{
Console.WriteLine($"List has a capacity of {_contents.Length} and currently has {_count} elements.");
Console.Write("List contents:");
for (int i = 0; i < Count; i++)
{
Console.Write($" {_contents[i]}");
}
Console.WriteLine();
}
}
Public Class SimpleList
Implements IList
Private _contents(7) As Object
Private _count As Integer
Public Sub New()
_count = 0
End Sub
' IList members.
Public Function Add(ByVal value As Object) As Integer Implements IList.Add
If _count < _contents.Length Then
_contents(_count) = value
_count += 1
Return _count - 1
End If
Return -1
End Function
Public Sub Clear() Implements IList.Clear
_count = 0
End Sub
Public Function Contains(ByVal value As Object) As Boolean Implements IList.Contains
For i As Integer = 0 To Count - 1
If _contents(i) = value Then Return True
Next
Return False
End Function
Public Function IndexOf(ByVal value As Object) As Integer Implements IList.IndexOf
For i As Integer = 0 To Count - 1
If _contents(i) = value Then Return i
Next
Return -1
End Function
Public Sub Insert(ByVal index As Integer, ByVal value As Object) Implements IList.Insert
If _count + 1 <= _contents.Length AndAlso index < Count AndAlso index >= 0 Then
_count += 1
For i As Integer = Count - 1 To index Step -1
_contents(i) = _contents(i - 1)
Next
_contents(index) = value
End If
End Sub
Public ReadOnly Property IsFixedSize() As Boolean Implements IList.IsFixedSize
Get
Return True
End Get
End Property
Public ReadOnly Property IsReadOnly() As Boolean Implements IList.IsReadOnly
Get
Return False
End Get
End Property
Public Sub Remove(ByVal value As Object) Implements IList.Remove
RemoveAt(IndexOf(value))
End Sub
Public Sub RemoveAt(ByVal index As Integer) Implements IList.RemoveAt
if index >= 0 AndAlso index < Count Then
for i As Integer = index To Count - 2
_contents(i) = _contents(i + 1)
Next
_count -= 1
End If
End Sub
Public Property Item(ByVal index As Integer) As Object Implements IList.Item
Get
Return _contents(index)
End Get
Set(ByVal value As Object)
_contents(index) = value
End Set
End Property
' ICollection members.
Public Sub CopyTo(ByVal array As Array, ByVal index As Integer) Implements ICollection.CopyTo
For i As Integer = 0 To Count - 1
array.SetValue(_contents(i), index)
index += 1
Next
End Sub
Public ReadOnly Property Count() As Integer Implements ICollection.Count
Get
Return _count
End Get
End Property
Public ReadOnly Property IsSynchronized() As Boolean Implements ICollection.IsSynchronized
Get
Return False
End Get
End Property
' Return the current instance since the underlying store is not
' publicly available.
Public ReadOnly Property SyncRoot() As Object Implements ICollection.SyncRoot
Get
Return Me
End Get
End Property
' IEnumerable members.
Public Function GetEnumerator() As IEnumerator Implements IEnumerable.GetEnumerator
' Refer to the IEnumerator documentation for an example of
' implementing an enumerator.
Throw New NotImplementedException("The method or operation is not implemented.")
End Function
Public Sub PrintContents()
Console.WriteLine($"List has a capacity of {_contents.Length} and currently has {_count} elements.")
Console.Write("List contents:")
For i As Integer = 0 To Count - 1
Console.Write($" {_contents(i)}")
Next
Console.WriteLine()
End Sub
End Class
注解
如果 index
等于 IList 中的项数,则将 value
追加到末尾。If index
equals the number of items in the IList, then value
is appended to the end.
在由连续的元素组成的集合(如列表)中,插入点下面的元素将下移以容纳新的元素。In collections of contiguous elements, such as lists, the elements that follow the insertion point move down to accommodate the new element. 如果集合具有索引,则移动的元素的索引也将更新。If the collection is indexed, the indexes of the elements that are moved are also updated. 此行为不适用于元素按概念划分为不同存储桶的集合,如哈希表。This behavior does not apply to collections where elements are conceptually grouped into buckets, such as a hash table.