数据结构循环队列(cyclicqueue)的实现.pdfVIP

/******************************************************************************** * Copyright (c) 2004-2010 xxxx. * All rights reserved. * * File Type : C++ Header File(*.h) * File Name : Utility/cyclic_queue.h * Module : Utility * Author : Han Yongquan * * This file defines a cyclic queue for any data type and any length. * ********************************************************************************/ #ifndef _UTILITY_CYCLIC_QUEUE_H_ #define _UTILITY_CYCLIC_QUEUE_H_ //#pragma once #ifndef __cplusplus #error Please compile this file with C++ compiler! #endif // __cplusplus //#pragma warning(push, 3) #include cassert #include cstdlib #ifdef _PLATFORM_WIN32_ #include ctype #else // !_PLATFORM_WIN32_ #include cctype #endif // _PLATFORM_WIN32_ #include Utility/common_config.h #ifdef _MSC_VER #pragma pack(push, 4) #elif defined(__SUNPRO_CC) || defined(__SUNPRO_C) #pragma pack(8) #elif defined (__GNUG__) #pragma pack(8) #endif namespace Utility { // // class template CyclicQueue // The element data type must has correct public copy constructor, // copy assignment operator and default constructor. // template typename T /* element data type */, size_t N /* max size(the max number of T type element) */ class CyclicQueue { public: typedef T value_type; typedef size_t size_type; typedef T reference; typedef const T const_reference; CyclicQueue() : m_popPos(0), m_count(0) { assert(N 0); m_beginPtr = (T*)(::operator new(sizeof(T) * N)); // 分配原始空间 } ~CyclicQueue() { _Clear(); // this-_Clear(); ::operator delete((void*)m_beginPtr); } CyclicQueue(const CyclicQueueT, N copy) : m_popPos(0), m_count(0) { assert(N 0); m_beginPtr = (T*)(operator new(sizeof(T)