/* 
 * Copyright (C) 2003-2006 RevConnect, http://www.revconnect.com
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * 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 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.
 */

#pragma once

#include "CriticalSection.h"
#include "MerkleTree.h"

namespace dcpp {

struct Search
{
	int32_t   sizeType;
	int64_t   size;
	int32_t   fileType;
	string    query;
	string    token;
	set<void*> owners;
	
	bool operator==(const Search& rhs) const {
		 return this->sizeType == rhs.sizeType && 
		 		this->size == rhs.size && 
		 		this->fileType == rhs.fileType && 
		 		this->query == rhs.query;
	}
};

class SearchQueue
{
public:
	
	SearchQueue(uint32_t aInterval = 0) 
		: lastSearchTime(0), interval(aInterval)
	{
	}

	bool add(const Search& s);
	bool pop(Search& s);
	
	void clear()
	{
		Lock l(cs);
		searchQueue.clear();
	}

	bool cancelSearch(void* aOwner);

	/** return 0 means not in queue */
	uint64_t getSearchTime(void* aOwner);

	/** 
		by milli-seconds
		0 means no interval, no auto search and manual search is sent immediately 
	*/
	uint32_t interval;

private:
	deque<Search>   searchQueue;
	uint64_t       lastSearchTime;	
	CriticalSection cs;
};

}
