LinkedListTest.cpp File Reference

#include "Core/Structures/LinkedList/Element.hpp"
#include "Core/Structures/LinkedList/Head.hpp"
#include <boost/test/unit_test.hpp>
#include <cstring>
#include <iostream>

Include dependency graph for LinkedListTest.cpp:

Classes
class	TestListElem
class	TestListHead

Macros
#define	BOOST_TEST_MODULE   "LinkedListTest"

Functions
	BOOST_AUTO_TEST_CASE (LinkedListTest)

Macro Definition Documentation

BOOST_TEST_MODULE

#define BOOST_TEST_MODULE   "LinkedListTest"

Function Documentation

BOOST_AUTO_TEST_CASE()

BOOST_AUTO_TEST_CASE

(

LinkedListTest

)

{
    int var[10000];
    TestListHead h;
 
    std::shared_ptr<TestListElem> t[10000];
 
    for (int i = 0; i < 10000; i++) {
        var[i] = i;
        t[i] = std::make_shared<TestListElem>(var[i]);
        h.push_front(t[i].get());
        BOOST_CHECK_EQUAL(h.first()->get_var(), var[i]);
    }
 
    int idx = 9999;
    for (TestListHead::iterator it = h.begin(); it != TestListHead::iterator(nullptr); ++it) {
        //printf("pre-increment: %d\n", it->get_var());
        BOOST_CHECK_EQUAL(it->get_var(), var[idx--]);
    }
 
    idx = 9999;
    for (TestListHead::iterator it = h.begin(); it != TestListHead::iterator(nullptr); it++) {
        //printf("reverse post-increment: %d\n", it->get_var());
        BOOST_CHECK_EQUAL(it->get_var(), var[idx--]);
    }
 
    idx = 0;
    for (TestListHead::iterator it = h.end(); it != TestListHead::iterator(nullptr); --it) {
        //printf("pre-decrement: %d\n", it->get_var());
        BOOST_CHECK_EQUAL(it->get_var(), var[idx++]);
    }
 
    idx = 0;
    for (TestListHead::iterator it = h.end(); it != TestListHead::iterator(nullptr); it--) {
        //printf("post-decrement: %d\n", it->get_var());
        BOOST_CHECK_EQUAL(it->get_var(), var[idx++]);
    }
}

References TestListHead::begin(), TestListHead::end(), TestListHead::first(), TestListElem::get_var(), and Horizon::Structures::LinkedList::Head::push_front().

Here is the call graph for this function: