//this file is part of eMule
//Copyright (C)2002-2008 Merkur ( strEmail.Format("%s@%s", "devteam", "emule-project.net") / http://www.emule-project.net )
//
//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., 675 Mass Ave, Cambridge, MA 02139, USA.
#pragma once
#include "map_inc.h"
#include "otherfunctions.h"

#define DEFAULT_FILES_TABLE_SIZE			1031
#define DEFAULT_CANCELLED_TABLE_SIZE		209
#define DEFAULT_CLIENTS_TABLE_SIZE			16001

// use this class if the hash is stored somehwere else (and stays valid as long as this object exists)
class CCKey
#ifdef _DEBUG
	: public CObject
#endif
{
public:
	CCKey(const uchar* key = 0)	{m_key = key;}
	CCKey(const CCKey& k1)		{m_key = k1.m_key;}

	CCKey& operator=(const CCKey& k1)						{m_key = k1.m_key; return *this; }
	friend bool operator==(const CCKey& k1,const CCKey& k2);

	const uchar* m_key;
};

#ifdef HAVE_UNORDERED
struct hash_unordered{
	size_t operator()(const uchar*s) const{
		size_t hash = 1;
		for (size_t i = 0;i != 16;i++)
			hash += (s[i]+1)*((i*i)+1);
		return hash;
	}
	bool operator()(const uchar* s1, const uchar* s2) const{
		return md4cmp(s1, s2) == 0;
	}
};
#endif

#ifndef REPLACE_MFCMAP
template<> inline UINT AFXAPI HashKey(const CCKey& key){
	size_t hash = 1;
	for (size_t i = 0;i != 16;i++)
		hash += (key.m_key[i]+1)*((i*i)+1);
	return (UINT)hash;
};
typedef CMap<CCKey,const CCKey&,CKnownFile*,CKnownFile*> CKnownFilesMap;
#else
typedef unordered_map<const uchar*, CKnownFile*, hash_unordered, hash_unordered> CKnownFilesMap;
#endif

#ifndef REPLACE_ATLMAP
class CCKeyTraits :
	public CElementTraitsBase<CCKey>,
	public CDefaultCompareTraits<CCKey>
{
public:
	static ULONG Hash( const CCKey& key ) throw()
	{
		size_t hash = 1;
		for (size_t i = 0;i != 16;i++)
			hash += (key.m_key[i]+1)*((i*i)+1);
		return (ULONG)hash;
	}
};

// use this class if the hash is stored somehwere inside the key (in any case safer but needs more memory)
class CSKey
#ifdef _DEBUG
	: public CObject
#endif
{
public:
	CSKey(const uchar* key = 0)	{ if(key) md4cpy(m_key, key); else md4clr(m_key); }
	CSKey(const CSKey& k1)		{ md4cpy(m_key, k1.m_key); }

	CSKey& operator=(const CSKey& k1)						{md4cpy(m_key, k1.m_key); return *this; }
	friend bool operator==(const CSKey& k1,const CSKey& k2);
	size_t operator()(const CSKey&s) const{
		size_t hash = 1;
		for (size_t i = 0;i != 16;i++)
			hash += (s.m_key[i]+1)*((i*i)+1);
		return hash;
	}
	bool operator()(const CSKey& s1, const CSKey& s2) const{
		return md4cmp(s1.m_key, s2.m_key) == 0;
	}

	uchar m_key[16];
};

class CSKeyTraits :
	public CElementTraitsBase<CSKey>,
	public CDefaultCompareTraits<CSKey>
{
public:
	static ULONG Hash( const CSKey& key ) throw()
	{
		size_t hash = 1;
		for (size_t i = 0;i != 16;i++)
			hash += (key.m_key[i]+1)*((i*i)+1);
		return (ULONG)hash;
	}
};

typedef CAtlMap<CSKey, bool, CSKeyTraits> CUnsharedFilesMap;
#else
struct CSKey{
	uchar m_key[16];
	CSKey(){}
	CSKey(const uchar*s){md4cpy(m_key, s);}
	size_t operator()(const CSKey&s) const{
		size_t hash = 1;
		for (size_t i = 0;i != 16;i++)
			hash += (s.m_key[i]+1)*((i*i)+1);
		return hash;
	}
	bool operator()(const CSKey& s1, const CSKey& s2) const{
		return md4cmp(s1.m_key, s2.m_key) == 0;
	}
};
typedef unordered_set<CSKey, CSKey, CSKey> CUnsharedFilesMap;
#endif
