Skip to main content

Unit Testing in NodeJS with Mocha and Chai

Getting Started


  • Install mocha and chai in your project folder

npm install mocha --save
npm install chai --save

  • Create a folder named test
  • Add a file named start.js
  • Add "mocha" to "test" in package.json

"test": "mocha"

  • Add the following example to start.js

const expect = require('chai').expect;
it('should add numbers correctly', function () {
    const num1 = 2;
    const num2 = 3;
    expect(num1 + num2).to.equal(5);
})

it('should nod give a result of 6', function () {
    const num1 = 3;
    const num2 = 3;
    expect(num1 + num2).not.to.equal(5);
})

  • Run the test

npm test
Real Scenario Example
Say, we have a middleware named is-auth.js
module.exports = (req, res, next) => {
  const authHeader = req.get('Authorization');
  if(!authHeader) {
    throw new Error('Not authenticated.');
  }
}
Add the following to a new file in test folder — auth-test.js
const expect = require('chai').expect;

const authMiddleware = require('../middleware/is-auth');

it('should throw error if authorization header is NOT present', function () {
    const req = {
        get: function (headerName) {
            return null;
        }
    };

    expect(authMiddleware.bind(this, req, {}, () => { })).to.throw('Not authenticated.');
})

it('should throw error if authorization header is only one word', function () {
    const req = {
        get: function (headerName) {
            return 'xyz';
        }
    };

    expect(authMiddleware.bind(this, req, {}, () => { })).to.throw();
})
Run the test
npm test
Output
project@1.0.0 test C:\project
> mocha

  √ should throw error if authorization header is NOT present
  √ should throw error if authorization header is only one word
  √ should add numbers correctly
  √ should nod give a result of 6

  4 passing (31ms)

Describe

Adding it blocks in describe function gives additional information of where the ojutput is coming from
Add the following to auth-test.js
const expect = require('chai').expect;

const authMiddleware = require('../middleware/is-auth');

describe('Auth middleware', function () {
    it('should throw error if authorization header is NOT present', function () {
        const req = {
            get: function (headerName) {
                return null;
            }
        };

        expect(authMiddleware.bind(this, req, {}, () => { })).to.throw('Not authenticated.');
    })

    it('should throw error if authorization header is only one word', function () {
        const req = {
            get: function (headerName) {
                return 'xyz';
            }
        };

        expect(authMiddleware.bind(this, req, {}, () => { })).to.throw();
    })
})
Output
project@1.0.0 test C:\project
> mocha

  √ should add numbers correctly
  √ should nod give a result of 6
  Auth middleware
    √ should throw error if authorization header is NOT present
    √ should throw error if authorization header is only one word

  4 passing (52ms)

What should not be tested and what should be

Functions from third party should not be tested by you. We must only test if our code behaves correctly on including the function.

Sinon

For restoring state of functions back if made changes for testing
Example,
sinon.stub(jwt, 'verify); // verify is the function of jwt library
jwt.verify.returns({userId: 'abc'}); // makes verify return {userId: 'abc'}
authMiddleware(req, {}, () => {}); // calls authMiddleware
expect(req).to.have.property('userId'); // checks if userId exists
expect(req).to.have.property('userId', 'abc'); // checks if value of userId is 'abc'
expect(jwt.verify.called).to.be.true; // checks if jwt.verfify function was called
jwt.verify.restore(); // restores state  of jwt.verify back to what it was before testing

Comments

Popular posts from this blog

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.

683 K Empty Slots

  Approach #1: Insert Into Sorted Structure [Accepted] Intuition Let's add flowers in the order they bloom. When each flower blooms, we check it's neighbors to see if they can satisfy the condition with the current flower. Algorithm We'll maintain  active , a sorted data structure containing every flower that has currently bloomed. When we add a flower to  active , we should check it's lower and higher neighbors. If some neighbor satisfies the condition, we know the condition occurred first on this day. Complexity Analysis Time Complexity (Java):  O(N \log N) O ( N lo g N ) , where  N N  is the length of  flowers . Every insertion and search is  O(\log N) O ( lo g N ) . Time Complexity (Python):  O(N^2) O ( N 2 ) . As above, except  list.insert  is  O(N) O ( N ) . Space Complexity:  O(N) O ( N ) , the size of  active . Approach #2: Min Queue [Accepted] Intuition For each contiguous block ("window") of  k  po...