This file contains 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
#!/bin/sh | |
if [ "$#" -ne 1 ]; then | |
cat <<- EOF | |
Usage: $0 PROJECT | |
Creates the ~/workspace/PROJECT directory if it doesn't exist and opens it in VS Code. | |
EOF | |
exit 1 | |
fi |
This file contains 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
[alias] | |
# Deletes branches that are gone from remote | |
gone = "!f() { git fetch --all --prune; git branch -vv | awk '/: gone]/{print $1}' | xargs -r git branch -D; }; f" |
This file contains 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
// Tag which parses a multiline regexp pattern into a RegExp object, removing whitespace and comments | |
export function mrx (strings) { | |
if (strings.length !== 1) { | |
throw Error("mrx cannot process template strings with arguments.") | |
}; | |
// capture pattern and flags from a string in format `/pattern/flags` | |
const captureRx = /^\s*\/(.*)\/([a-z]*)\s*$/si; | |
const match = captureRx.exec(strings.raw[0]); | |
if (match === null) { |
This file contains 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
// A tool to help you create or solve monoalphabetic substitution ciphers. | |
// This code is left to the public domain. | |
// | |
// Run this in a Node interactive session or web browser console. | |
// Start by creating a machine instance with m = machine(message); | |
// Call m.replace() to progressively replace each letter with a new one. | |
// Use lowercase for your original message and uppercase for the | |
// substituted letters so you and the code can tell them apart. | |
// m.frequency will give you the fequency of each letter in the message. |
This file contains 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
<!DOCTYPE html><html lang=en> | |
<title>Template Site</title> |
This file contains 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
import random | |
deck = None | |
hand = None | |
def speak(message="", penalty=""): | |
maxlen = max(len(message), len(penalty)) | |
# pad both parts even |