mohsen1

declare module 'mobx-remotedev' {
    /**
     * Connect MobX Remote Dev
     *
     * @param store observable or class to be monitored. In case you want to change its values
     *      (to time travel or cancel actions), you should export its result as in the example
     *       above (so we can extend the class).
     * @param config Configuration
     *
     * @return store

mohsen1

import {merge} from 'lodash';
import {autorun} from 'mobx';
// TODO: find a good polyfill for this
declare const URLSearchParams;

const routeMatcher = require("route-matcher").routeMatcher;
const createBrowserHistory = require('history/createBrowserHistory').default;

/*
 * A store have to implement these two getters to be routable

mohsen1

names = [
"A",
"ABLE",
"ABOUT",
"ABOVE",
"ACCORDING",
"ACCOUNT",
"ACROSS",
"ACT",
"ACTION",

mohsen1

/* Invert all the things! */
html
{
  -webkit-filter: invert(1) grayscale(0.6);
}
 
/* Execpt these guys... */
img,
.minibutton,
.state-indicator,

mohsen1

var fs = require('fs');

var random = (~~(Math.random() * 1e9)).toString(2);


fs.writeFile('./random.txt', random, function(err){
  if(err) console.error(err);
  else console.log('file has been written');
});

mohsen1

Let me introduce you to Classical Inheritance that never uses prototype. This is a bad coding exercise but will teach you the real Classical Inheritance which always compared to prototypal inheritance:

Make a custructor:

function Person(name, age){
  this.name = name;
  this.age = age;
  this.sayHello = function(){return "Hello! this is " + this.name;}
}

mohsen1

Number.prototype.pow = function(n){return Math.pow(this,n)}

function C(u){
  return document.createElement(u)
}

z = 50;
d = C('div')
i = C('input')

mohsen1

  ###########
# Aliases #
###########

alias ll='ls -l'
alias js='node'
alias subl='/Applications/Sublime\ Text\ 2.app/Contents/SharedSupport/bin/subl'
alias ls='ls -G'
alias gadd="git add .; git add -u .; git status;"
alias nook='cd ~/Projects/NookWeb/nook.com'   

mohsen1

Random Gist

mohsen1

function levenshteinDistance (s, t) {
        if (!s.length) return t.length;
        if (!t.length) return s.length;

        return Math.min(
                levenshteinDistance(s.substr(1), t) + 1,
                levenshteinDistance(t.substr(1), s) + 1,
                levenshteinDistance(s.substr(1), t.substr(1)) + (s[0] !== t[0] ? 1 : 0)
        );
}