cachemap_tests.cpp

// Copyright (c) 2014-2023 The Dash Core developers

#include <cachemap.h>
#include <streams.h>
#include <version.h>

#include <boost/test/unit_test.hpp>

BOOST_AUTO_TEST_SUITE(cachemap_tests)

static bool Compare(const CacheMap<int,int>& cmap1, const CacheMap<int,int>& cmap2)
{
    if(cmap1.GetMaxSize() != cmap2.GetMaxSize()) {
        return false;
    }

    if(cmap1.GetSize() != cmap2.GetSize()) {
        return false;
    }

    const CacheMap<int,int>::list_t& items1 = cmap1.GetItemList();
    for(CacheMap<int,int>::list_cit it = items1.begin(); it != items1.end(); ++it) {
        if(!cmap2.HasKey(it->key)) {
            return false;
        }
        int val = 0;
        if(!cmap2.Get(it->key, val)) {
            return false;
        }
        if(it->value != val) {
            return false;
        }
    }

    const CacheMap<int,int>::list_t& items2 = cmap2.GetItemList();
    for(CacheMap<int,int>::list_cit it = items2.begin(); it != items2.end(); ++it) {
        if(!cmap1.HasKey(it->key)) {
            return false;
        }
        int val = 0;
        if(!cmap1.Get(it->key, val)) {
            return false;
        }
        if(it->value != val) {
            return false;
        }
    }

    return true;
}

BOOST_AUTO_TEST_CASE(cachemap_test)
{
    // create a CacheMap limited to 10 items
    CacheMap<int,int> cmapTest1(10);

    // check that the max size is 10
    BOOST_CHECK(cmapTest1.GetMaxSize() == 10);

    // check that the size is 0
    BOOST_CHECK(cmapTest1.GetSize() == 0);

    // insert (-1, -1)
    cmapTest1.Insert(-1, -1);

    // make sure that the size is updated
    BOOST_CHECK(cmapTest1.GetSize() == 1);

    // make sure the map contains the key
    BOOST_CHECK(cmapTest1.HasKey(-1) == true);

    // make sure that insert fails to update already existing key
    BOOST_CHECK(cmapTest1.Insert(-1, -2) == false);
    int nValRet = 0;
    BOOST_CHECK(cmapTest1.Get(-1, nValRet) == true);
    BOOST_CHECK(nValRet == -1);

    // make sure that the size is still the same
    BOOST_CHECK(cmapTest1.GetSize() == 1);

    // add 10 items
    for(int i = 0; i < 10; ++i) {
        cmapTest1.Insert(i, i);
    }

    // check that the size is 10
    BOOST_CHECK(cmapTest1.GetSize() == 10);

    // check that the map contains the expected items
    for(int i = 0; i < 10; ++i) {
        int nVal = 0;
        BOOST_CHECK(cmapTest1.Get(i, nVal) == true);
        BOOST_CHECK(nVal == i);
    }

    // check that the map no longer contains the first item
    BOOST_CHECK(cmapTest1.HasKey(-1) == false);

    // erase an item
    cmapTest1.Erase(5);

    // check the size
    BOOST_CHECK(cmapTest1.GetSize() == 9);

    // check that the map no longer contains the item
    BOOST_CHECK(cmapTest1.HasKey(5) == false);

    // check that the map contains the expected items
    int expected[] = { 0, 1, 2, 3, 4, 6, 7, 8, 9 };
    for(size_t i = 0; i < 9; ++i) {
        int nVal = 0;
        int eVal = expected[i];
        BOOST_CHECK(cmapTest1.Get(eVal, nVal) == true);
        BOOST_CHECK(nVal == eVal);
    }

    // test serialization
    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
    ss << cmapTest1;

    CacheMap<int,int> mapTest2;
    ss >> mapTest2;

    BOOST_CHECK(Compare(cmapTest1, mapTest2));

    // test copy constructor
    CacheMap<int,int> mapTest3(cmapTest1);
    BOOST_CHECK(Compare(cmapTest1, mapTest3));

    // test assignment operator
    CacheMap<int,int> mapTest4;
    mapTest4 = cmapTest1;
    BOOST_CHECK(Compare(cmapTest1, mapTest4));
}

BOOST_AUTO_TEST_SUITE_END()