This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# split panes using | and - | |
bind - split-window -h | |
bind | split-window -v | |
unbind '"' | |
unbind % | |
# open and split windows keeping current dir | |
bind | split-window -v -c "#{pane_current_path}" | |
bind - split-window -h -c "#{pane_current_path}" | |
bind c new-window -c "#{pane_current_path}" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
[user] | |
email = [email protected] | |
name = Will Soares | |
[alias] | |
alias = config --get-regexp ^alias\\. | |
ci = commit | |
ps = push | |
st = status -s | |
co = checkout | |
br = branch |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
toPdf.js | |
Gather all JPG, JPEG and PNG images in a folder and convert them to | |
individual files in an output folder named after the source folder name | |
$ node toPdf.js [source/folder/path] | |
The script will, within the current directory, create a folder with the | |
same name as the input folder and add all generated PDF files to it. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Constructor to create a new Node | |
function Node(key) { | |
this.key = key; | |
this.parent = null; | |
this.left = null; | |
this.right = null; | |
} | |
// Constructor to create a new BST | |
function BinarySearchTree() { |
OlderNewer