Queue buffer : queue « queue stack « C++ Tutorial

C++ Tutorial 1.  Language Basics 2.  Data Types 3.  Operators statements 4.  Array 5.  Development 6.  Exceptions 7.  Function 8.  Structure 9.  Class 10.  Operator Overloading 11.  Pointer 12.  File Stream 13.  template 14.  STL Introduction 15.  string 16.  vector 17.  list 18.  bitset 19.  set multiset 20.  valarray 21.  queue stack 22.  deque 23.  map multimap 24.  STL Algorithms Modifying sequence operations 25.  STL Algorithms Non modifying sequence operations 26.  STL Algorithms Binary search 27.  STL Algorithms Sorting 28.  STL Algorithms Merge 29.  STL Algorithms Min Max 30.  STL Algorithms Iterator 31.  STL Algorithms Heap 32.  STL Algorithms Helper Java XML XML Tutorial Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API C# / C Sharp C# / CSharp Tutorial ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ Ruby PHP Python Python Tutorial SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

C++ Tutorial » queue stack » queue   21. 2. 7. Queue buffer #include <queue> #include <stdexcept> #include <iostream> using namespace std; using std::queue; template <typename T> class PacketBuffer{  public:   PacketBuffer(int maxSize = -1);   void bufferPacket(const T& packet);   T getNextPacket() throw (std::out_of_range);  protected:   queue<T> mPackets;   int mMaxSize;  private:   PacketBuffer(const PacketBuffer& src);   PacketBuffer& operator=(const PacketBuffer& rhs); }; template <typename T> PacketBuffer<T>::PacketBuffer(int maxSize) {   mMaxSize = maxSize; } template <typename T> void PacketBuffer<T>::bufferPacket(const T& packet) {   if (mMaxSize > 0 && mPackets.size() == static_cast<size_t>(mMaxSize)) {     return;   }   mPackets.push(packet); } template <typename T> T PacketBuffer<T>::getNextPacket() throw (std::out_of_range) {   if (mPackets.empty()) {     throw (std::out_of_range("Buffer is empty"));   }   // retrieve the head element   T temp = mPackets.front();   // pop the head element   mPackets.pop();   // return the head element   return (temp); } class IPPacket {}; int main(int argc, char** argv) {   PacketBuffer<IPPacket> ipPackets(3);   ipPackets.bufferPacket(IPPacket());   ipPackets.bufferPacket(IPPacket());   ipPackets.bufferPacket(IPPacket());   ipPackets.bufferPacket(IPPacket());   while (true) {     try {       IPPacket packet = ipPackets.getNextPacket();     } catch (out_of_range&) {       cout << "Processed all packets!" << endl;       break;     }   }   return (0); } 21. 2. queue 21. 2. 1.  Instantiating an STL Queue 21. 2. 2.  Working with a Queue of Integers 21. 2. 3.  A queue for strings: push, empty, front, pop 21. 2. 4.  queue with doubles 21. 2. 5.  queue: push, pop, front and size 21. 2. 6.  queue.front() 21. 2. 7.  Queue buffer 21. 2. 8.  Using a queue to store user-defined object 21. 2. 9.  Queue: push, pop and size

w_w___w._j__av___a___2__s_._co__m___ | Contact Us

Copyright 2003 - 08 Demo Source and Support. All rights reserved.

All other trademarks are property of their respective owners.