cutthroat-coding/test.js

Concise implementations of common data structures and algorithms (DS&As) in JS. Clone of work by Lareine Jeng.

// 3rd party requires
var assert = require('assert');
var cloneDeep = require('lodash.clonedeep');

// Local requires
var array = require('./array.js');
var sorting = require('./index.js');

describe('Select Sort', function() {
    it('should sort an array', function(){
      var arr = cloneDeep(array.unsorted1);
      sorting.SelectSort(arr);
      assert.equal(sorting.AreArraysEqual(array.sorted1, arr), true);
    });
});

describe('AreArraysEqual', function() {
    it('check empty array1', function(){
      var arr1 = [];
      var arr2 = [0, 1 ,2];
      assert.equal(sorting.AreArraysEqual(arr1, arr2), false);
    });
});

describe('AreArraysEqual', function() {
    it('check empty array2', function(){
      var arr1 = [0, 1 ,2];
      var arr2 = [];
      console.log(arr1.length)
      console.log(arr2.length)
      // assert.equal(sorting.AreArraysEqual(arr1, arr2), false);
    });
});

describe('AreArraysEqual', function() {
    it('check both empty arrays', function(){
      var arr1 = [];
      var arr2 = [];
      console.log(arr1.length)
      assert.equal(sorting.AreArraysEqual(arr1, arr2), true);
    });
});

describe('AreArraysEqual', function() {
    it('check empty array2', function(){
      var arr1 = [0, 1];
      var arr2 = [0, 1 ,2];
      assert.equal(sorting.AreArraysEqual(arr1, arr2), false);
    });
});

describe('AreArraysEqual', function() {
    it('check equal arrays', function(){
      var arr1 = [0, 1, 2];
      var arr2 = [0, 1 ,2];
      assert.equal(sorting.AreArraysEqual(arr1, arr2), true);
    });
});

describe('AreArraysEqual', function() {
    it('check empty array2', function(){
      var arr1 = [0, 1, 2];
      var arr2 = [0, 1, 3];
      assert.equal(sorting.AreArraysEqual(arr1, arr2), false);
    });
});