// ================================================================================
// ==      This file is a part of Turbo Badger. (C) 2011-2014, Emil Segerås      ==
// ==                     See tb_core.h for more information.                    ==
// ================================================================================

#include "tb_test.h"
#include "tb_linklist.h"

#ifdef TB_UNIT_TESTING

using namespace tb;

TB_TEST_GROUP(tb_linklist)
{
	class Apple : public TBLinkOf<Apple>
	{
	public:
		Apple() : id(0) { total_apple_count++; }
		Apple(int id) : id(id) { total_apple_count++; }
		~Apple() { total_apple_count--; }
		void eat() {}

		int id;
		static int total_apple_count;
	};
	int Apple::total_apple_count = 0;

	TBLinkListOf<Apple> list;

	bool AddAppless(int num_apples)
	{
		for (int i = 0; i < num_apples; i++)
			list.AddLast(new Apple(i + 1));
		return list.CountLinks() == num_apples;
	}

	TB_TEST(Setup)
	{
		// Add 3 apples to list for each test.
		list.DeleteAll();
		TB_VERIFY(AddAppless(3));
	}

	TB_TEST(Shutdown)
	{
		list.DeleteAll();
	}

	TB_TEST(iteration_while_delete_all)
	{
		TBLinkListOf<Apple>::Iterator iterator = list.IterateForward();
		while (Apple *apple = iterator.GetAndStep())
		{
			apple->eat();
			// Lets pretend we do something with apple
			// that trig deletion of all apples.
			list.DeleteAll();
		}
		// success already, if we didn't crash
		TB_VERIFY(list.CountLinks() == 0);
	}

	TB_TEST(iteration_while_delete)
	{
		TBLinkListOf<Apple>::Iterator iterator = list.IterateForward();
		while (Apple *apple = iterator.GetAndStep())
		{
			// Lets pretend we do something with apple
			// that trig deletion of both apple and next apple!
			if (apple->GetNext())
				list.Delete(apple->GetNext());
			list.Delete(apple);
		}
		// success already, if we didn't crash
		TB_VERIFY(list.CountLinks() == 0);
	}

	TB_TEST(iteration_while_list_delete)
	{
		// Allocate a list that does not own its apples.
		// We need the apples to survive their list to test this fully.
		TBLinkListOf<Apple> *apple_refs = new TBLinkListOf<Apple>;
		Apple apples[3];
		for (int i = 0; i < 3; i++)
			apple_refs->AddLast(&apples[i]);

		TB_VERIFY(apples[0].IsInList());
		TB_VERIFY(apples[1].IsInList());
		TB_VERIFY(apples[2].IsInList());

		// Lets pretend we do some iteration in a list...
		TBLinkListOf<Apple>::Iterator iterator = apple_refs->IterateForward();
		TB_VERIFY(iterator.Get());

		// Now the list itself gets deallocated.
		delete apple_refs;

		// Since the list is gone, the links should not be added anymore.
		TB_VERIFY(!apples[0].IsInList());
		TB_VERIFY(!apples[1].IsInList());
		TB_VERIFY(!apples[2].IsInList());

		// Now the iterator should not point to anything,
		// and we should not crash.
		TB_VERIFY(!iterator.Get());
	}

	TB_TEST(forward_iterator)
	{
		TBLinkListOf<Apple>::Iterator i = list.IterateForward();
		TB_VERIFY(i.Get()->id == 1);

		TB_VERIFY(i.GetAndStep()->id == 1);
		TB_VERIFY(i.GetAndStep()->id == 2);
		TB_VERIFY(i.GetAndStep()->id == 3);
		TB_VERIFY(i.Get() == nullptr);

		i.Reset();
		TB_VERIFY(i.Get()->id == 1);
	}

	TB_TEST(backward_iterator)
	{
		TBLinkListOf<Apple>::Iterator i = list.IterateBackward();
		TB_VERIFY(i.Get()->id == 3);

		TB_VERIFY(i.GetAndStep()->id == 3);
		TB_VERIFY(i.GetAndStep()->id == 2);
		TB_VERIFY(i.GetAndStep()->id == 1);
		TB_VERIFY(i.Get() == nullptr);

		i.Reset();
		TB_VERIFY(i.Get()->id == 3);
	}

	TB_TEST(multiple_iterators_assign)
	{
		TBLinkListOf<Apple>::Iterator iA = list.IterateForward();
		TBLinkListOf<Apple>::Iterator iB = list.IterateBackward();

		TB_VERIFY(iA.Get()->id == 1);
		TB_VERIFY(iB.Get()->id == 3);

		iA = iB;
		TB_VERIFY(iA.GetAndStep()->id == 3);
		TB_VERIFY(iA.GetAndStep()->id == 2);
		TB_VERIFY(iA.GetAndStep()->id == 1);
	}

	TB_TEST(multiple_iterators_assign_swap_list)
	{
		TBLinkListAutoDeleteOf<Apple> other_list;
		other_list.AddLast(new Apple(42));

		TBLinkListOf<Apple>::Iterator iA = list.IterateForward();
		TBLinkListOf<Apple>::Iterator iB = other_list.IterateForward();

		TB_VERIFY(iA.Get()->id == 1);
		TB_VERIFY(iB.Get()->id == 42);

		iA = iB;
		TB_VERIFY(iA.GetAndStep()->id == 42);
		TB_VERIFY(iA.Get() == nullptr);
	}

	TB_TEST(autodelete)
	{
		// Check that the apples really are destroyed.
		int old_total_apple_count = Apple::total_apple_count;
		// Scope for TBLinkListAutoDeleteOf
		{
			TBLinkListAutoDeleteOf<Apple> autodelete_list;
			autodelete_list.AddLast(new Apple(1));
			autodelete_list.AddLast(new Apple(2));
			TB_VERIFY(Apple::total_apple_count == old_total_apple_count + 2);
		}
		TB_VERIFY(Apple::total_apple_count == old_total_apple_count);
	}
}

#endif // TB_UNIT_TESTING