C++多线程实现静态队列进队、key随机匹配队列值

队列

template <class T>
class MyQueue
{
   
private:
    int front;
    int rear;
    int maxSize;
    T *array;

public:
    MyQueue(void)
    {
   
        front = 0;
        rear = 0;
        maxSize = 500;
        array = new T[maxSize];
    }

    ~MyQueue(void)
    {
   
        delete[] array; /*析构函数释放用户自己分配内存空间并且释放了array指针指向的全部内存空间*/
    }

    int getFront(void)
    {
   
        return this->front;
    }

    int getRear(void)
    {
   
        return this->rear;
    }

    T *getArray(void)
    {
   
        return this->array;
    }

    int getSize(void)
    {
   
        return this->maxSize;
    }

    //初始化队列满以后，队列进行覆盖式插入元素
    void push(T obj)
    {
   
        try
        {
   
            if (isFull())
            {
   
                front = (front + 1) % maxSize;
            }
            array[rear] = obj;
            rear = (rear + 1) % maxSize;

            EnterCriticalSection(&cs);
            printf("当前:rear=%d,front=%d,obj=%d的小黄人入队\n", rear, front, obj);
            LeaveCriticalSection(&cs);
            //Sleep(10);

        }
        catch (const std::exception &e)
        {
   
            std::cerr << e.what() << '\n';
        }
    }

    //从对头取元素
    T pop()
    {
   
        if (!isEmpty())
        {
   
            try
            {