darklight721

{
  "name": "SampleWebpack",
  "version": "1.0.0",
  "description": "",
  "main": "index.js",
  "scripts": {
    "webpack": "./node_modules/.bin/webpack",
    "bundle": "npm run webpack -- -p",
    "start": "npm run webpack -- -d --watch"
  },

darklight721

/*
 * jquery.tablesorter.js - a small table sorter jquery plugin
 * Usage:
 *   $('table').tablesorter();
 * Options:
 *   $('table').tablesorter({
 *     defaultSort: [0, 1] // initial sort - [<column index>, <1 (ascending) || -1 (descending)>]
 *   });
 * Action Triggers:
 *   $('table').trigger('update');       // to update the table when there are changes like addition/removal of <tr>/<td>

darklight721

atom.commands.add 'atom-text-editor',
  'easy-semicolon:end-line': (event) ->
    editor = @getModel()
    editor.moveToEndOfLine()
    editor.insertText(';')

darklight721

export PS1="\[\e[1;34m\]\u@\h\[\e[0m\]:\[\e[1;36m\]\W\[\e[0m\]$ "

alias ll="ls -ahlFG"
alias rmd="rm -rf"
alias fsize="stat -f%z"
alias finder="open -a Finder ./"

mcd() { mkdir "$1" && cd "$1"; }

gitr() {

darklight721

function add(...n) {
  let t = n.reduce((a, b) => a + b);
  let a = add.bind(0, t);
  a.valueOf = () => t;
  return a;
}

darklight721

{
  "parser": "babel-eslint",
  "rules": {
    // best practices
    "curly": [2, "multi-line"],
    "dot-notation": 2,
    "dot-location": [2, "property"],
    "eqeqeq": [2, "allow-null"],
    "guard-for-in": 2,
    "no-caller": 2,

darklight721

# Motion commands

h - move left
j - move down
k - move up
l - move right

w - move to next word
b - move to beginning of word
e - move to end of word

darklight721

void insertion_sort(int list[], int size)
{
	int i, j, insertVal;
	
	for (i = 1; i < size; i++) {
		insertVal = list[i];
		for (j = i; j > 0 && insertVal < list[j - 1]; j--) {
			list[j] = list[j - 1];
		}
		list[j] = insertVal;

darklight721

#include <stdio.h>
#include <stdlib.h>

int ** makeGrid(int size, int *startX, int *startY, int *endX, int *endY)
{
    // allocate memory for the grid
    int **grid = (int**)malloc(sizeof(int*) * size);
    int x, y;
    for (x = 0; x < size; x++) {
        grid[x] = (int*)malloc(sizeof(int) * size);

darklight721

void quick_sort(int list[], int left, int right)
{
	if (left < right) {
		int pivot = (left + right) / 2; // left + (right - left) / 2 is safer to use for large lists
		pivot = partition(list, left, right, pivot);
		quick_sort(list, left, pivot - 1);
		quick_sort(list, pivot + 1, right);
	}
}