zoukankan      html  css  js  c++  java
  • [Javascipt] Immediately-Invoker 2

    Now the people at Poplar Puzzles would like you to treat an array of functions like a Queue, passing the result of each function into the next until the Queue is empty. They’ve sent you the new queue of functions, and a “simple directive”:

    In a variable called applyAndEmpty, build and store a function that takes in a single number and any Queue of functions as inputs and then applies the Queue’s functions in order to the input number, where the results of each function become the next function’s input. Additionally, the queue should be empty following your application. Lastly, because we are just that freaking awesome, any loops you use must only be for-loops. MWAHAHA. Then call your new function using the number 2 and the provided puzzlers queue as initial inputs, and alert the result.- PuZzLe MaSTeRs

    The new Queue of functions to use is below.

    var puzzlers = [
      function ( a ) { return 8*a - 10; },
      function ( a ) { return (a-3) * (a-3) * (a-3); },
      function ( a ) { return a * a + 4; },
      function ( a ) { return a % 5; }
    ];
    

    We’ve provided the queue and the start value for you.

    var puzzlers = [
      function ( a ) { return 8*a - 10; },
      function ( a ) { return (a-3) * (a-3) * (a-3); },
      function ( a ) { return a * a + 4; },
      function ( a ) { return a % 5; }
    ];
    var start = 2;
    var applyAndEmpty = function(num){
      puzzlers.map(function(func){
          var res = func(num);
        num = res;
        alert(res);
            return res;
      });
    };
    applyAndEmpty(start);
    function buildNow(){
      
      return (function(){
        
        alert("RUN NOW");
      })(); // <<---- We add '()', so that as soon as this function return, it will Immediately invoke.
    }
    buildNow();
    
    
    function buildWhenICall(){
      
      return function(){
        
        alert("You call me!");
      };
    }
    
    buildWhenICall()(); // <<--- Or we can do something like that
    // The same as
    //var run = buildWhenICall();
    //run();
    
    
  • 相关阅读:
    1.求整数最大的连续0的个数 BinaryGap Find longest sequence of zeros in binary representation of an integer.
    JTree实例
    java发送邮件完整实例 java邮件工具类
    oracle存储过程中文乱码问题
    黑马day16 jquery&amp;内容过滤选择器&amp;可见度选择器
    隐性反馈行为数据的协同过滤推荐算法
    ACdream 1083 有向无环图dp
    正則表達式
    hdu 2209 bfs+状压
    action属性注入为null
  • 原文地址:https://www.cnblogs.com/Answer1215/p/3887437.html
Copyright © 2011-2022 走看看