module specs.data.queue;

import data.queue;

describe queue() {
	describe creation() {
		it should_work_as_expected() {
			Queue!(int) list = new Queue!(int)();
			shouldNot(list is null);
			should(list.length == 0);
		}
	}

	describe add() {
		it should_add_item_to_the_head() {
			Queue!(int) list = new Queue!(int)();
			int item = 42;
			list.add(item);
			
			should(list.length == 1);
			should(list.peek() == item);
		}

		it should_an_a_list_to_list() {
			Queue!(int) list1 = new Queue!(int)();
			Queue!(int) list2 = new Queue!(int)();
			int item = 33;

			list2.add(item);
			list1.add(list2);
			
			should(list1.length == 1);
			should(list1.peek() == item);

		}

		it should_add_an_array_to_list() {
			int[3] arr = 1;
			Queue!(int) list = new Queue!(int)();

			list.add(arr);

			should(list.length == 3);
			should(list.peek() == arr[2]);
		}
	}

	describe peek() {
		it should_return_the_head() {
			Queue!(int) list = new Queue!(int)();
			
			int item1 = 1;
			int item2 = 2;
			int item3 = 3;

			list.add(item1);
			list.add(item2);
			list.add(item3);

			should(list.peek() == item3);
		}

		it should_return_the_item_at_index() {
			Queue!(int) list = new Queue!(int)();
			
			int item1 = 1;
			int item2 = 2;
			int item3 = 3;

			list.add(item1);
			list.add(item2);
			list.add(item3);

			should(list.peekAt(0) == item3);
			should(list.peekAt(1) == item2);
			should(list.peekAt(2) == item1);
		}
	}

	describe remove() {
		it should_remove_the_tail() {
			Queue!(int) list = new Queue!(int)();
			int item = 1;
			list.add(item);
			
			should(list.remove() == item);
			should(list.length == 0);
		}

		it should_remove_by_data() {
			Queue!(int) list = new Queue!(int)();
			int item = 1;
			list.add(item);

			should(list.remove(item) == item);
			should(list.length == 0);
		}

		it should_remove_at_index(){
			Queue!(int) list = new Queue!(int)();
			
			int item1 = 1;
			int item2 = 2;
			int item3 = 3;

			list.add(item1);
			list.add(item2);
			list.add(item3);

			should(list.removeAt(2) == item1);
			should(list.length == 2);
			should(list.removeAt(1) == item2);
			should(list.length == 1);
			should(list.removeAt(0) == item3);
			should(list.length == 0);
		}
	}

	describe clear() {
		it should_work_as_expected() {
			Queue!(int) list = new Queue!(int)();

			list.add(1);
			list.add(2);
			list.add(3);

			list.clear();

			should(list.length == 0);
		}
	}

	describe empty() {
		it should_work_as_expected() {
			Queue!(int) list = new Queue!(int)();

			should(list.empty());

			list.add(1);

			shouldNot(list.empty());

		}
	}

	describe operations() {
		it should_peek_at_the_index() {
			Queue!(int) list = new Queue!(int)();
			int entry = 1;
			list.add(entry);

			should(list[0] == entry);
		}
	}

	describe array() {
		it should_return_an_array_of_the_list() {
			Queue!(int) list = new Queue!(int)();
			
			int entry1 = 1;
			int entry2 = 2;
			int entry3 = 3;

			list.add(entry1);
			list.add(entry2);
			list.add(entry3);

			int[] listArr = list.array();

			shouldNot(listArr is null);
			should(listArr[0] == entry1);
			should(listArr[1] == entry2);
			should(listArr[2] == entry3);
		}
	}

	describe duplication() {
		it should_work_as_expected() {
			Queue!(int) list = new Queue!(int)();
			int entry = 1;
			list.add(entry);

			Queue!(int) dupList = list.dup();

			shouldNot(dupList is null);
			should(dupList.peek() == entry);

		}
	}

	describe slicing() {
		it should_work_as_expected() {
			Queue!(int) list = new Queue!(int)();

			int entry1 = 1;
			int entry2 = 2; 
			int entry3 = 3;

			list.add(entry3);
			list.add(entry2);
			list.add(entry1);

			Queue!(int) sliceList = list.slice(0,2);

			shouldNot(sliceList is null);
			should(sliceList.length == 2);
			should(sliceList.remove() == entry3);
			should(sliceList.remove() == entry2);
		}
	}

	describe reverse() {
		it should_work_as_expected {
			Queue!(int) list = new Queue!(int)();

			int entry1 = 1;
			int entry2 = 2; 
			int entry3 = 3;

			list.add(entry1);
			list.add(entry2);
			list.add(entry3);

			Queue!(int) revList = list.reverse();

			shouldNot(revList is null);
			should(revList.length == 3);
			should(revList.remove() == entry1);
			should(revList.remove() == entry2);
			should(revList.remove() == entry3);
		}
	}
	
	describe string() {
		it should_work_as_expected {
			Queue!(int) list = new Queue!(int)();
			
			list.add(1);
			list.add(2);
			list.add(3);

			should(list.toString() == "[1, 2, 3]");
		}
	}
}