thm-design

# Your init script
#
# Atom will evaluate this file each time a new window is opened. It is run
# after packages are loaded/activated and after the previous editor state
# has been restored.
#
# An example hack to log to the console when each text editor is saved.
#
# atom.workspace.observeTextEditors (editor) ->
#   editor.onDidSave ->

thm-design

// Dirty overload the native function
var parseInt = function(arg1) {
  if (arg1 === "Infinity") {
    return NaN;
  }
  if (arg1 === "Infinity+1") {
    return "Infinity+1";
  }
  if (arg1 === "1+1+1") {
    return "3?";

thm-design

1) Atom editor: https://atom.io/
 - download and install
 - install sync setting package
    PAT: 2083defe32ac2d396638329c8a9d59f26b594031
    GIST ID: dc58bfdf1cc2fa2e502e21c0958bddb5
    
2) NVM (Node.js Version Manager)
  - $ curl -o- https://raw.githubusercontent.com/creationix/nvm/v0.33.2/install.sh | bash
  
3) Homebrew

thm-design

// 🔥 Node 7.6 has async/await! Here is a quick run down on how async/await works

const axios = require('axios'); // promised based requests - like fetch()

function getCoffee() {
  return new Promise(resolve => {
    setTimeout(() => resolve('☕'), 2000); // it takes 2 seconds to make coffee
  });
}

thm-design

/*
 * jQuery Nivo Slider v2.6
 * http://nivo.dev7studios.com
 *
 * Copyright 2011, Gilbert Pellegrom
 * Free to use and abuse under the MIT license.
 * http://www.opensource.org/licenses/mit-license.php
 * 
 * 
 * 100% width + background color cycle + transparent image by Tony H. Meyer 

thm-design

/*
  Merge Sort
*/

const mergeSort = (nums) => {
  if (nums.length < 2) return nums;
  const length = nums.length;
  const middle = Math.floor(length / 2);
  const left = nums.slice(0, middle);
  const right = nums.slice(middle, length);

thm-design

/*
  Make a function that computes a factorial recursively.
  A factorial is when you take a number n and multiply by each preceding integer until you hit one.
  n * (n-1) * (n-2) ... * 3 * 2 * 1
  
  Call the function factorial
  
  factorial(1) = 1
  factorial(2) = 2
  factorial(3) = 6 

thm-design

/*
  Insertion sort
  The idea here is that the beginning of your list is sorted and the everything else is assumed to be an unsorted mess.
  The outer loop goes over the whole list, the index of which signifies where the "sorted" part of the list is. The inner
  loop goes over the sorted part of the list and inserts it into the correct position in the array.
*/
var insertionSort = (nums) => {  
  for (let i = 1; i < nums.length; i++) {
    for (let j = 0; j < i; j++) {
      snapshot(nums);

thm-design

/*
  Bubble sort works by comparing two adjacent numbers next to each other and then
  swapping their places if the smaller index's value is larger than the larger
  index's. Continue looping through until all values are in ascending order
*/

const bubbleSort = (arr) => {
  arr.forEach((n, i) => {
    if (arr[i] > arr[i + 1]) {
      arr[i] = arr[i + 1];

thm-design

.ipad-only, .iphone-only, .retina-only, .non-retina-only, .retina-iphone-only, .non-retina-iphone-only { display: none; }

/* ---------- iPad Only ---------- */
@media only screen and (device-width: 768px) {
  .ipad-only { display: block; }
}

/* ---------- iPhone/iPod Only ---------- */
@media only screen and (device-width: 320px) {
  .iphone-only { display: block; }