c++学习-oop-顺序队列

//[Error] ‘copy’ was not declared in this scope, and no declarations were found by argument-dependent lookup at the point of
copy函数显示没有声明，头文件也弄了几个，就是不行。。。

#ifndef _Q1_H
#define _Q1_H
#include<algorithm>
#include<vector>

//[Error] 'copy' was not declared in this scope, and no declarations were found by argument-dependent lookup at the point of instantiation [-fpermissive]
template<class T> 
class Queue
{
public:	
	Queue(int queueCapacity = 10);
	bool IsEmpty()const;
	T& Front()const;
	T& Rear()const;
	void Push(const T& item);
	void Pop();
private:
	T *queue;//动态数组 
	int front;
	int rear;
	int capacity; 
};

template<class T>
Queue<T>::Queue(int queueCapacity):capacity(queueCapacity)
{
	if(capacity<1)throw "Queue capacity must be > 0";
	queue = new T[capacity];//创建动态数组 
	front = rear = 0;
}

template<class T>
inline bool Queue<T>::IsEmpty()const
{
	return front==rear;	
}

template<class T>
void Queue<T>::Push(const T &item)
{
	if((rear+1)%capacity==front)//队列满了 
	{
		//加倍
		T* newQueue = new T[2*capacity];
		//判断是否发生了回绕
		int start = (front+1)%capacity;
		if(start<2)//没有发生回转，no wrap 
			copy(queue+start,queue+start+capacity-1,newQueue);
		else//wrap								
		{
			copy(queue+start,queue+capacity,newQueue);
			copy(queue,queue+rear+1,newQueue+capacity-start);
		}
		front = 2*capacity -1;
		rear = capacity -2;//结构看：第二张图的最后一个队列，队首在最后 
	}
	rear = (rear+1)%capacity;
	queue[rear] = item;
}

template<class T>
inline T& Queue<T>::Front()const
{
	if(IsEmpty())throw "Queue is empty.No front element";
	return queue[(front+1)%capacity];//fornt是队首没错，但是它后面一个才开始存数据 
}

template<class T>
inline T& Queue<T>::Rear()const
{
	if(IsEmpty())throw "Queue is empty.No rear element";
	return queue[rear];
}

template<class T>
void Queue<T>::Pop()
{
	if(IsEmpty())throw "Queue is empty.Cannot delete.";
	front=(front+1)%capacity;
	queue[front].~T();	
}


#endif

/*
	Date: 15/03/21 16:15
	Description: 顺序队列
	先进先出 或 后进后出
	队首、队尾
	队列的操作
		1.push
//		2.pop
		3.front
		4.rear
		5.isEmpty 
*/
#include<iostream>

#include "q1.h"
using namespace std;

int main()
{
	Queue<int> q(10);
	q.Push(1); 
	q.Push(2); 
	cout<<q.Front()<<","<<q.Rear()<<endl;
 	q.Push(3);
 	q.Push(4);
 	cout<<q.Front()<<","<<q.Rear()<<endl;
	q.Pop();
	cout<<q.Front()<<","<<q.Rear()<<endl;
		
	return 0;
}