ImmutableList 和 List 之间的一般性能比较？

Question

我认为ImmutableList 在添加和删除元素方面比List 慢得多。是吗？

基准测试。 ImmutableList add 和 RemoveAt 的性能很好。 RemoveAt 甚至比 List 更快。

    static void Main(string[] args)
    {
        // Generic List Test
        var genericList = new List<int>();

        var sw = Stopwatch.StartNew();
        for (int i = 0; i < 20000; i++)
        {
            genericList.Add(i);
        }
        sw.Stop();
        Console.WriteLine("Add duration for List<T>: " + sw.ElapsedMilliseconds);
        IList<int> completeList = new List<int>(genericList);

        sw.Restart();

        // Remove from 20000 -> 0.
        for (int i = completeList.Count - 1; i >= 0; i--)
        {
            genericList.RemoveAt(0);
        }
        sw.Stop();
        Console.WriteLine("Remove duration for List<T>: " + sw.ElapsedMilliseconds);
        Console.WriteLine("Items after remove for List<T>: " + genericList.Count);


        // ImmutableList Test
        var immutableList = ImmutableList<int>.Empty;

        sw.Restart();
        for (int i = 0; i < 20000; i++)
        {
            immutableList = immutableList.Add(i);
        }
        sw.Stop();
        Console.WriteLine("Add duration for ImmutableList<T>: " + sw.ElapsedMilliseconds);

        sw.Restart();

        // Remove from 20000 -> 0.
        for (int i = completeList.Count - 1; i >= 0; i--)
        {
            immutableList = immutableList.RemoveAt(0);
        }
        sw.Stop();
        Console.WriteLine("Remove duration for ImmutableList<T>: " + sw.ElapsedMilliseconds);
        Console.WriteLine("Items after remove for ImmutableList<T>: " + immutableList.Count);
    }

结果

Add duration for List<T>: 0
Remove duration for List<T>: 37
Items after remove for List<T>: 0
Add duration for ImmutableList<T>: 22
Remove duration for ImmutableList<T>: 14
Items after remove for ImmutableList<T>: 0

Answer 1

来自MSDN

When you add or remove items from an immutable list, a copy of the original list is made with the items added or removed, and the original list is unchanged.

因为要复制，所以会比较慢

Answer 2

老实说，不变性意味着缺乏性能是一个神话。

我希望许多操作使用不可变列表会更快。

不可变列表的实现使用二叉搜索树，与数组相比，它在搜索、插入和删除方面具有良好的性能特征。将这些因素复制到游戏中仍然存在开销。因此，会有一个转折点，其中一个人会比另一个人表现更好。

我机器的删除结果（Immutable/Regular）毫秒

     Deletes  100       1000      10000     100000
Count         
 1000         4/0       na        na        na
10000         4/0       5/1       na        na  
  1e5         4/2       5/23      22/215    na  
  1e6         7/44      8/431     37/4676   118/44081 
  1e7         8/718     7/7363    36/77638  110/x*
  1e8         8/7594    9/76200   31/781349 113/x* 

* I didn't have the patience to finish benchmarking here.

ImmutableList 和 List 之间的一般性能比较？

General performance comparison between ImmutableList and List?

c#

list

immutability