Code coverage report for spec/algo/2-linkedLists/kthToLast.spec.js

Statements: 100% (28 / 28)      Branches: 100% (0 / 0)      Functions: 100% (6 / 6)      Lines: 100% (28 / 28)      Ignored: none     

All files » spec/algo/2-linkedLists/ » kthToLast.spec.js
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 441 1   1 1 1     1 4 4 4 4 4 4 4 4 4 4       1 1 1     1 1 1     1 1 1       1 1 1      
var kthToLast = require("../../../lib/algorithms/2-linkedLists/kthToLast.js");
var LinkedList = require("../../../lib/dataStructures/linkedList.js");
 
describe('When using kthToLast() on a linked list with 9 items', function () {
	var nineItems;
	var noDupes;
 
 
	beforeEach(function() {
		nineItems = new LinkedList();
		nineItems.add(1);
		nineItems.add(2);
		nineItems.add(3);
		nineItems.add(4);
		nineItems.add(5);
		nineItems.add(6);
		nineItems.add(7);
		nineItems.add(8);
		nineItems.add(9);
 
	});
 
	it('given 3, the 3rd to last item will be returned.', function () {
		var result = kthToLast(3, nineItems.start);
		expect(result).toBe(7);
	});
 
	it('given 1, the last item will be returned.', function () {
		var result = kthToLast(1, nineItems.start);
		expect(result).toBe(9);
	});
 
	it('given 9, the first item will be returned.', function () {
		var result = kthToLast(9, nineItems.start);
		expect(result).toBe(1);
	});
 
 
	it('given 10, null will be returned', function () {
		var result = kthToLast(10, nineItems.start);
		expect(result).toBe(null);
	});
 
});