\u5faa\u73af\u961f\u5217（Circular Queue） \u7684\u5b9e\u73b0，\u5faa\u73af\u961f\u5217\u662f\u961f\u5217\u7684\u4e00\u79cd\u4f18\u5316\u5f62\u5f0f，\u7279\u522b\u9002\u5408\u9700\u8981\u9ad8\u6548\u5229\u7528\u7a7a\u95f4\u7684\u573a\u666f\u3002<\/p>\n
\u4ee5\u4e0b\u6211\u5c06\u5bf9\u5faa\u73af\u961f\u5217\u8fdb\u884c\u8be6\u7ec6\u89e3\u6790，\u5305\u62ec\u4e2d\u6587\u89e3\u91ca\u3001\u9002\u7528\u573a\u666f\u3001\u793a\u4f8b\u4ee3\u7801\u3001\u6d4b\u8bd5\u7528\u4f8b，\u5e76\u9488\u5bf9\u534a\u5bfc\u4f53\u4ea7\u7ebf\u6216\u6d4b\u8bd5\u673a\u573a\u666f\u63d0\u4f9b\u5b9a\u5236\u5316\u7684\u4ee3\u7801\u793a\u4f8b\u3002<\/p>\n
\u5faa\u73af\u961f\u5217\u5728\u9879\u76ee（https:\/\/github.com\/aalhour\/C-Sharp-Algorithms）\u4e2d\u4f5c\u4e3a Circular Buffer \u5217\u51fa，\u662f\u961f\u5217\u7684\u4e00\u79cd\u5b9e\u73b0\u65b9\u5f0f\u3002\u5185\u5bb9\u5c06\u57fa\u4e8e C# \u7c7b\u5e93\u9879\u76ee\u7684\u7ed3\u6784，\u7ed3\u5408\u534a\u5bfc\u4f53\u4ea7\u7ebf\u5e94\u7528\u8fdb\u884c\u6269\u5c55，\u786e\u4fdd\u6e05\u6670\u3001\u7b80\u6d01\u4e14\u5168\u9762\u3002<\/p>\n
\u4e00\u3001\u5faa\u73af\u961f\u5217 (Circular Queue) \u8be6\u89e3\u4e2d\u6587\u89e3\u91ca\u5faa\u73af\u961f\u5217\u662f\u4e00\u79cd\u57fa\u4e8e\u6570\u7ec4\u7684\u961f\u5217\u5b9e\u73b0，\u901a\u8fc7\u5c06\u6570\u7ec4\u7684\u9996\u5c3e\u8fde\u63a5\u5f62\u6210\u201c\u73af\u72b6\u201d\u7ed3\u6784，\u907f\u514d\u4e86\u666e\u901a\u6570\u7ec4\u961f\u5217\u7684\u7a7a\u95f4\u6d6a\u8d39\u3002\u666e\u901a\u961f\u5217\u5728\u51fa\u961f（Dequeue）\u540e，\u524d\u7aef\u7a7a\u95f4\u65e0\u6cd5\u91cd\u7528，\u800c\u5faa\u73af\u961f\u5217\u901a\u8fc7\u6a21\u8fd0\u7b97\u4f7f\u7d22\u5f15\u5faa\u73af\u5229\u7528，\u6700\u5927\u5316\u7a7a\u95f4\u6548\u7387\u3002<\/p>\n
\u5faa\u73af\u961f\u5217\u9075\u5faa \u5148\u8fdb\u5148\u51fa（FIFO, First In First Out） \u539f\u5219，\u4e3b\u8981\u64cd\u4f5c\u5305\u62ec：<\/p>\n
\u5faa\u73af\u961f\u5217\u901a\u5e38\u7528\u4e8e\u56fa\u5b9a\u5bb9\u91cf\u6216\u52a8\u6001\u6269\u5c55\u7684\u573a\u666f，\u76f8\u6bd4\u94fe\u8868\u5b9e\u73b0\u7684\u961f\u5217，\u5faa\u73af\u961f\u5217\u5177\u6709\u66f4\u9ad8\u7684\u5185\u5b58\u5c40\u90e8\u6027\u548c\u66f4\u4f4e\u7684\u5185\u5b58\u5f00\u9500\u3002<\/p>\n
\u9002\u7528\u573a\u666f<\/p>\n
\u4e8c\u3001\u793a\u4f8b\u4ee3\u7801\u4ee5\u4e0b\u662f\u5faa\u73af\u961f\u5217\u7684 C# \u5b9e\u73b0，\u57fa\u4e8e\u9879\u76ee\u7684 Circular Buffer \u7ed3\u6784，\u4f7f\u7528\u52a8\u6001\u6570\u7ec4\u652f\u6301\u6269\u5bb9，\u4fdd\u6301\u9ad8\u6548\u7684\u7a7a\u95f4\u5229\u7528：csharp<\/p>\n
\u00a0<\/p>\n
using System;<\/p>\n
public class CircularQueue<T>
\n{
\n private T[] items;
\n private int front; \/\/ \u961f\u5217\u5934\u90e8\u7d22\u5f15
\n private int rear; \/\/ \u961f\u5217\u5c3e\u90e8\u7d22\u5f15
\n private int size;
\n private int capacity;<\/p>\n
public CircularQueue(int initialCapacity)
\n {
\n if (initialCapacity <= 0)
\n throw new ArgumentException("Initial capacity must be positive");
\n capacity = initialCapacity;
\n items = new T[capacity];
\n front = 0;
\n rear = -1;
\n size = 0;
\n }<\/p>\n
public int Count => size;<\/p>\n
public bool IsEmpty => size == 0;<\/p>\n
public bool IsFull => size == capacity;<\/p>\n
public void Enqueue(T item)
\n {
\n if (IsFull)
\n Resize(capacity * 2); \/\/ \u5bb9\u91cf\u7ffb\u500d
\n rear = (rear + 1) % capacity; \/\/ \u5faa\u73af\u7d22\u5f15
\n items[rear] = item;
\n size++;
\n }<\/p>\n
public T Dequeue()
\n {
\n if (IsEmpty)
\n throw new InvalidOperationException("Queue is empty");
\n T item = items[front];
\n items[front] = default; \/\/ \u91ca\u653e\u5f15\u7528
\n front = (front + 1) % capacity; \/\/ \u5faa\u73af\u7d22\u5f15
\n size–;
\n if (size > 0 && size <= capacity \/ 4)
\n Resize(capacity \/ 2); \/\/ \u7f29\u5bb9
\n return item;
\n }<\/p>\n
public T Peek()
\n {
\n if (IsEmpty)
\n throw new InvalidOperationException("Queue is empty");
\n return items[front];
\n }<\/p>\n
private void Resize(int newCapacity)
\n {
\n T[] newItems = new T[newCapacity];
\n for (int i = 0; i < size; i++)
\n newItems[i] = items[(front + i) % capacity];
\n items = newItems;
\n front = 0;
\n rear = size – 1;
\n capacity = newCapacity;
\n }
\n} <\/p>\n
\u4ee3\u7801\u8bf4\u660e<\/p>\n
\u4e09\u3001\u6d4b\u8bd5\u7528\u4f8b\u4ee5\u4e0b\u662f\u4f7f\u7528 MSTest \u6846\u67b6\u7684\u5355\u5143\u6d4b\u8bd5\u4ee3\u7801：csharp<\/p>\n
\u00a0<\/p>\n
using Microsoft.VisualStudio.TestTools.UnitTesting;<\/p>\n
[TestClass]
\npublic class CircularQueueTests
\n{
\n [TestMethod]
\n public void EnqueueAndDequeue_ValidItems_ReturnsCorrectOrder()
\n {
\n \/\/ Arrange
\n var queue = new CircularQueue<int>(3);
\n queue.Enqueue(1);
\n queue.Enqueue(2);
\n queue.Enqueue(3);<\/p>\n
\/\/ Act
\n int item1 = queue.Dequeue();
\n int item2 = queue.Dequeue();
\n int item3 = queue.Dequeue();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(1, item1);
\n Assert.AreEqual(2, item2);
\n Assert.AreEqual(3, item3);
\n Assert.IsTrue(queue.IsEmpty);
\n }<\/p>\n
[TestMethod]
\n public void Peek_ValidQueue_ReturnsFrontItem()
\n {
\n \/\/ Arrange
\n var queue = new CircularQueue<int>(3);
\n queue.Enqueue(1);
\n queue.Enqueue(2);<\/p>\n
\/\/ Act
\n int frontItem = queue.Peek();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(1, frontItem);
\n Assert.AreEqual(2, queue.Count);
\n }<\/p>\n
[TestMethod]
\n [ExpectedException(typeof(InvalidOperationException))]
\n public void Dequeue_EmptyQueue_ThrowsException()
\n {
\n \/\/ Arrange
\n var queue = new CircularQueue<int>(3);<\/p>\n
\/\/ Act
\n queue.Dequeue(); \/\/ \u5e94\u629b\u51fa\u5f02\u5e38
\n }<\/p>\n
[TestMethod]
\n public void Enqueue_FullQueue_TriggersResize()
\n {
\n \/\/ Arrange
\n var queue = new CircularQueue<int>(2);
\n queue.Enqueue(1);
\n queue.Enqueue(2);
\n queue.Enqueue(3); \/\/ \u89e6\u53d1\u6269\u5bb9<\/p>\n
\/\/ Act
\n int count = queue.Count;
\n int frontItem = queue.Peek();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(3, count);
\n Assert.AreEqual(1, frontItem);
\n }<\/p>\n
[TestMethod]
\n public void EnqueueDequeue_CircularBehavior_WorksCorrectly()
\n {
\n \/\/ Arrange
\n var queue = new CircularQueue<int>(3);
\n queue.Enqueue(1);
\n queue.Enqueue(2);
\n queue.Dequeue(); \/\/ \u79fb\u9664 1
\n queue.Enqueue(3); \/\/ \u5e94\u5faa\u73af\u5229\u7528\u7a7a\u95f4<\/p>\n
\/\/ Act
\n int item1 = queue.Dequeue();
\n int item2 = queue.Dequeue();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(2, item1);
\n Assert.AreEqual(3, item2);
\n Assert.IsTrue(queue.IsEmpty);
\n }
\n} <\/p>\n
\u6d4b\u8bd5\u8bf4\u660e<\/p>\n
\u56db\u3001\u534a\u5bfc\u4f53\u4ea7\u7ebf\u793a\u4f8b\u5728\u534a\u5bfc\u4f53\u6d4b\u8bd5\u673a\u4e2d，\u5faa\u73af\u961f\u5217\u53ef\u7528\u4e8e\u7ba1\u7406\u56fa\u5b9a\u5927\u5c0f\u7684\u6676\u5706\u6d4b\u8bd5\u4efb\u52a1\u7f13\u51b2\u533a\u3002\u4f8b\u5982，\u6d4b\u8bd5\u673a\u63a5\u6536\u6676\u5706\u6d4b\u8bd5\u4efb\u52a1，\u7f13\u51b2\u533a\u5bb9\u91cf\u6709\u9650，\u4efb\u52a1\u6309\u5230\u8fbe\u987a\u5e8f\u5904\u7406，\u5faa\u73af\u961f\u5217\u53ef\u9ad8\u6548\u5229\u7528\u7a7a\u95f4\u3002\u793a\u4f8b\u4ee3\u7801csharp<\/p>\n
\u00a0<\/p>\n
public class WaferTestTask
\n{
\n public int WaferId { get; set; }
\n public DateTime SubmissionTime { get; set; }
\n public string TestType { get; set; }<\/p>\n
public WaferTestTask(int waferId, DateTime submissionTime, string testType)
\n {
\n WaferId = waferId;
\n SubmissionTime = submissionTime;
\n TestType = testType;
\n }
\n}<\/p>\n
public class WaferTestBuffer
\n{
\n private CircularQueue<WaferTestTask> taskBuffer;<\/p>\n
public WaferTestBuffer(int capacity)
\n {
\n taskBuffer = new CircularQueue<WaferTestTask>(capacity);
\n }<\/p>\n
public void AddTestTask(int waferId, DateTime submissionTime, string testType)
\n {
\n if (taskBuffer.IsFull)
\n throw new InvalidOperationException("Test buffer is full");
\n taskBuffer.Enqueue(new WaferTestTask(waferId, submissionTime, testType));
\n }<\/p>\n
public WaferTestTask ProcessNextTest()
\n {
\n return taskBuffer.Dequeue();
\n }<\/p>\n
public WaferTestTask PeekNextTest()
\n {
\n return taskBuffer.Peek();
\n }<\/p>\n
public int TaskCount => taskBuffer.Count;<\/p>\n
public bool IsFull => taskBuffer.IsFull;
\n} <\/p>\n
\u6d4b\u8bd5\u7528\u4f8bcsharp<\/p>\n
\u00a0<\/p>\n
[TestMethod]
\npublic void WaferTestBuffer_AddAndProcess_ReturnsCorrectTask()
\n{
\n \/\/ Arrange
\n var buffer = new WaferTestBuffer(2);
\n var time1 = new DateTime(2025, 8, 6, 13, 0, 0);
\n var time2 = new DateTime(2025, 8, 6, 13, 1, 0);
\n buffer.AddTestTask(1001, time1, "VoltageTest");
\n buffer.AddTestTask(1002, time2, "DefectTest");<\/p>\n
\/\/ Act
\n var nextTask = buffer.ProcessNextTest();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(1001, nextTask.WaferId);
\n Assert.AreEqual("VoltageTest", nextTask.TestType);
\n Assert.AreEqual(1, buffer.TaskCount);
\n}<\/p>\n
[TestMethod]
\npublic void WaferTestBuffer_Peek_ReturnsNextTask()
\n{
\n \/\/ Arrange
\n var buffer = new WaferTestBuffer(2);
\n var time = new DateTime(2025, 8, 6, 13, 0, 0);
\n buffer.AddTestTask(1001, time, "VoltageTest");<\/p>\n
\/\/ Act
\n var nextTask = buffer.PeekNextTest();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(1001, nextTask.WaferId);
\n Assert.AreEqual(1, buffer.TaskCount);
\n}<\/p>\n
[TestMethod]
\n[ExpectedException(typeof(InvalidOperationException))]
\npublic void WaferTestBuffer_AddToFull_ThrowsException()
\n{
\n \/\/ Arrange
\n var buffer = new WaferTestBuffer(2);
\n var time = new DateTime(2025, 8, 6, 13, 0, 0);
\n buffer.AddTestTask(1001, time, "VoltageTest");
\n buffer.AddTestTask(1002, time, "DefectTest");
\n buffer.AddTestTask(1003, time, "CurrentTest"); \/\/ \u5e94\u629b\u51fa\u5f02\u5e38
\n} <\/p>\n
\u534a\u5bfc\u4f53\u573a\u666f\u8bf4\u660e<\/p>\n
\u4e94\u3001\u8d34\u7247\u673a\u573a\u666f\u793a\u4f8b\u5728\u8d34\u7247\u673a (SMT) \u4e2d，\u5faa\u73af\u961f\u5217\u53ef\u7528\u4e8e\u7ba1\u7406\u6709\u9650\u7684\u5143\u4ef6\u8d34\u7247\u4efb\u52a1\u7f13\u51b2\u533a\u3002\u4f8b\u5982，\u8d34\u7247\u673a\u6309\u4efb\u52a1\u5230\u8fbe\u987a\u5e8f\u5904\u7406\u5143\u4ef6\u8d34\u7247\u4efb\u52a1，\u5faa\u73af\u961f\u5217\u4f18\u5316\u7f13\u51b2\u533a\u7a7a\u95f4\u5229\u7528\u3002\u793a\u4f8b\u4ee3\u7801csharp<\/p>\n
\u00a0<\/p>\n
public class ComponentPlacementTask
\n{
\n public int ComponentId { get; set; }
\n public double X { get; set; }
\n public double Y { get; set; }
\n public DateTime SubmissionTime { get; set; }<\/p>\n
public ComponentPlacementTask(int componentId, double x, double y, DateTime submissionTime)
\n {
\n ComponentId = componentId;
\n X = x;
\n Y = y;
\n SubmissionTime = submissionTime;
\n }
\n}<\/p>\n
public class SmtPlacementBuffer
\n{
\n private CircularQueue<ComponentPlacementTask> taskBuffer;<\/p>\n
public SmtPlacementBuffer(int capacity)
\n {
\n taskBuffer = new CircularQueue<ComponentPlacementTask>(capacity);
\n }<\/p>\n
public void AddPlacementTask(int componentId, double x, double y, DateTime submissionTime)
\n {
\n if (taskBuffer.IsFull)
\n throw new InvalidOperationException("Placement buffer is full");
\n taskBuffer.Enqueue(new ComponentPlacementTask(componentId, x, y, submissionTime));
\n }<\/p>\n
public ComponentPlacementTask ProcessNextPlacement()
\n {
\n return taskBuffer.Dequeue();
\n }<\/p>\n
public ComponentPlacementTask PeekNextPlacement()
\n {
\n return taskBuffer.Peek();
\n }<\/p>\n
public int TaskCount => taskBuffer.Count;<\/p>\n
public bool IsFull => taskBuffer.IsFull;
\n} <\/p>\n
\u6d4b\u8bd5\u7528\u4f8bcsharp<\/p>\n
\u00a0<\/p>\n
[TestMethod]
\npublic void SmtPlacementBuffer_AddAndProcess_ReturnsCorrectTask()
\n{
\n \/\/ Arrange
\n var buffer = new SmtPlacementBuffer(2);
\n var time = new DateTime(2025, 8, 6, 13, 0, 0);
\n buffer.AddPlacementTask(2001, 10.5, 20.5, time);<\/p>\n
\/\/ Act
\n var nextTask = buffer.ProcessNextPlacement();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(2001, nextTask.ComponentId);
\n Assert.AreEqual(10.5, nextTask.X);
\n Assert.AreEqual(20.5, nextTask.Y);
\n Assert.AreEqual(0, buffer.TaskCount);
\n}<\/p>\n
[TestMethod]
\npublic void SmtPlacementBuffer_CircularBehavior_WorksCorrectly()
\n{
\n \/\/ Arrange
\n var buffer = new SmtPlacementBuffer(2);
\n var time = new DateTime(2025, 8, 6, 13, 0, 0);
\n buffer.AddPlacementTask(2001, 10.5, 20.5, time);
\n buffer.AddPlacementTask(2002, 15.0, 25.0, time);
\n buffer.ProcessNextPlacement(); \/\/ \u79fb\u9664 2001
\n buffer.AddPlacementTask(2003, 12.0, 22.0, time); \/\/ \u5faa\u73af\u5229\u7528\u7a7a\u95f4<\/p>\n
\/\/ Act
\n var nextTask = buffer.ProcessNextPlacement();<\/p>\n
\/\/ Assert
\n Assert.AreEqual(2002, nextTask.ComponentId);
\n Assert.AreEqual(1, buffer.TaskCount);
\n} <\/p>\n
\u8d34\u7247\u673a\u573a\u666f\u8bf4\u660e<\/p>\n
\u516d\u3001\u603b\u7ed3\u4e0e\u6ce8\u610f\u4e8b\u9879<\/p>\n
\u5982\u679c\u60a8\u9700\u8981\u66f4\u8be6\u7ec6\u7684\u5faa\u73af\u961f\u5217\u5b9e\u73b0（\u5982\u7ebf\u7a0b\u5b89\u5168\u7248\u672c\u6216\u57fa\u4e8e\u94fe\u8868\u7684\u53d8\u4f53）\u3001\u5176\u4ed6\u7b97\u6cd5\u6216\u6570\u636e\u7ed3\u6784\u7684\u89e3\u6790，\u6216\u9488\u5bf9\u7279\u5b9a\u534a\u5bfc\u4f53\u8bbe\u5907（\u5982\u6676\u5706\u5207\u5272\u673a）\u7684\u5b9a\u5236\u4ee3\u7801，\u8bf7\u8fdb\u4e00\u6b65\u8bf4\u660e，\u6211\u5c06\u63d0\u4f9b\u66f4\u6df1\u5165\u7684\u793a\u4f8b！<\/p>\n
\u00a0<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u6d4f\u89c8\u9605\u8bfb583\u6b21\uff0c\u70b9\u8d5e5\u6b21\uff0c\u6536\u85cf10\u6b21\u3002\u5982\u679c\u60a8\u9700\u8981\u66f4\u8be6\u7ec6\u7684\u5faa\u73af\u961f\u5217\u5b9e\u73b0\uff08\u5982\u7ebf\u7a0b\u5b89\u5168\u7248\u672c\u6216\u57fa\u4e8e\u94fe\u8868\u7684\u53d8\u4f53\uff09\u3001\u5176\u4ed6\u7b97\u6cd5\u6216\u6570\u636e\u7ed3\u6784\u7684\u89e3\u6790\uff0c\u6216\u9488\u5bf9\u7279\u5b9a\u534a\u5bfc\u4f53\u8bbe\u5907\uff08\u5982\u6676\u5706\u5207\u5272\u673a\uff09\u7684\u5b9a\u5236\u4ee3\u7801\uff0c\u8bf7\u8fdb\u4e00\u6b65\u8bf4\u660e\uff0c\u6211\u5c06\u63d0\u4f9b\u66f4\u6df1\u5165\u7684\u793a\u4f8b\uff01Circular Buffer \u5217\u51fa\uff0c\u662f\u961f\u5217\u7684\u4e00\u79cd\u5b9e\u73b0\u65b9\u5f0f\u3002\u4e8c\u3001\u793a\u4f8b\u4ee3\u7801\u4ee5\u4e0b\u662f\u5faa\u73af\u961f\u5217\u7684 C# \u5b9e\u73b0\uff0c\u57fa\u4e8e\u9879\u76ee\u7684 Circular Buffer \u7ed3\u6784\uff0c\u4f7f\u7528\u52a8\u6001\u6570\u7ec4\u652f\u6301\u6269\u5bb9\uff0c\u4fdd\u6301\u9ad8\u6548\u7684\u7a7a\u95f4\u5229\u7528\uff1acsharp\u3002\u4ee5\u4e0b\u6211\u5c06\u5bf9\u5faa\u73af\u961f\u5217\u8fdb\u884c\u8be6\u7ec6\u89e3\u6790\uff0c\u5305\u62ec\u4e2d\u6587\u89e3\u91ca\u3001\u9002\u7528\u573a\u666f\u3001\u793a\u4f8b\u4ee3\u7801\u3001\u6d4b\u8bd5\u7528\u4f8b\uff0c\u5e76\u9488\u5bf9\u534a\u5bfc\u4f53\u4ea7\u7ebf\u6216\u6d4b\u8bd5\u673a\u573a\u666f\u63d0\u4f9b\u5b9a\u5236\u5316\u7684\u4ee3\u7801\u793a\u4f8b\u3002<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[55],"topic":[],"class_list":["post-55651","post","type-post","status-publish","format-standard","hentry","category-server","tag-c"],"yoast_head":"\n