没事写个散列玩~

感觉散列的查找性能真心不错，如果使用普通线性结构查找，平均时间是n/2.而刚才用实验，256大小的散列，存储128个数据，平均时间为2次以内。感觉真心NB

#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include <ctime>

using namespace std;
typedef bool BOOL;
typedef unsigned long DWORD;
typedef unsigned char UINT8;
//typedef true TRUE;
//typedef false FALSE;
DWORD g_dwTotalTimes = 0;
DWORD g_dwCount = 0;
#define INIT_TL { g_dwTotalTimes = 0, g_dwCount = 0; }
#define CALL_COUNT(t) { g_dwTotalTimes += t,++ g_dwCount; }
#define AVERAGE ( (float)g_dwTotalTimes / g_dwCount )

void RandString ( string & szRandString, unsigned int unAriseLength, unsigned int unMiniLength = 5 );
//Data In Struct
typedef class A1
{
public:
    string szSampleKey;
    string szRealData;
}SampleData;

//Data Normal
typedef class A
{
#define MAX_SIZE_OF_DB (256)
#define MAX_ADDR_OF_DB (MAX_SIZE_OF_DB)

private:
    vector<SampleData> Array;
    vector<int> UsedFlagArray;
    DWORD dwLeftDataSize;
private://function
    DWORD GetAddrByKey ( string & KeyStr );
    BOOL SaveDataToDB ( SampleData & KeyToGet, DWORD dwAddr );
public:
    A();
    ~A();
    BOOL AddToArray( SampleData & sd );
    SampleData & FindInArray( string & Key );
}NormalArray;

NormalArray::A()
{
    INIT_TL;
    UsedFlagArray.resize ( MAX_SIZE_OF_DB );
    Array.resize ( MAX_SIZE_OF_DB );
    dwLeftDataSize = MAX_SIZE_OF_DB;
}

NormalArray::~A()
{
    ;
}

BOOL NormalArray::AddToArray ( SampleData & sd )
{
    if ( 0 == dwLeftDataSize )
    {
        return false;
    }
    //根据Key值计算出地址信息
    DWORD dwAddr = GetAddrByKey ( sd.szSampleKey );
    //根据地址信息将数据存放在数据库中
    SaveDataToDB ( sd, dwAddr );
    return true;
}

DWORD NormalArray::GetAddrByKey ( string & KeyStr )
{
    DWORD dwSize = KeyStr.size ();
    DWORD dwKeySum = 0;
    while ( dwSize -- )
    {
        dwKeySum += (UINT8)KeyStr[dwSize];
    }
    //根据上限值计算出结果
    return dwKeySum % ( MAX_ADDR_OF_DB );
}

BOOL NormalArray::SaveDataToDB ( SampleData & KeyToGet, DWORD dwAddr )
{
    if ( 0 == dwLeftDataSize )
    {
        return false;
    }
    while ( 0 != UsedFlagArray[dwAddr] )
    {
        (++ dwAddr)  %= MAX_ADDR_OF_DB;
    }
    //在这个地址保存数据
    Array[dwAddr].szSampleKey = KeyToGet.szSampleKey;
    Array[dwAddr].szRealData = KeyToGet.szRealData;
    //地址信息更新
    UsedFlagArray[dwAddr] = 1;
    -- dwLeftDataSize;

    return true;
}

SampleData & NormalArray::FindInArray( string & Key )
{
    DWORD dwSearchTime = 1;
    DWORD dwAddr = GetAddrByKey (Key);
    while ( Array[dwAddr].szSampleKey != Key )
    {
        ++ dwSearchTime;
        (++ dwAddr) %= MAX_ADDR_OF_DB;
    }
    CALL_COUNT(dwSearchTime);
    cout << "Find " << Key << " With " << dwSearchTime << " Times.\n";
    return Array[dwAddr];
}
void InitialSampleData( vector<SampleData> & SampleDataList )
{
    srand ( time ( NULL ) );
    unsigned int unListSize = SampleDataList.size();
    //Start
    for ( unsigned int unloop = 0; unloop < unListSize ;++ unloop )
    {
        RandString ( SampleDataList[unloop].szSampleKey, 3 );
        //what the Data is
        RandString ( SampleDataList[unloop].szRealData, 7 );
    }
}

void RandString ( string & szRandString, unsigned int unAriseLength, unsigned int unMiniLength )
{
    const char cBaseVal = 'a';
    char cIncreaseVal = 0;
    unsigned int bUpper = 0;
    unsigned int unLength = 0;
    //the length of string
    unLength = rand () % unAriseLength + unMiniLength;
    //init the Key size
    szRandString.resize( unLength + 1 );
    for ( unsigned int unWordLoop = 0; unWordLoop < unLength; ++ unWordLoop )
    {
        //0or1
        bUpper = rand () & 0x01;
        //what the Key is
        cIncreaseVal = rand () % 26;
        //Make It;
        char tmp = cBaseVal + cIncreaseVal;
        bUpper ? tmp -= 32 : tmp ;
        szRandString[unWordLoop] = tmp;
    }
    szRandString[unLength] = '\0';
}

void DspDataConsol ( const vector<SampleData> & SampleDataList )
{
    unsigned int unListSize = SampleDataList.size();
    for ( unsigned int unLoop = 0; unLoop < unListSize; ++ unLoop )
    {
        cout << unLoop << endl;
        cout << SampleDataList[unLoop].szSampleKey << endl;
        cout << SampleDataList[unLoop].szRealData << endl;
    }
}
//Data Map


int main ()
{
    //初始化测试数据
    vector<SampleData> TestData;
    TestData.resize (128);
    InitialSampleData ( TestData );
    //DspDataConsol ( TestData );
    NormalArray Na;
    for ( DWORD dwLoop = 0; dwLoop < 128; ++ dwLoop )
    {
        Na.AddToArray ( TestData[dwLoop] );
    }
    for ( DWORD dwLoop = 0; dwLoop < 128; ++ dwLoop )
    {
        Na.FindInArray( TestData[dwLoop].szSampleKey );
    }
    cout << "平均查找时间：" << AVERAGE << endl;
    return 0;
}