.net ConcurrentQueue<T>线程安全的Queue

线程安全FIFO队列

最新推荐文章于 2024-12-25 11:30:01 发布

weixin_30613433

最新推荐文章于 2024-12-25 11:30:01 发布

阅读量276

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/sunlyk/p/7427541.html

本文演示了如何使用ConcurrentQueue实现线程安全的先进先出(FIFO)队列，包括Enqueue、TryPeek及TryDequeue方法的用法，并通过多线程并发消费队列元素验证其正确性。

表示线程安全的先进先出 (FIFO) 集合。

using System;
using System.Collections.Concurrent;
using System.Threading;
using System.Threading.Tasks;

class CQ_EnqueueDequeuePeek
{
   // Demonstrates:
   // ConcurrentQueue<T>.Enqueue()
   // ConcurrentQueue<T>.TryPeek()
   // ConcurrentQueue<T>.TryDequeue()
   static void Main ()
   {
      // Construct a ConcurrentQueue.
      ConcurrentQueue<int> cq = new ConcurrentQueue<int>();

      // Populate the queue.
      for (int i = 0; i < 10000; i++) cq.Enqueue(i);

      // Peek at the first element.
      int result;
      if (!cq.TryPeek(out result))
      {
         Console.WriteLine("CQ: TryPeek failed when it should have succeeded");
      }
      else if (result != 0)
      {
         Console.WriteLine("CQ: Expected TryPeek result of 0, got {0}", result);
      }

      int outerSum = 0;
      // An action to consume the ConcurrentQueue.
      Action action = () =>
      {                
         int localSum = 0;
         int localValue;
         while (cq.TryDequeue(out localValue)) localSum += localValue;
         Interlocked.Add(ref outerSum, localSum);
      };

      // Start 4 concurrent consuming actions.
      Parallel.Invoke(action, action, action, action);

      Console.WriteLine("outerSum = {0}, should be 49995000", outerSum);
   }
}