#define CMIN 65
#define CMAX 122
#define CRANGE (CMAX-CMIN)

namespace DX
{
	template <typename Data>
	class fast_hash_map
	{
	private:
		typedef std::pair<std::string, Data> Hash;
		std::vector<Hash> m_Hash_Map[CRANGE+2]; // create a list for each character, set first and last as wildcard holders

	public:

		Data insert(std::string name, Data value)
		{
			m_Hash_Map[GetIndex(name)].push_back(Hash(name, value));		

			return value;
		}

		Data find(std::string key)
		{
			std::vector<Hash>* CurHashMap = &m_Hash_Map[GetIndex(key)];

			for (UINT n = 0; n < CurHashMap->size(); n++)
			{
				if (CurHashMap->at(n).first == key)
					return CurHashMap->at(n).second;
			}
			return 0;
		}

		inline int GetIndex(std::string name)
		{			
			int rangeindex = int((int(name.at(name.size()-1)>>1) + 
								  int(name.at(name.size()-1)>>2))>>1; // Take two characters when creating index to spread

			return max(min(rangeindex-CMIN+1, CRANGE),0); // make sure index is within range, if not place in first or last
		}
	};
}

        // By Dragon_Strike	template <typename Data, int Range, int Spread>	class fast_hash_map	{	private:		typedef std::pair<std::string, Data> Hash;		std::vector<Hash> m_Hash_Map[Range]; // create a list for each character, set first and last as wildcard holders	public:		inline Data insert(const std::string& name, const Data value)		{			m_Hash_Map[GetIndex(name)].push_back(Hash(name, value));					return value;		}		inline Data* find(const std::string& key)		{			int index = GetIndex(key);			for (UINT n = 0; n < m_Hash_Map[index].size(); n++)			{				if (m_Hash_Map[index][n].first == key)					return &m_Hash_Map[index][n].second;			}			return 0;		}		inline int GetIndex(const std::string& name)		{						 int index = 0;			 for (int n = 0; n < Spread; n++)			 {				index += int(name[(name.size()-1)>>n]);			 }			 return index % Range;		}	};