test_hashed_tree.cpp

// Description: Testing for HashedTree
// DocumentationOf: hashed_tree.h

#include "test/test_init.h"

#include "pastel/sys/hashed_tree.h"
#include "pastel/sys/random/random_uniform.h"

#include <iostream>
#include <list>

using namespace Pastel;

namespace
{

        using Tree = Hashed_Map<integer, integer>;
        using Iterator = Tree::Iterator;
        using ConstIterator = Tree::ConstIterator;

}

TEST_CASE("HashedTree (HashedTree)")
{
    integer keySet[] = {1, 5, 3, 2, 7};

    Tree tree;
    REQUIRE(tree.hash() == 0);

    std::vector<hash_integer> hashSet;
    RANGES_FOR(integer key, keySet)
    {
        tree.insert(key, 0);
        hashSet.push_back(tree.hash());
    }
}