Function static_map_kernel_test

dlib/test/static_map.cpp:28–297

        typename map
        >
    void static_map_kernel_test (
    )
    /*!
        requires
            - map is an implementation of static_map/static_map_kernel_abstract.h and
              is instantiated to map int to int
        ensures
            - runs tests on map for compliance with the specs 
    !*/
    {        

        print_spinner();
        srand(static_cast<unsigned int>(time(0)));

        typedef binary_search_tree<int,int>::kernel_2a_c bst;
        typedef hash_table<int,int>::kernel_1a_c ht;

        const unsigned long table_4_max_size = 100;
        const unsigned long tree_max_size = 50000;
        ht table_4(4);
        ht table_8(8);
        bst tree;

        ht table_4b(4);
        ht table_8b(8);
        bst treeb;


        // just do the following to make sure operator[] doesn't hang
        // under some instances
        {
            int g = 1, h = 1;
            treeb.add(g,h);
            map test;
            map test2;

            DLIB_TEST(test.size() == 0);
            DLIB_TEST(test.at_start());
            DLIB_TEST(test.current_element_valid() == false);
            DLIB_TEST(test.move_next() == false);
            DLIB_TEST(test.current_element_valid() == false);
            DLIB_TEST(test.at_start() == false);

            swap(test,test2);
            DLIB_TEST(test2.at_start() == false);
            DLIB_TEST(test.at_start() == true);

            swap(test,test2);
            DLIB_TEST(test.at_start() == false);


            DLIB_TEST(test.size() == 0);
            DLIB_TEST(test[1] == 0);
            DLIB_TEST(test[2] == 0);
            DLIB_TEST(test[3] == 0);
            DLIB_TEST(test[0] == 0);

            test.load(treeb);