Queue（2）Queue的顺序实现之count计数版本

queue.h

/*----------------------------------------------- 
Created By EverSteins 
Email:EverSteins@gmail.com
转载请注明出处
------------------------------------------------*/
#ifndef QUEUE_H
#define QUEUE_H
#include "utility.h"


typedef int ElemType ;

class Queue
{
public:
	Queue():count_(0),rear_(0),front_(0){}

	bool Empty() const
	{
		return count_ == 0;
	}

	bool Full() const
	{
		return count_ == kMaxQueueSize;
	}

	size_t Size() const
	{
		return count_;
	}

	bool Top(ElemType &item) const;

	bool Push(const ElemType &item);
	bool Pop();

private:
	static const size_t kMaxQueueSize=5;

	size_t count_;

	size_t rear_;
	size_t front_;

	ElemType entry_[kMaxQueueSize];
};

#endif

queue.cpp

/*----------------------------------------------- 
Created By EverSteins 
Email:EverSteins@gmail.com
转载请注明出处
------------------------------------------------*/ 

#include "stdafx.h"
#include "queue.h"

bool Queue::Top(ElemType &item) const
{
	if (Empty())
		return false;

	item = entry_[front_];
	return true;
}

bool Queue::Push(const ElemType &item)
{
	if (Full())
		return false;

	entry_[rear_] = item;
	rear_ = (rear_ + 1) % kMaxQueueSize;

	count_++;
	return true;
}

bool Queue::Pop()
{
	if (Empty())
		return false;

	front_ = (front_ + 1) % kMaxQueueSize;

	count_--;
	return true;
}

utility.h

/*----------------------------------------------- 
Created By EverSteins 
Email:EverSteins@gmail.com
转载请注明出处
------------------------------------------------*/ 

#ifndef UTILITY_H
#define UTILITY_H
#include <cstddef>
#include <cstdlib>

#define DISALLOW_COPY_AND_ASSIGN(TypeName) \
  TypeName(const TypeName&);               \
  void operator=(const TypeName&)

#endif

main.cpp

/*----------------------------------------------- 
Created By EverSteins 
Email:EverSteins@gmail.com
转载请注明出处
------------------------------------------------*/ 

#include "stdafx.h"
#include "queue.h"
#include <iostream>
using namespace std;

int _tmain(int argc, _TCHAR* argv[])
{
	Queue q1;
	q1.Push(1);
	q1.Push(2);
	q1.Push(3);
	q1.Push(4);
	q1.Push(5);
	q1.Push(6);
	
	while (!q1.Empty())
	{
		int tmp;
		q1.Top(tmp);
		cout<<tmp<<' ';
		q1.Pop();
	}

	cout<<endl;

	cin.get();


	return 0;
}