相比儲存預設型別的迴圈佇列，首先我們需要自定義儲存的類。

自定義顧客類（Customer.h）

#pragma once
#include<string>
using namespace std;

class Customer
{
public:
    Customer(string name="", int age=0);
    void printInfo() const;
private:
    string m_strName;
    int m_iAge;
};

佇列標頭檔案（MyQueue.h）

#pragma 
#include "Customer.h"
 

class MyQueue
{
public:
    MyQueue(int queueCapacity);//InitQueue(&Q)  建立佇列
    virtual ~MyQueue();   //DestroyQueue(&Q)銷燬佇列
    void ClearQueue();    //ClearQueue(&Q)清空佇列
    bool QueueEmpty() const;  //QueueEmpty(Q) 判空
    bool QueueFull() const;    //判斷隊滿操作
    int QueueLength() const;   //QueueLength(Q)佇列長度
 

    bool EnQueue(Customer element);  //插入元素為自定義型別
    bool DeQueue(Customer &element); //刪除元素為自定義型別
    void QueueTraverse();    //QueueTraverse(Q,visit())遍歷佇列

private:
    Customer *m_pQueue;
    int m_iQueueLen;   //佇列元素個數
    int m_iQueueCapacity;  //佇列陣列容量
    int m_iHead;  //對頭
    int m_Tail;  //對尾

};
 

佇列的實現檔案（MyQueue.cpp）

#include<iostream>
#include"Queue.h"
#include"Customer.h"
using namespace std;

MyQueue::MyQueue(int queueCapacity)
{
    m_pQueue = new Customer[queueCapacity];
    m_iQueueCapacity = queueCapacity;
    ClearQueue();
}
MyQueue::~MyQueue()
{
    delete[] m_pQueue;
    m_pQueue = NULL;
}
void MyQueue::ClearQueue()
{
    m_iQueueLen = 0;
    m_iHead = 0;
    m_Tail = 0;
}
bool MyQueue::QueueEmpty() const
{
    return (m_iQueueLen == 0 ? true : false);
}
bool MyQueue::QueueFull() const
{
    return m_iQueueCapacity == m_iQueueLen ? true : false;
}
int MyQueue::QueueLength() const
{
    return m_iQueueLen;
}

bool MyQueue::EnQueue(Customer element)
{
    if (QueueFull())
    {
        return false;
    }
    else
    {
        m_pQueue[m_Tail++] = element;
        m_Tail = m_Tail % m_iQueueCapacity;
        m_iQueueLen++;
        return true;
    }
}
bool MyQueue::DeQueue(Customer &element)
{
    if (QueueEmpty())
    {
        return false;
    }
    else
    {
        element = m_pQueue[m_iHead++];
        m_iHead = m_iHead % m_iQueueCapacity;
        m_iQueueLen--;
        return true;
    }
}
void MyQueue::QueueTraverse()
{
    for (int i = m_iHead;i < m_iQueueLen+ m_iHead;i++)
    {
        m_pQueue[i%m_iQueueCapacity].printInfo();
    }
}

測試檔案

#include<iostream>
#include<stdlib.h>
#include"Queue.h"


using namespace std;

//迴圈佇列
int main()
{
    MyQueue cur(4);
    Customer c1("jack", 10);
    Customer c2("sva", 20);
    Customer c3("greqrg", 30);
    Customer c4("javfdck", 40);
    cur.EnQueue(c1);
    cur.EnQueue(c2);
    cur.EnQueue(c3);
    cur.EnQueue(c4);
    cur.QueueTraverse();

    cout << endl;

    Customer c5;
    cur.DeQueue(c5);
    c5.printInfo();

    Customer c6;
    cur.DeQueue(c6);
    c6.printInfo();

    cout << endl;
    cur.QueueTraverse();
    cur.ClearQueue();

    cout << endl;
    Customer c7("vavdf", 90);
    Customer c8("wefer", 40);
    cur.EnQueue(c7);
    cur.EnQueue(c8);
    cur.QueueTraverse();

    system("pause");
    return 0;
}