Skip to main content

IIFE in JavaScript


An IIFE means Immediately Invoked Function Expression. IIFE is a JavaSctript function that runs as soon as it is defined.

What is IIFE in JavaScript? | JavaScript IIFE with example

 
An IIFE means Immediately Invoked Function Expression. IIFE is a JavaSctript function that runs as soon as it is defined.
I know it is difficult to understand but i describe in simplicity so lets start.
So this is normal function in JavaScript that we used in our daily life.

// Normal function in JavaScript

function addTwoValues() {

var a = 10;
var b = 10;
  var answer = x + y; 
 
  console.log(answer);
}

addTogether();

So here is function addTwoValues() which is add two values and print the output.
I called that function after in last where function ends.
So, there might be question in your mind yes we use like this what is problem in that.

In above example our variables are immutable which means we can not change from outside of function. So our variables are not accessed, but what about function that can be accessed from anywhere.

So we have solution for that it calls IIFE.
It is a design pattern which is also known as a Self-Executing Anonymous Function and contains two major parts:
  1. The first is the anonymous function with lexical scope enclosed within the Grouping Operator (). This prevents accessing variables within the IIFE idiom as well as polluting the global scope.
  2. The second part creates the immediately invoked function expression () through which the JavaScript engine will directly interpret the function.
So the first thing we do is wrap our addTwoValues function in breakets.
// Function Expression in JavaScript

(function addTwoValues() {

var a = 10;
var b = 10;
   var answer = x + y; 
  
  console.log(answer);
 });

 addTogether();

Then delete function name. So now how we can call this function in your head.
Well its simple we add brackets at the end of the function (before the semicolon).

// Immediately Invoked Function Expression in JavaScript

(function () {

var a = 10;
var b = 10;
  var answer = x + y;
 
  console.log(answer);

})();

The function becomes a function expression which is immediately executed. The variable within the expression can not be accessed from outside it.

lets see another example of IIFE.
so you understand very easily from example.

(function() {

    // Declared variable name and assign value
    var name = "UniqueThrowdown";

})();

console.log(name);
// Throws "Uncaught ReferenceError: name is not defined"

At above example if we try to access name variable then we got error.
So how we can access that variable? Lets see.

var result = (function() {

    // Declared variable name and assign value
    var name = "UniqueThrowdown";
    return name;

})();

console.log(result);
// UniqueThrowdown

I am adding MDN website link where you can learn more about IIFE.

    Learn More About IIFE



Comments

  1. This is really awesome feature when it comes for security..
    And really nice blog..
    I fully understand what is iife
    thanks..

    ReplyDelete

Post a Comment

Popular posts from this blog

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And ...