LeeeeeeM

function throttle(fn, delay, context) {
  var timer;
  var context = context || this;
  var first = true;
  return function() {
    if (first) {
      fn.apply(context, [].slice.apply(arguments));
      first = false;
    }
    if (timer) {

LeeeeeeM

function throttle(fn, timeout, mustRunTime, context) {
  var last;
  var timer;
  return function() {
    current = Date.now();
    if (!last) {
      last = current;
    }
    clearTimeout(timer);
    if (current - last >= mustRunTime) {

LeeeeeeM

function insertSort(array) {
  var length = array.length;
  var j,temp;
  for(var i = 0; i < length; i++) {
    j = i;
    temp = array[i];
    while(j > 0 && array[j - 1] > temp) {
      array[j] = array[j - 1];
      j--;
    }

LeeeeeeM

function selectionSort(array) {
  var length = array.length;
  for (var i = 0; i < length - 1; i++) {
    var minIndex = i;
    for(var j = i; j < array.length; j++) {
      if (array[minIndex] > array[j]) {
        minIndex = j;
      }
    }
    if (minIndex !== i) {

LeeeeeeM

function bubbleSort(array) {
  var length = array.length;
  for (var i = 0; i < length - 1; i++) {
    for (var j = 0; j< length - 1 -i; j++) {
      if (array[j] > array[j + 1]) {
        swap(array, j, j+1);
      }
    }
  
  }

LeeeeeeM

var Class = (function () {
    initial = false;

    // var _mix = function(target, source) {
    //     for (var k in source) {
    //         if (!target.hasOwnProperty(k)) {
    //             target[k] = source[k];
    //         }
    //     }
    //     return target;

LeeeeeeM

const double = x => x * x;

[1, 2, 3].map(double);


[1, 2, 3].reduce((result, item) => (
    result.push(double(item)), result
), [])

LeeeeeeM

var timeout = (time, value) => {
    console.log('step into promise', time, value);
    return new Promise(resolve => {
        setTimeout(resolve, time, value);
    });
};

var queue = [2, 3, 5, 99, 1];

var dosth = value => {

LeeeeeeM

// 原始方法
function compose(...fns) {
    return function composed(result) {
        var list = fns.slice();
        while(list.length > 0) {
            result = list.pop()(result);
        }
        return result;
    }
}

LeeeeeeM

function curry(fn, arity = fn.length) {
    return (function nextCurried(prevArgs) {
        return function curried(...nextArgs) {
            var args = prevArgs.concat(nextArgs);
            if (args.length >= arity) {
                return fn(...args);
            }
            return nextCurried(args);
        }    
    })([]);