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

Statements: 100% (31 / 31)      Branches: 100% (0 / 0)      Functions: 100% (4 / 4)      Lines: 100% (31 / 31)      Ignored: none     

All files » spec/algo/2-linkedLists/ » deDupe.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 431 1   1 1 1     1 2 2 2 2 2 2 2 2 2 2 2 2   2 2 2 2 2 2 2       1 1 1     1 1 1      
var deDupe = require("../../../lib/algorithms/2-linkedLists/deDupe.js");
var LinkedList = require("../../../lib/dataStructures/linkedList.js");
 
describe('When using deDupe() on a linked list of integers', function () {
	var containsDupes;
	var noDupes;
 
 
	beforeEach(function() {
		containsDupes = new LinkedList();
		containsDupes.add(1);
		containsDupes.add(2);
		containsDupes.add(1);
		containsDupes.add(3);
		containsDupes.add(4);
		containsDupes.add(4);
		containsDupes.add(4);
		containsDupes.add(5);
		containsDupes.add(6);
		containsDupes.add(6);
		containsDupes.add(6);
 
		noDupes = new LinkedList();
		noDupes.add(1);
		noDupes.add(2);
		noDupes.add(3);
		noDupes.add(4);
		noDupes.add(5);
		noDupes.add(6);
 
	});
 
	it('any duplicate elements will be removed from the linked list.', function () {
		var result = deDupe(containsDupes.start);
		expect(JSON.stringify(result)).toEqual(JSON.stringify(noDupes.start));
	});
 
	it('if there are no dups, nothing will happen', function () {
		var result = deDupe(noDupes.start);
		expect(JSON.stringify(result)).toEqual(JSON.stringify(noDupes.start));
	});
 
});