TestHash.cpp

#include <stdio.h>
#include "hash.h"

int main()
{
    static const int N = 5000;
    IntHash<double> hash;
    int i;
    
    puts("Add & find...");
    for (i=0; i<N; ++i)
    {
        double *d = new double;
        *d = (double)i;
        hash.insert(i, d);
        double *f = hash.find(i);
        if (!f)
        {
            printf("not found: %d\n", i);
            return -1;
        }
        if (*f != *d)
        {
            printf("wrong item: %g != %g\n", *d, *f);
            return -1;
        }
    }
    if (hash.size() != N)
    {
        printf("wrong size: %d\n", hash.size());
        return -1;
    }
    
    puts("Iterate...");
    IntHash<double>::Iterator iter(hash);
    i = 0;
    double *d;
    while ((d = iter.getValue()) != 0)
    {
        ++i;
        if (iter.getKey() != (int)*d  ||
            iter.getValue() != d)
        {
            printf("braindead iter\n");
            return -1;
        }
        iter.next();
    }
    if (i != N)
    {
        printf("wrong iter count: %d\n", i);
        return -1;
    }
    
    puts("Find & remove...");
    for (i=0; i<N; ++i)
    {
        double *f = hash.find(i);
        if (!f)
        {
            printf("not found: %d\n", i);
            return -1;
        }
        if (i != (int)*f)
        {
            printf("wrong item: %d != %g\n", i, *f);
            return -1;
        }
        double *r = hash.remove(i);
        if (r != f)
            printf("wrong item removed: %g != %g\n", *r, *f);
        delete f;
    }
    if (hash.size() != 0)
    {
        printf("wrong size: %d\n", hash.size());
        return -1;
    }
    
    
    puts("Add & find another batch of values...");
    for (i=0; i<N; ++i)
    {
        double *d = new double;
        *d = (double)i;
        hash.insert(i, d);
        double *f = hash.find(i);
        if (!f)
        {
            printf("not found: %d\n", i);
            return -1;
        }
        if (*f != *d)
        {
            printf("wrong item: %g != %g\n", *d, *f);
            return -1;
        }
    }
    if (hash.size() != N)
    {
        printf("wrong size: %d\n", hash.size());
        return -1;
    }
    
    puts("Delete via iterator");
    IntHash<double>::Iterator iter2(hash);
    // Delete all the channels from the Channel Table
    while ((d = iter2.getValue()) !=0)
    {
        double *r = iter2.remove();
        if (r != d)
        {
            printf("wrong item: %g != %g\n", *r, *d);
            return -1;
        }
        delete r;
    }
    if (hash.size() != 0)
    {
        printf("wrong size: %d\n", hash.size());
        return -1;
    }
    
    puts("OK.");
        
    return 0;
}