// ============================================================================
//  Copyright (C) 2001-2016 by Jozef Starosczyk
//  ixen@copyhandler.com
//
//  This program is free software; you can redistribute it and/or modify
//  it under the terms of the GNU Library General Public License
//  (version 2) as published by the Free Software Foundation;
//
//  This program is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU General Public License for more details.
//
//  You should have received a copy of the GNU Library General Public
//  License along with this program; if not, write to the
//  Free Software Foundation, Inc.,
//  59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
// ============================================================================
#ifndef __TORDEREDBUFFERQUEUE_H__
#define __TORDEREDBUFFERQUEUE_H__

#include "libchcore.h"
#include <set>

namespace chcore
{
	class TOverlappedDataBuffer;

	struct CompareBufferPositions
	{
		bool operator()(const TOverlappedDataBuffer* rBufferA, const TOverlappedDataBuffer* rBufferB) const;
	};

	class TOrderedBufferQueue : public std::set<TOverlappedDataBuffer*, CompareBufferPositions>
	{
	public:
		TOverlappedDataBuffer* pop_front()
		{
			if(empty())
				throw std::runtime_error("Bounds exceeded in ordered buffer queue");

			TOverlappedDataBuffer* pBuffer = *begin();
			erase(begin());
			return pBuffer;
		}
	};
}

#endif